Table of contents

  1. Front Matter
  2. Pages 3-7
  3. Pages 131-157
  4. Pages 159-161
  5. Back Matter

About this book

Introduction

The Voronoi diagram of a set of sites is a partition of the plane into regions, one to each site, such that the region of each site contains all points of the plane that are closer to this site than to the other ones. Such partitions are of great importance to computer science and many other fields. The challenge is to compute Voronoi diagrams quickly. The problem is that their structure depends on the notion of distance and the sort of site. In this book the author proposes a unifying approach by introducing abstract Voronoi diagrams. These are based on the concept of bisecting curves, which are required to have some simple properties that are actually possessed by most bisectors of concrete Voronoi diagrams. Abstract Voronoi diagrams can be computed efficiently and there exists a worst-case efficient algorithm of divide-and-conquer type that applies to all abstract Voronoi diagrams satisfying a certain constraint. The author shows that this constraint is fulfilled by the concrete diagrams based on large classes of metrics in the plane.

Keywords

Abstandsgeometrie Algorithmen Algorithms Computer-Geometrie Datenstruktur Diagramm algorithm computer computer science

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-52055-4
  • Copyright Information Springer-Verlag 1989
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-52055-9
  • Online ISBN 978-3-540-46874-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book