|
Blender V5.3
|
Public Member Functions | |
| CDTVert ()=default | |
| CDTVert (const VecBase< T, 2 > &pt) | |
| CDTVert (const double2 &pt) | |
Public Attributes | |
| FatCo< T > | co |
| SymEdge< T > * | symedge {nullptr} |
| VectorSet< uint32_t > | input_ids |
| int | index {-1} |
| int | merge_to_index {-1} |
| int | visit_index {0} |
| int2 | intersected_edges {-1, -1} |
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 192 of file delaunay_2d.cc.
|
default |
Referenced by blender::meshintersect::CDTArrangement< T >::add_vert().
|
explicit |
| blender::meshintersect::CDTVert< double >::CDTVert | ( | const double2 & | pt | ) |
Definition at line 871 of file delaunay_2d.cc.
References co, merge_to_index, symedge, and visit_index.
| FatCo<T> blender::meshintersect::CDTVert< T >::co |
Coordinate.
Definition at line 194 of file delaunay_2d.cc.
Referenced by blender::meshintersect::add_face_constraints(), 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().
| int blender::meshintersect::CDTVert< T >::index {-1} |
Index into array that CDTArrangement keeps.
Definition at line 203 of file delaunay_2d.cc.
| VectorSet<uint32_t> blender::meshintersect::CDTVert< T >::input_ids |
Set of corresponding vertex input ids. Not used if don't need CDT_ORIG_VERTS. Only need one if CDT_ONLY_ONE_ORIG.
Definition at line 201 of file delaunay_2d.cc.
| int2 blender::meshintersect::CDTVert< T >::intersected_edges {-1, -1} |
If this vert is an intersection, which original edges were intersected?
Definition at line 209 of file delaunay_2d.cc.
| 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 205 of file delaunay_2d.cc.
Referenced by CDTVert().
Some edge attached to it.
Definition at line 196 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().
| int blender::meshintersect::CDTVert< T >::visit_index {0} |
Used by algorithms operating on CDT structures.
Definition at line 207 of file delaunay_2d.cc.
Referenced by CDTVert().