Simple Traversal of a Subdivision Without Extra Storage

In this paper we show how to traverse a subdivision and to report all cells, edges and vertices, without making use of mark bits in the structure or a stack. We do this by performing a depth- rst search on the subdivision, using local criteria for deciding what is the next cell to visit. Our method is extremely simple and provably correct. The algorithm has applications in the eld of Geographic Information Systems GIS, where traversing subdivisions is a common operation, but modifying the database is unwanted or impossible. We show how to adapt our algorithm to answer related queries, such as windowing queries and reporting connected subsets of cells that have a common attribute. Finally, we show how to extend our algorithm such that it can handle convex 3-dimensional subdivisions.

• Type: Conference
• Year: 1996
• Where: COMPGEOM
• Authors: Mark de Berg, René van Oostrum, Mark H. Overmars
• Keywords: Algorithm, COMPGEOM 1996, Convex 3-dimensional Subdivisions, Discrete Geometry, Geographic Information Systems