35 #include "advancing_front.h"
36 #include "sweep_context.h"
56 CDT(
const std::vector<Point*>& polyline);
68 void AddHole(
const std::vector<Point*>& polyline);
90 std::list<Triangle*>
GetMap();
98 SweepContext* sweep_context_;
CDT(const std::vector< Point * > &polyline)
Constructor - add polyline with non repeating points.
Definition: cdt.cpp:35
~CDT()
Destructor - clean up memory.
Definition: cdt.cpp:65
Sweep-line, Constrained Delauney Triangulation (CDT) See: Domiter, V.
Definition: shapes.cpp:34
void AddHole(const std::vector< Point * > &polyline)
Add a hole.
Definition: cdt.cpp:41
void AddPoint(Point *point)
Add a steiner point.
Definition: cdt.cpp:46
std::vector< Triangle * > GetTriangles()
Get CDT triangles.
Definition: cdt.cpp:55
void Triangulate()
Triangulate - do this AFTER you've added the polyline, holes, and Steiner points.
Definition: cdt.cpp:50
std::list< Triangle * > GetMap()
Get triangle map.
Definition: cdt.cpp:60