A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters release_m7okeyqfnzcj5c4wxtpuvjremy

by Panagiotis Cheilaris, Elena Khramtcova, Stefan Langerman, Evanthia Papadopoulou

Released as a article .

2016  

Abstract

In the Hausdorff Voronoi diagram of a family of clusters of points in the plane, the distance between a point t and a cluster P is measured as the maximum distance between t and any point in P, and the diagram is defined in a nearest-neighbor sense for the input clusters. In this paper we consider which the combinatorial complexity of the Hausdorff Voronoi diagram is linear in the total number of points, n, on the convex hulls of all clusters. We present a randomized incremental construction, based on point location, that computes this diagram in expected O(n^2n) time and expected O(n) space. Our techniques efficiently handle non-standard characteristics of generalized Voronoi diagrams, such as sites of non-constant complexity, sites that are not enclosed in their Voronoi regions, and empty Voronoi regions. The diagram finds direct applications in VLSI computer-aided design.
In text/plain format

Archived Files and Locations

application/pdf  512.4 kB
file_6vudigchq5ho3kxbrgsulxiewi
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2016-03-05
Version   v3
Language   en ?
arXiv  1312.3904v3
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 1c318c93-a2b0-4586-8fc5-b2967fd370cf
API URL: JSON