9 #ifndef triangulator_H_
10 #define triangulator_H_
82 static bool segmentInCone(
const DtVertexManager* mgr,
int v0,
int v1,
int vm,
int vp);
97 static bool properIntersect(
const DtVertexManager* mgr,
int a,
int b,
int c,
int d);
106 static bool intersect(
const DtVertexManager* mgr,
int a,
int b,
int c,
int d);
114 static bool isDiagonal(
const DtVertexManager* mgr,
int numberOfVertices,
115 std::vector<DtVertexID>& vertIds,
int i0,
int i1);
129 static void printVerts(std::vector<DtVertexID> lst);
141 static void triangulatePolygon(
146 std::vector<DtVertexID>& vertIds);
153 static bool alignPolygonToXYPlane(
160 static void transformPolygon(
Definition: triangulator.h:23
Definition: triangulator.h:21
#define DT_DLL_gdb
Definition: gdbDefines.h:25
Definition: vertexManager.h:26
Definition: triangulator.h:22
static const double theErrorMargin
Definition: triangulator.h:166
unsigned int DtSurfaceID
Definition: surfaceManager.h:25
Definition: polygonIndirect.h:29
Definition: terrainDatabase.h:148
DtTriangulationResult
Definition: triangulator.h:19
Triangulates all the polygons with more than three vertices of a gdb terrain database. The algorithmic used in this class is based on the theory presented in Computational Geometry in C (Joseph O'Rourke) - Chapter 1 Geometric Tools for Computer Graphics (Schneider) - Section 13.9 Computer Graphics (Foley & Van Dam) - p. 222 Notation: vi = vertex located at position i inside the vertex manager.
Definition: triangulator.h:34