|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
The result of a Delaunay triangulation. More...
#include <geom_algorithms.H>
Public Attributes | |
| Array< Point > | sites |
| Unique, sorted input points used for triangulation. | |
| Array< IndexedTriangle > | triangles |
| Triangles forming the Delaunay triangulation. | |
The result of a Delaunay triangulation.
Definition at line 2118 of file geom_algorithms.H.
Unique, sorted input points used for triangulation.
Definition at line 2120 of file geom_algorithms.H.
Referenced by Aleph::DelaunayTriangulationBowyerWatson::as_triangles(), Aleph::VoronoiDiagramFortune::is_valid_delaunay(), main(), Aleph::VoronoiDiagramFromDelaunay::operator()(), Aleph::DelaunayTriangulationBowyerWatson::operator()(), and Aleph::put_delaunay_result().
| Array<IndexedTriangle> Aleph::DelaunayTriangulationBowyerWatson::Result::triangles |
Triangles forming the Delaunay triangulation.
Definition at line 2121 of file geom_algorithms.H.
Referenced by Aleph::DelaunayTriangulationBowyerWatson::as_triangles(), Aleph::VoronoiDiagramFortune::is_valid_delaunay(), main(), Aleph::VoronoiDiagramFromDelaunay::operator()(), and Aleph::put_delaunay_result().