## Abstract

Given a set S of sources (points or segments) in ℜ211C;^{d}, we consider the surface in ℜ211C;^{d+1} that is the graph of the function d(x)=min_{pε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 the problem of finding the minimum Hausdorff distance between two sets of points or line segments under translation. We derive bounds on the number of vertices on the upper envelope of a collection of Voronoi surfaces, and provide efficient algorithms to calculate these vertices. We then discuss applications of the methods to the problems of finding the minimum Hausdorff distance under translation, between sets of points and segments.

Original language | English |
---|---|

Pages (from-to) | 267-291 |

Number of pages | 25 |

Journal | Discrete and Computational Geometry |

Volume | 9 |

Issue number | 1 |

DOIs | |

State | Published - 1 Dec 1993 |

Externally published | Yes |

## ASJC Scopus subject areas

- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics