I was trying to understand how an iterator through vertices of a DCEL. I haven't found any specific algorithm for that (I've also tried to have a look to the CGAL library documentation, where an iterator is provided, but I can't find any documentation of the implemented algorithm).The most trivial way I've figured out so far, is to use some graph visit of the planar graph associated to the DCEL and then from that navigating the tree (BFS or DFS) is a way to explore the whole graph.However I was thinking that since for each vertex of the data structure there are coordinates associated maybe there's some other way based on the lexicographic order of the points (which is actually important in order to use sweep line approaches).But anyway... the question is: What are common ways to iterate through Vertices/Half Edges/Faces of a doubly connected edge list?
Iterators for a Doubly connected edge list data members
data structures;computational geometry