New answers tagged computational-geometry
0
Observe that you can construct another graph by connecting the centroids of faces with centroids of adjacent faces. This is known as the dual. The edges of the graph between the centroids can be represented as the twin relation between halfedges. Then you can use something like Depth First Search to visit all the faces:
function visit(f)
mark f as visited
...
Top 50 recent answers are included
