|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Shared edge-group extraction for triangle meshes. More...
#include <geom_algorithms.H>
Classes | |
| struct | EdgeRef |
| Represents a reference to a triangle edge. More... | |
Static Public Member Functions | |
| template<typename TriangleArray , typename GroupFn > | |
| static void | for_each_sorted_edge_group (const TriangleArray &triangles, GroupFn on_group) |
Static Private Member Functions | |
| static void | append_edge (Array< EdgeRef > &edges, size_t a, size_t b, const size_t tri, const size_t third) |
Shared edge-group extraction for triangle meshes.
Emits the three undirected edges of each triangle, sorts by (u,v,tri), then visits contiguous groups with the same undirected edge key.
Utilities for finding adjacencies between triangles in a mesh.
Provides a mechanism to iterate over groups of triangles that share the same edge.
Definition at line 340 of file geom_algorithms.H.
|
inlinestaticprivate |
Definition at line 355 of file geom_algorithms.H.
References Aleph::Array< T >::append(), and Aleph::divide_and_conquer_partition_dp().
Referenced by for_each_sorted_edge_group().
|
inlinestatic |
Definition at line 370 of file geom_algorithms.H.
References Aleph::and, append_edge(), Aleph::divide_and_conquer_partition_dp(), Aleph::quicksort_op(), Aleph::Array< T >::reserve(), Aleph::Array< T >::size(), Aleph::GeomTriangleAdjacencyUtils::EdgeRef::tri, Aleph::GeomTriangleAdjacencyUtils::EdgeRef::u, and Aleph::GeomTriangleAdjacencyUtils::EdgeRef::v.
Referenced by Aleph::ConstrainedDelaunayTriangulation::build_adjacency(), Aleph::PowerDiagram::operator()(), and Aleph::VoronoiDiagramFromDelaunay::operator()().