|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Constrained Delaunay Triangulation (CDT) example. More...
Go to the source code of this file.
Functions | |
| static void | print_point (const Point &p) |
| int | main () |
Constrained Delaunay Triangulation (CDT) example.
Demonstrates:
ConstrainedDelaunayTriangulation on a point set with constraint edges.Definition in file constrained_delaunay_example.cc.
| int main | ( | ) |
Definition at line 59 of file constrained_delaunay_example.cc.
References Aleph::and, Aleph::DynList< T >::append(), Aleph::ConstrainedDelaunayTriangulation::as_triangles(), Aleph::divide_and_conquer_partition_dp(), and print_point().
|
static |
Definition at line 53 of file constrained_delaunay_example.cc.
References Aleph::geom_number_to_double(), Aleph::Point::get_x(), and Aleph::Point::get_y().
Referenced by main().