|
|
This is what I do, the algho is very simple, short, and efficient enough for my needs.
First all half edges will have a NULL twin Process all half-edges, for each half-edge see if e->Next->Vertex->HalfEdge is the twin, if so - assign the twins, searh the fan for a half-edge that has a NULL twin and assign it as e->Next->Vertex->HalfEdge
Repeat processing all edges while there is at least one vertex.HalfEdge with a NULL twin. This usually requires a few passes to calculate everything. There are a few ways to make it more optimal
|