Triangulating the Square and Squaring the Triangle: Quadtrees and Delaunay Triangulations are Equivalent

DOI10.1137/110825698zbMath1283.68166arXiv1205.4738OpenAlexW3099076662MaRDI QIDQ3143298

Wolfgang Mulzer, Maarten Löffler

Publication date: 29 November 2012

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1205.4738

zbMATH Keywords

quadtreeDelaunay triangulationwell-separated pair decomposition

Mathematics Subject Classification ID

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

Related Items (5)

Spanners for Directed Transmission Graphs ⋮ Dynamic connectivity in disk graphs ⋮ Spanning trees in multipartite geometric graphs ⋮ Preprocessing Ambiguous Imprecise Points ⋮ Dynamic smooth compressed quadtrees

This page was built for publication: Triangulating the Square and Squaring the Triangle: Quadtrees and Delaunay Triangulations are Equivalent