Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended

Elena Arseneva () and Evanthia Papadopoulou ()
Additional contact information
Elena Arseneva: St. Petersburg State University (SPbU)
Evanthia Papadopoulou: Università della Svizzera italiana (USI)

Journal of Combinatorial Optimization, 2019, vol. 37, issue 2, No 11, 579-600

Abstract: Abstract The Hausdorff Voronoi diagram of clusters of points in the plane is a generalization of Voronoi diagrams based on the Hausdorff distance function. Its combinatorial complexity is $$O(n+m)$$ O ( n + m ) , where n is the total number of points and $$m$$ m is the number of crossings between the input clusters ( $$m=O(n^2)$$ m = O ( n 2 ) ); the number of clusters is k. We present efficient algorithms to construct this diagram following the randomized incremental construction (RIC) framework (Clarkson and Shor in Discrete Comput Geom 4:387–421, 1989; Clarkson et al. in Comput Geom Theory Appl 3(4):185–212, 1993). Our algorithm for non-crossing clusters ( $$m=0$$ m = 0 ) runs in expected $$O(n\log {n} + k\log n \log k)$$ O ( n log n + k log n log k ) time and deterministic O(n) space. The algorithm for arbitrary clusters runs in expected $$O((m+n\log {k})\log {n})$$ O ( ( m + n log k ) log n ) time and $$O(m+n\log {k})$$ O ( m + n log k ) space. The two algorithms can be combined in a crossing-oblivious scheme within the same bounds. We show how to apply the RIC framework to handle non-standard characteristics of generalized Voronoi diagrams, including sites (and bisectors) of non-constant complexity, sites that are not enclosed in their Voronoi regions, empty Voronoi regions, and finally, disconnected bisectors and disconnected Voronoi regions. The Hausdorff Voronoi diagram finds direct applications in VLSI CAD.

Keywords: Computational geometry; Randomized incremental construction; Generalised Voronoi diagram; Hausdorff distance; Hausdorff Voronoi diagram; Voronoi diagram of point clusters (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-018-0347-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:37:y:2019:i:2:d:10.1007_s10878-018-0347-x

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-018-0347-x

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().