The $L_\infty$ Hausdorff Voronoi Diagram Revisited

2011 ◽  
Author(s):  
Evanthia Papadopoulou ◽  
Jinhui Xu
Keyword(s):  
Voronoi Diagram ◽  
Hausdorff Voronoi Diagram

scholarly journals THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH

2004 ◽  
Vol 14 (06) ◽  
pp. 421-452 ◽  
Author(s):  
EVANTHIA PAPADOPOULOU ◽  
D. T. LEE
Keyword(s):  
Voronoi Diagram ◽  
Vlsi Design ◽  
Companion Paper ◽  
Direct Application ◽  
Divide And Conquer ◽  
Vlsi Layout ◽  
Manufacturing Defects ◽  
Combinatorial Properties ◽  
Divide And Conquer Algorithm ◽  
Hausdorff Voronoi Diagram

We study the Hausdorff Voronoi diagram of a set S of polygonal objects in the plane, a generalization of Voronoi diagrams based on the maximum distance of a point from a polygon, and show that it is equivalent to the Voronoi diagram of S under the Hausdorff distance function. We investigate the structural and combinatorial properties of the Hausdorff Voronoi diagram and give a divide and conquer algorithm for the construction of this diagram that improves upon previous results. As a byproduct we introduce the Hausdorff hull, a structure that relates to the Hausdorff Voronoi diagram in the same way as a convex hull relates to the ordinary Voronoi diagram. The Hausdorff Voronoi diagram finds direct application in the problem of computing the critical area of a VLSI Layout, a measure reflecting the sensitivity of a VLSI design to random manufacturing defects, described in a companion paper.13

The L∞ Hausdorff Voronoi Diagram Revisited

2015 ◽  
Vol 25 (02) ◽  
pp. 123-141 ◽  
Author(s):  
Evanthia Papadopoulou ◽  
Jinhui Xu
Keyword(s):  
Data Structure ◽  
Voronoi Diagram ◽  
Semiconductor Industry ◽  
Vlsi Design ◽  
Structural Complexity ◽  
Yield Prediction ◽  
Critical Area ◽  
Plane Sweep ◽  
Sweep Algorithm ◽  
Hausdorff Voronoi Diagram

We revisit the [Formula: see text] Hausdorff Voronoi diagram of clusters of points in the plane and present a simple two-pass plane sweep algorithm to construct it. This problem is motivated by applications in the semiconductor industry, in particular, critical area analysis and yield prediction in VLSI design. We show that the structural complexity of this diagram is [Formula: see text], where [Formula: see text] is the number of given clusters and [Formula: see text] is a number of specially crossing clusters, called essential. Our algorithm runs in [Formula: see text] time and [Formula: see text] space, where [Formula: see text] reflects a slight superset of essential crossings, [Formula: see text], and [Formula: see text] is the total number of crossing clusters. For non-crossing clusters ([Formula: see text]) or clusters with only a small number of crossings ([Formula: see text]) the algorithm is optimal. The latter is the case of interest in the motivating application, where [Formula: see text]. This is achieved by augmenting the wavefront data structure of the plane sweep, and a preprocessing step, based on point dominance, which is interesting in its own right.

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

Algorithmica ◽  
2016 ◽  
Vol 76 (4) ◽  
pp. 935-960 ◽  
Author(s):  
Panagiotis Cheilaris ◽  
Elena Khramtcova ◽  
Stefan Langerman ◽  
Evanthia Papadopoulou
Keyword(s):  
Voronoi Diagram ◽  
Incremental Algorithm ◽  
Hausdorff Voronoi Diagram

Model and algorithm for searching for victims in emergency situations and fires using the Voronoi diagram

2019 ◽  
Vol 86 ◽  
pp. 53-61
Author(s):  
N. G. Topolskiy ◽  
◽  
A. V. Mokshantsev ◽  
To Hoang Thanh ◽  
◽  
...  
Keyword(s):  
Voronoi Diagram ◽  
Emergency Situations
Sign in / Sign up

Export Citation Format

Share Document