An Improved Algorithm for Subdivision Traversal without Extra Storage

Authors:
Prosenjit Bose;Pat Morin
Affiliations:
-;-
Venue:
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Year:
2000

Citing 6
Cited 0

Computational geometry: an introduction

Computational geometry: an introduction
Optimal point location in a monotone subdivision

SIAM Journal on Computing
Primitives for the manipulation of general subdivisions and the computation of Voronoi

ACM Transactions on Graphics (TOG)
LEDA: a platform for combinatorial and geometric computing

LEDA: a platform for combinatorial and geometric computing
Decentralized extrema-finding in circular configurations of processors

Communications of the ACM
Automated contour mapping using triangular element data structures and an interpolant over each irregular triangular domain

SIGGRAPH '77 Proceedings of the 4th annual conference on Computer graphics and interactive techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 amount of memory beyond that required to store the subdivision. The algorithm is a refinement of a method introduced by de Berg et al (1997), that reduces the worst case running time from O(n2) to O(n log n). We also give experimental results that show that our modified algorithm runs faster not only in the worst case, but also in many realistic cases.