Divide-and-conquer for Voronoi diagrams revisited

DOI10.1145/1542362.1542401zbMath1388.68277OpenAlexW2214976657MaRDI QIDQ5370717

Franz Aurenhammer, Bert Jüttler, Margot Rabl, Oswin Aichholzer, Elisabeth Pilgerstorfer, Wolfgang Aigner, Thomas Hackl

Publication date: 20 October 2017

Published in: Proceedings of the twenty-fifth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1542362.1542401

zbMATH Keywords

Voronoi diagrammotion planningmedial axisdivide-and-conquerbiarc approximationtrimmed offset

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Randomized algorithms (68W20)

Related Items (3)

The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs ⋮ Divide-and-conquer for Voronoi diagrams revisited ⋮ Mitered Offsets and Skeletons for Circular Arc Polygons

This page was built for publication: Divide-and-conquer for Voronoi diagrams revisited