CDT  2.0.1
C++ library for constrained Delaunay triangulation
Loading...
Searching...
No Matches
CDT::Unrefined Struct Reference

Counts of the refinements that Triangulation::refineTriangles was not able to perform. More...

#include <Triangulation.h>

Public Member Functions

 Unrefined ()
 Constructor: all the counts start at zero.
 

Public Attributes

std::size_t shortEdgeTriangles
 triangles whose shortest edge is shorter than the threshold
 
std::size_t circumcenterOutside
 triangles whose circumcenter is outside the triangulated area
 
std::size_t circumcenterOnVertex
 triangles whose circumcenter coincides with an existing vertex
 
std::size_t sharpFixedCorner
 triangles whose smallest angle is enclosed by two fixed edges: such an angle comes from the input and can not be made any larger
 
std::size_t shortEdges
 fixed edges that are shorter than the threshold
 
std::size_t splitVertexInvalid
 fixed edges whose split vertex can not be placed: inserting it would break the triangulation's topology
 

Detailed Description

Counts of the refinements that Triangulation::refineTriangles was not able to perform.

Note
a triangle or an edge is counted once per attempt to refine it and is re-visited after nearby splits: the same triangle or edge can be counted more than once
to locate the problems in the resulting triangulation use Triangulation::findUnrefinedTriangles and Triangulation::findEncroachedFixedEdges

Definition at line 104 of file Triangulation.h.

Constructor & Destructor Documentation

◆ Unrefined()

CDT_INLINE_IF_HEADER_ONLY CDT::Unrefined::Unrefined ( )

Constructor: all the counts start at zero.

Definition at line 58 of file Triangulation.hpp.

Member Data Documentation

◆ circumcenterOnVertex

std::size_t CDT::Unrefined::circumcenterOnVertex

triangles whose circumcenter coincides with an existing vertex

Definition at line 111 of file Triangulation.h.

◆ circumcenterOutside

std::size_t CDT::Unrefined::circumcenterOutside

triangles whose circumcenter is outside the triangulated area

Definition at line 109 of file Triangulation.h.

◆ sharpFixedCorner

std::size_t CDT::Unrefined::sharpFixedCorner

triangles whose smallest angle is enclosed by two fixed edges: such an angle comes from the input and can not be made any larger

Definition at line 114 of file Triangulation.h.

◆ shortEdges

std::size_t CDT::Unrefined::shortEdges

fixed edges that are shorter than the threshold

Definition at line 116 of file Triangulation.h.

◆ shortEdgeTriangles

std::size_t CDT::Unrefined::shortEdgeTriangles

triangles whose shortest edge is shorter than the threshold

Definition at line 107 of file Triangulation.h.

◆ splitVertexInvalid

std::size_t CDT::Unrefined::splitVertexInvalid

fixed edges whose split vertex can not be placed: inserting it would break the triangulation's topology

Note
in practice one of the edge's triangles is thinner than an ulp

Definition at line 120 of file Triangulation.h.


The documentation for this struct was generated from the following files: