14#ifdef CDT_USE_AS_COMPILED_LIBRARY
32template class CDT_EXPORT Triangulation<double>;
45 std::vector<V2d<float> >&,
48 std::vector<V2d<double> >&,
63 Triangulation<float>&);
71 Triangulation<double>&);
#define CDT_EXPORT
Export not needed in header-only mode.
Utilities and helpers - implementation.
Public API - implementation.
Helper function to initialize triangulation with regular grid instead of super-triangle.
Triangulation class - implementation.
Helper function to verify if triangulation has no inconsistencies.
Data structure representing a 2D constrained Delaunay triangulation.
void RemoveDuplicates(std::vector< TVertex, TAllocator > &vertices, const std::vector< std::size_t > &duplicates)
Remove duplicates in-place from vector of custom points.
DuplicatesInfo RemoveDuplicatesAndRemapEdges(std::vector< TVertex, TVertexAllocator > &vertices, TGetVertexCoordX getX, TGetVertexCoordY getY, TEdgeIter edgesFirst, TEdgeIter edgesLast, TGetEdgeVertexStart getStart, TGetEdgeVertexEnd getEnd, TMakeEdgeFromStartAndEnd makeEdge)
Find point duplicates, remove them from vector (in-place) and remap edges (in-place)
Namespace containing triangulation functionality.
bool verifyTopology(const CDT::Triangulation< T, TNearPointLocator > &cdt)
Verify that triangulation topology is consistent.
Box2d< T > envelopBox(TVertexIter first, TVertexIter last, TGetVertexCoordX getX, TGetVertexCoordY getY)
Bounding box of a collection of custom 2D points given coordinate getters.
void initializeWithRegularGrid(const T xmin, const T xmax, const T ymin, const T ymax, const std::size_t xres, const std::size_t yres, Triangulation< T, TNearPointLocator > &out)
Make a triangulation that uses regular grid triangles instead of super-triangle.