Triangulation class - implementation.
More...
Go to the source code of this file.
|
namespace | CDT |
| Namespace containing triangulation functionality.
|
|
|
const float | CDT::detail::defaults::minDistToConstraintEdge (0) |
|
Edge | CDT::RemapNoSuperTriangle (const Edge &e) |
| Remap removing super-triangle: subtract 3 from vertices.
|
|
template<typename T, typename Allocator1> |
void | CDT::detail::insert_unique (std::vector< T, Allocator1 > &to, const T &elem) |
|
template<typename T, typename Allocator1, typename Allocator2> |
void | CDT::detail::insert_unique (std::vector< T, Allocator1 > &to, const std::vector< T, Allocator2 > &from) |
|
template<typename T> |
T | CDT::detail::lerp (const T &a, const T &b, const T t) |
|
template<typename T> |
V2d< T > | CDT::detail::intersectionPosition (const V2d< T > &a, const V2d< T > &b, const V2d< T > &c, const V2d< T > &d) |
|
template<typename T> |
double | CDT::detail::log2_bc (T x) |
|
std::size_t | CDT::detail::maxQueueLengthBFSKDTree (const std::size_t vertexCount) |
| Since KD-tree bulk load builds a balanced tree the maximum length of a queue can be pre-calculated: it is calculated as size of a completely filled tree layer plus the number of the nodes on a completely filled layer that have two children.
|
|
Triangulation class - implementation.
Definition in file Triangulation.hpp.
◆ insert_unique() [1/2]
template<typename T, typename Allocator1, typename Allocator2>
void CDT::detail::insert_unique |
( |
std::vector< T, Allocator1 > & | to, |
|
|
const std::vector< T, Allocator2 > & | from ) |
◆ insert_unique() [2/2]
template<typename T, typename Allocator1>
void CDT::detail::insert_unique |
( |
std::vector< T, Allocator1 > & | to, |
|
|
const T & | elem ) |
◆ intersectionPosition()
template<typename T>
V2d< T > CDT::detail::intersectionPosition |
( |
const V2d< T > & | a, |
|
|
const V2d< T > & | b, |
|
|
const V2d< T > & | c, |
|
|
const V2d< T > & | d ) |
◆ lerp()
template<typename T>
T CDT::detail::lerp |
( |
const T & | a, |
|
|
const T & | b, |
|
|
const T | t ) |
◆ log2_bc()
template<typename T>
double CDT::detail::log2_bc |
( |
T | x | ) |
|
|
inline |
◆ maxQueueLengthBFSKDTree()
std::size_t CDT::detail::maxQueueLengthBFSKDTree |
( |
const std::size_t | vertexCount | ) |
|
|
inline |
Since KD-tree bulk load builds a balanced tree the maximum length of a queue can be pre-calculated: it is calculated as size of a completely filled tree layer plus the number of the nodes on a completely filled layer that have two children.
Definition at line 1922 of file Triangulation.hpp.
◆ intersectingEdgesStrategy
const IntersectingConstraintEdges::Enum CDT::detail::defaults::intersectingEdgesStrategy |
Initial value:=
@ NotAllowed
constraint edge intersections are not allowed
Definition at line 34 of file Triangulation.hpp.
◆ nTargetVerts
const std::size_t CDT::detail::defaults::nTargetVerts = 0 |
◆ superGeomType
const SuperGeometryType::Enum CDT::detail::defaults::superGeomType = SuperGeometryType::SuperTriangle |
◆ vertexInsertionOrder
const VertexInsertionOrder::Enum CDT::detail::defaults::vertexInsertionOrder |
Initial value:=
@ Auto
Automatic insertion order optimized for better performance.
Definition at line 32 of file Triangulation.hpp.