By Topic

The $L_infty$ Hausdorff Voronoi Diagram Revisited

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Papadopoulou, E. ; Fac. of Inf., Univ. of Lugano, Lugano, Switzerland ; Jinhui Xu

We revisit the L Hausdorff Voronoi diagram of clusters of points, equivalently, the L Hausdorff Voronoi diagram of rectangles, and present a plane sweep algorithm for its construction that generalizes and improves upon previous results. We show that the structural complexity of the L Hausdorff Voronoi diagram is Θ (n+m), where n is the number of given clusters and m is the number of essential pairs of crossing clusters. The algorithm runs in O((n+M) log n) time and O(n + M) space where M is the number of potentially essential crossings; m,M are O(n2), m ≤ M, but m = M, in the worst case. In practice m,M <;<; n2, as the total number of crossings in the motivating application is typically small. For non-crossing clusters, the algorithm is optimal running in O(n log n)-time and O(n)-space. The L Hausdorff Voronoi diagram finds applications, among others, in the geometric min-cut problem, VLSI critical area analysis for via-blocks and open faults.

Published in:

Voronoi Diagrams in Science and Engineering (ISVD), 2011 Eighth International Symposium on

Date of Conference:

28-30 June 2011