|
None | buildLocalTriangulation (PointCloud cloud, VertId v, TriangulationHelpers.Settings settings, TriangulationHelpers.TriangulatedFanData fanData) |
|
std_vector_SomeLocalTriangulations | buildLocalTriangulations (PointCloud cloud, TriangulationHelpers.Settings settings, func_bool_from_float progress='MR::ProgressCallback{}') |
|
AllLocalTriangulations | buildUnitedLocalTriangulations (PointCloud cloud, TriangulationHelpers.Settings settings, func_bool_from_float progress='MR::ProgressCallback{}') |
|
None | filterNeighbors (VertCoords normals, VertId v, std_vector_Id_VertTag neighbors) |
|
VertBitSet | findBoundaryPoints (PointCloud pointCloud, TriangulationHelpers.Settings settings, func_bool_from_float cb='MR::ProgressCallback{}') |
|
None | findNeighborsInBall (PointCloud pointCloud, VertId v, float radius, std_vector_Id_VertTag neighbors) |
|
float | findNumNeighbors (PointCloud pointCloud, VertId v, int numNeis, std_vector_Id_VertTag neighbors, FewSmallest_PointsProjectionResult tmp, float upDistLimitSq=3.4028234663852886e+38) |
|
bool | isBoundaryPoint (PointCloud cloud, VertId v, TriangulationHelpers.Settings settings, TriangulationHelpers.TriangulatedFanData fanData) |
|
float | updateNeighborsRadius (VertCoords points, VertId v, VertId boundaryV, std_vector_Id_VertTag fan, float baseRadius) |
|
◆ buildLocalTriangulation()
constructs local triangulation around given point
◆ buildLocalTriangulations()
computes all local triangulations of all points in the cloud, and returns them distributed among
a set of SomeLocalTriangulations objects
◆ buildUnitedLocalTriangulations()
/ computes local triangulations of all points in the cloud united in one struct
◆ filterNeighbors()
\\brief Filter neighbors with crossing normals
\\ingroup TriangulationHelpersGroup
◆ findBoundaryPoints()
Returns bit set of points that are considered as boundary by calling isBoundaryPoint in each
◆ findNeighborsInBall()
\\brief Finds all neighbors of v in given radius (v excluded)
\\ingroup TriangulationHelpersGroup
◆ findNumNeighbors()
\\brief Finds at most given number of neighbors of v (v excluded)
\\param tmp temporary storage to avoid its allocation
\\param upDistLimitSq upper limit on the distance in question, points with larger distance than it will not be returned
\\return maxDistSq to the furthest returned neighbor (or 0 if no neighbours are returned)
\\ingroup TriangulationHelpersGroup
◆ isBoundaryPoint()
\\brief Checks if given vertex is on boundary of the point cloud, by constructing local triangulation around it
\\ingroup TriangulationHelpersGroup
\\param cloud input point cloud
\\param v vertex id to check
\\param settings all parameters of the computation
\\param fanData cache structure for neighbors, not to allocate for multiple calls
\\returns true if vertex is boundary, false otherwise
◆ updateNeighborsRadius()
\\brief Finds max radius of neighbors search, for possible better local triangulation
\\param borderV first boundary vertex in \\param fan (next VertId in fan is also boundary but first is enough)
\\ingroup TriangulationHelpersGroup
The documentation for this class was generated from the following file: