Computational geometry: an introduction
Computational geometry: an introduction
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Randomized incremental construction of abstract Voronoi diagrams
Computational Geometry: Theory and Applications
A DRC-based algorithm for extraction of critical areas for opens in large VLSI circuits
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Critical area computation via Voronoi diagrams
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Critical area computation for missing material defects in VLSI circuits
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Fuzzy Voronoi diagram for disjoint fuzzy numbers of dimension two
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
| Hi-index | 0.00 |
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.