Name
Abstract | ||
|---|---|---|
We study the min-max Voronoi diagram of a set S of polygonal objects, a generalization of Voronoi diagrams based on the maximum distance between a point and a polygon. We show that the min-max Voronoi diagram is equivalent to the Voronoi diagram under the Hausdorff distance function. We investigate the combinatorial properties of this diagram and give improved combinatorial bounds and algorithms. As a byproduct we introduce the min-max hull which relates to the min-max Voronoi diagram in the way a convex hull relates to the ordinary Voronoi diagram. |
Year | Venue | Keywords |
|---|---|---|
2002 | ISAAC | convex hull,min-max voronoi diagram,polygonal object,hausdorff distance function,ordinary voronoi diagram,maximum distance,combinatorial property,vlsi manufacturing,min-max hull,voronoi diagram,combinatorial bound,distance function |
Field | DocType | Volume |
Discrete mathematics,Power diagram,Combinatorics,Centroidal Voronoi tessellation,Bowyer–Watson algorithm,Mathematical diagram,Lloyd's algorithm,Fortune's algorithm,Weighted Voronoi diagram,Voronoi diagram,Mathematics | Conference | 2518 |
ISSN | ISBN | Citations |
0302-9743 | 3-540-00142-5 | 3 |
PageRank | References | Authors |
0.44 | 8 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Evanthia Papadopoulou | 1 | 110 | 18.37 |
| D. T. Lee | 2 | 118 | 67.99 |