Voronoi diagrams in the moscow metric

DOI10.1007/3-540-50728-0_61MaRDI QIDQ6199481FDO

Authors Rolf Klein

Publication date 28 February 2024

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4110186
• scientific article; zbMATH DE number 4060214
• Higher order city Voronoi diagrams
• “The big sweep”: On the power of the wavefront approach to Voronoi diagrams
• CONSTRUCTING THE CITY VORONOI DIAGRAM FASTER

Cites work

• scientific article; zbMATH DE number 4060214 (Why is no real title available?)
• A sweepline algorithm for Voronoi diagrams
• An O ( n log n ) Algorithm for Rectilinear Minimal Spanning Trees
• Euclidean shortest paths in the presence of rectilinear barriers
• Two-Dimensional Voronoi Diagrams in the L _p -Metric
• Voronoi diagrams from convex hulls
• Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with 2-Dimensional Storage Applications

This page was built for publication: Voronoi diagrams in the moscow metric

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6199481)