2
votes
Accepted
Given a DCEL, how do you identify the unbounded face
Take any extreme vertex (say among the vertices having the minimum x-coordinate, the one that minimizes y). This vertex is incident to two edges touching the outer face. Namely the first and the last ...
1
vote
Accepted
Sort half-edges around common vertex in 3d
It seems that the problem here is that you try to determine something similar to a rotation system from a skeleton1 embedded in $\mathbb{R}^3$. The problem here is that such a skeleton is not enough ...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
computational-geometry × 9doubly-connected-edge-list × 9
data-structures × 6
algorithms × 5
polygons × 1