AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE

DOI10.1142/S0218195902000906zbMath1152.68657MaRDI QIDQ4818563

Prosenjit Bose, Pat Morin

Publication date: 29 September 2004

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

computational geometryvertex enumerationplanar subdivisionsgeographic information systems

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (4)

Local Routing in Convex Subdivisions ⋮ A new algorithmic framework for basic problems on binary images ⋮ In-place algorithm for erasing a connected component in a binary image ⋮ Constant memory routing in quasi-planar and quasi-polyhedral graphs

Cites Work

• Finding the intersection of two convex polyhedra
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• Optimal Point Location in a Monotone Subdivision
• Decentralized extrema-finding in circular configurations of processors

This page was built for publication: AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE