On 2-site Voronoi diagrams under geometric distance functions

DOI10.1007/s11390-013-1328-2zbMath1280.68276arXiv1105.4130OpenAlexW2042999093MaRDI QIDQ2434572

Gill Barequet, David Eppstein, David Hodorkovsky, Kira Vyatkina, Matthew T. Dickerson

Publication date: 6 February 2014

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

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

zbMATH Keywords

distance functionlower envelopeDavenport-Schinzel theorycrossing-number lemma

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

On Clustering Induced Voronoi Diagrams

Cites Work

• Voronoi diagrams with respect to criteria on vision information
• On the Triangle-Perimeter Two-Site Voronoi Diagram
• Crossing-Free Subgraphs
• On a Problem of Heilbronn
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On 2-site Voronoi diagrams under geometric distance functions