THE ONION DIAGRAM: A VORONOI-LIKE TESSELLATION OF A PLANAR LINE SPACE AND ITS APPLICATIONS

DOI10.1142/S0218195912600011zbMath1251.68280MaRDI QIDQ4650088

Sang Won Bae, Chan-Su Shin

Publication date: 23 November 2012

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

zbMATH Keywords

Voronoi diagramparametric searchgeometric facility locationobnoxious line locationwidest corridor problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Discrete location and assignment (90B80) Data structures (68P05)

Cites Work

• Unnamed Item
• Finding the upper envelope of n line segments in O(n log n) time
• Parametric search made practical
• An optimal algorithm for constructing the weighted Voronoi diagram in the plane
• The maximin line problem with regional demand
• A geometric consistency theorem for a symbolic perturbation scheme
• Topological sweep of the complete graph
• The power of geometric duality revisited
• The one-dimensional weighted Voronoi diagram
• Topologically sweeping an arrangement
• Concrete and abstract Voronoi diagrams
• Voronoi diagrams of rigidly moving sets of points
• An efficient \(k\) nearest neighbors searching algorithm for a query line.
• Location of an Obnoxious Route
• Parallel Merge Sort
• FURTHEST SITE ABSTRACT VORONOI DIAGRAMS
• Finding the convex hull of a simple polygon

This page was built for publication: THE ONION DIAGRAM: A VORONOI-LIKE TESSELLATION OF A PLANAR LINE SPACE AND ITS APPLICATIONS