#include <list>
#include <cmath>
Go to the source code of this file.
Namespaces | |
namespace | ttl_constr |
Constrained Delaunay triangulation. | |
namespace | ttl |
Main interface to TTL. | |
Functions | |
template<class DartType > | |
bool | ttl_constr::isTheConstraint (const DartType &dart, const DartType &dstart, const DartType &dend) |
template<class TraitsType , class DartType > | |
bool | ttl_constr::crossesConstraint (DartType &dstart, DartType &dend, DartType &d1, DartType &d2) |
template<class TraitsType , class DartType > | |
DartType | ttl_constr::getAtSmallestAngle (const DartType &dstart, const DartType &dend) |
template<class TraitsType , class DartType , class ListType > | |
DartType | ttl_constr::findCrossingEdges (const DartType &dstart, const DartType &dend, ListType &elist) |
template<class TraitsType , class DartType > | |
void | ttl_constr::transformToConstraint (DartType &dstart, DartType &dend, list< DartType > &elist) |
Constrained (Delaunay) Triangulation | |
template<class TraitsType , class DartType > | |
DartType | ttl::insertConstraint (DartType &dstart, DartType &dend, bool optimize_delaunay) |
Inserts a constrained edge between two existing nodes in a triangulation. |