Sciweavers

ISAAC
2000
Springer
100views Algorithms» more  ISAAC 2000»
13 years 8 months ago
An Improved Algorithm for Subdivision Traversal without Extra Storage
We describe an algorithm for enumerating all vertices, edges and faces of a planar subdivision stored in any of the usual pointer-based representations, while using only a constant...
Prosenjit Bose, Pat Morin