CDT  1.4.1
C++ library for constrained Delaunay triangulation
Loading...
Searching...
No Matches
CDT.hpp File Reference

Public API - implementation. More...

#include "CDT.h"
#include <algorithm>
#include <deque>
#include <limits>
#include <stdexcept>
Include dependency graph for CDT.hpp:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Namespaces

namespace  CDT
 Namespace containing triangulation functionality.
 

Functions

CDT_EXPORT VerticesTriangles CDT::calculateTrianglesByVertex (const TriangleVec &triangles, VertInd verticesSize)
 Calculate triangles adjacent to vertices (triangles by vertex index)
 
template<typename T >
DuplicatesInfo CDT::RemoveDuplicates (std::vector< V2d< T > > &vertices)
 Remove duplicated points in-place.
 
CDT_EXPORT void CDT::RemapEdges (std::vector< Edge > &edges, const std::vector< std::size_t > &mapping)
 Remap vertex indices in edges (in-place) using given vertex-index mapping.
 
template<typename T >
DuplicatesInfo CDT::RemoveDuplicatesAndRemapEdges (std::vector< V2d< T > > &vertices, std::vector< Edge > &edges)
 Same as a chained call of CDT::RemoveDuplicates + CDT::RemapEdges.
 
CDT_EXPORT EdgeUSet CDT::extractEdgesFromTriangles (const TriangleVec &triangles)
 Extract all edges of triangles.
 
CDT_EXPORT unordered_map< Edge, EdgeVecCDT::EdgeToPiecesMapping (const unordered_map< Edge, EdgeVec > &pieceToOriginals)
 

Detailed Description

Public API - implementation.

Definition in file CDT.hpp.