|
| std::optional< VertMap > | MR::findSmallestCloseVertices (const Mesh &mesh, float closeDist, const ProgressCallback &cb={}) |
| std::optional< VertMap > | MR::findSmallestCloseVertices (const PointCloud &cloud, float closeDist, const ProgressCallback &cb={}) |
| std::optional< VertMap > | MR::findSmallestCloseVertices (const VertCoords &points, float closeDist, const VertBitSet *valid=nullptr, const ProgressCallback &cb={}) |
| std::optional< VertMap > | MR::findSmallestCloseVerticesUsingTree (const VertCoords &points, float closeDist, const AABBTreePoints &tree, const VertBitSet *valid, const ProgressCallback &cb={}) |
| std::optional< VertBitSet > | MR::findCloseVertices (const Mesh &mesh, float closeDist, const ProgressCallback &cb={}) |
| | finds all close vertices, where for each vertex there is another one located within given distance
|
| std::optional< VertBitSet > | MR::findCloseVertices (const PointCloud &cloud, float closeDist, const ProgressCallback &cb={}) |
| | finds all close vertices, where for each vertex there is another one located within given distance
|
| std::optional< VertBitSet > | MR::findCloseVertices (const VertCoords &points, float closeDist, const VertBitSet *valid=nullptr, const ProgressCallback &cb={}) |
| | finds all close vertices, where for each vertex there is another one located within given distance
|
| VertBitSet | MR::findCloseVertices (const VertMap &smallestMap) |
| | finds all close vertices, where for each vertex there is another one located within given distance; smallestMap is the result of findSmallestCloseVertices function call
|
| std::vector< EdgePair > | MR::findTwinEdgePairs (const Mesh &mesh, float closeDist) |
| | definition: if A,B and C,D are close vertices, then let us name AC and BD twin edges
|
| EdgeBitSet | MR::findTwinEdges (const Mesh &mesh, float closeDist) |
| | finds all directed twin edges
|
| EdgeBitSet | MR::findTwinEdges (const std::vector< EdgePair > &pairs) |
| UndirectedEdgeBitSet | MR::findTwinUndirectedEdges (const Mesh &mesh, float closeDist) |
| | finds all undirected twin edges
|
| UndirectedEdgeBitSet | MR::findTwinUndirectedEdges (const std::vector< EdgePair > &pairs) |
| UndirectedEdgeHashMap | MR::findTwinUndirectedEdgeHashMap (const Mesh &mesh, float closeDist) |
| | provided that each edge has at most one twin, composes bidirectional mapping between twins
|
| UndirectedEdgeHashMap | MR::findTwinUndirectedEdgeHashMap (const std::vector< EdgePair > &pairs) |