The one-dimensional weighted Voronoi diagram

DOI10.1016/0020-0190(86)90055-4zbMath0586.68036OpenAlexW2005915375MaRDI QIDQ1071508

Franz Aurenhammer

Publication date: 1986

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(86)90055-4

zbMATH Keywords

optimal algorithmcomputational geometrygeometric interpretation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Related Items (6)

Fast Voronoi modeling ⋮ An Efficient, Practical Algorithm and Implementation for Computing Multiplicatively Weighted Voronoi Diagrams ⋮ THE ONION DIAGRAM: A VORONOI-LIKE TESSELLATION OF A PLANAR LINE SPACE AND ITS APPLICATIONS ⋮ Weighted Voronoi Diagrams in the Maximum Norm ⋮ An optimal algorithm for constructing the weighted Voronoi diagram in the plane ⋮ Generalized Dirichlet tesselations

Cites Work

• Unnamed Item
• An optimal algorithm for constructing the weighted Voronoi diagram in the plane
• Stabbing line segments
• Two-Dimensional Voronoi Diagrams in the L _p -Metric
• Generalization of Voronoi Diagrams in the Plane
• Dynamization of order decomposable set problems
• Plane-sweep algorithms for intersecting geometric figures
• Power Diagrams: Properties, Algorithms and Applications

This page was built for publication: The one-dimensional weighted Voronoi diagram