blender::meshintersect::CDTVert< T > Struct Template Reference

Public Member Functions
	CDTVert ()=default
	CDTVert (const VecBase< T, 2 > &pt)
	CDTVert (const double2 &pt)

Public Attributes
FatCo< T >	co
SymEdge< T > *	symedge {nullptr}
blender::Set< int >	input_ids
int	index {-1}
int	merge_to_index {-1}
int	visit_index {0}

Detailed Description

template<typename T>
struct blender::meshintersect::CDTVert< T >

Define a templated 2D arrangement of vertices, edges, and faces. The SymEdge data structure is the basis for a structure that allows easy traversal to neighboring (by topology) geometric elements. Each of CDTVert, CDTEdge, and CDTFace have an input_id set, which contain integers that keep track of which input verts, edges, and faces, respectively, that the element was derived from.

While this could be cleaned up some, it is usable by other routines in Blender that need to keep track of a 2D arrangement, with topology.

Definition at line 179 of file delaunay_2d.cc.

Constructor & Destructor Documentation

CDTVert() [1/3]

template<typename T>

blender::meshintersect::CDTVert< T >::CDTVert ( )

default

CDTVert() [2/3]

template<typename T>

blender::meshintersect::CDTVert< T >::CDTVert ( const VecBase< T, 2 > & pt )

explicit

CDTVert() [3/3]

blender::meshintersect::CDTVert< double >::CDTVert

(

const double2 &

pt

)

Definition at line 783 of file delaunay_2d.cc.

References co, merge_to_index, symedge, and visit_index.

Member Data Documentation

co

template<typename T>

FatCo<T> blender::meshintersect::CDTVert< T >::co

Coordinate.

Definition at line 181 of file delaunay_2d.cc.

Referenced by blender::meshintersect::cdt_draw(), CDTVert(), blender::meshintersect::dc_tri(), blender::meshintersect::fill_crossdata_for_intersect(), blender::meshintersect::get_next_crossing_from_edge(), blender::meshintersect::get_next_crossing_from_vert(), and blender::meshintersect::re_delaunay_triangulate().

index

template<typename T>

int blender::meshintersect::CDTVert< T >::index {-1}

Index into array that CDTArrangement keeps.

Definition at line 187 of file delaunay_2d.cc.

input_ids

template<typename T>

blender::Set<int> blender::meshintersect::CDTVert< T >::input_ids

Set of corresponding vertex input ids. Not used if don't need_ids.

Definition at line 185 of file delaunay_2d.cc.

merge_to_index

template<typename T>

int blender::meshintersect::CDTVert< T >::merge_to_index {-1}

Index of a CDTVert that this has merged to. -1 if no merge.

Definition at line 189 of file delaunay_2d.cc.

Referenced by CDTVert().

symedge

template<typename T>

SymEdge<T>* blender::meshintersect::CDTVert< T >::symedge {nullptr}

Some edge attached to it.

Definition at line 183 of file delaunay_2d.cc.

Referenced by blender::meshintersect::CDTArrangement< T >::add_edge(), CDTVert(), blender::meshintersect::CDTArrangement< T >::delete_edge(), and blender::meshintersect::find_symedge_between_verts().

visit_index

template<typename T>

int blender::meshintersect::CDTVert< T >::visit_index {0}

Used by algorithms operating on CDT structures.

Definition at line 191 of file delaunay_2d.cc.

Referenced by blender::meshintersect::add_edge_constraint(), and CDTVert().

---

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

• delaunay_2d.cc