The upper envelope of Voronoi surfaces and its applications

Daniel P. Huttenlocher, Klara Kedem, Micha Sharir

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Given a set S of sources (points or segments), we consider the surface that is the graph of the function d(x) - minp∈s ρ(x,p), for some metric ρ. This surface is closely related to the Voronoi diagram, Vor(S), of S under the metric ρ. The upper envelope of a set of these Voronoi surfaces, each defined for a different set of sources, can be used to solve a number of problems, including finding the minimum Hausdorff distance between two sets of points or segments under translation, and determining the optimal placement of a site with respect to sets of utilities. We derive bounds on the number of vertices on the upper envelope of m Voronoi surfaces, provide efficient algorithms to calculate these vertices, and discuss applications to the aforementioned problems.

Original languageEnglish
Title of host publicationProceedings of the Annual Symposium on Computational Geometry
PublisherAssociation for Computing Machinery
Pages194-203
Number of pages10
ISBN (Print)0897914260
DOIs
StatePublished - 1 Jun 1991
Event7th Annual Symposium on Computational Geometry, SCG 1991 - North Conway, United States
Duration: 10 Jun 199112 Jun 1991

Publication series

NameProceedings of the Annual Symposium on Computational Geometry

Conference

Conference7th Annual Symposium on Computational Geometry, SCG 1991
Country/TerritoryUnited States
CityNorth Conway
Period10/06/9112/06/91

Fingerprint

Dive into the research topics of 'The upper envelope of Voronoi surfaces and its applications'. Together they form a unique fingerprint.

Cite this