Computational geometry: an introduction
Computational geometry: an introduction
A sweepline algorithm for Voronoi diagrams
SCG '86 Proceedings of the second annual symposium on Computational geometry
Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
On the zone theorem for hyperplane arrangements
SIAM Journal on Computing
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Computational Geometry: Theory and Applications
Farthest line segment Voronoi diagrams
Information Processing Letters
An O(nlogn) algorithm for the all-farthest-segments problem for a planar set of points
Information Processing Letters
Two-site Voronoi diagrams in geographic networks
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Proceedings of the twenty-fifth annual symposium on Computational geometry
Constructing two-dimensional Voronoi diagrams via divide-and-conquer of envelopes in space
Transactions on computational science IX
On the triangle-perimeter two-site Voronoi diagram
Transactions on computational science IX
Properties and an approximation algorithm of round-tour Voronoi diagrams
Transactions on computational science IX
Constructing two-dimensional Voronoi diagrams via divide-and-conquer of envelopes in space
Transactions on computational science IX
On the triangle-perimeter two-site Voronoi diagram
Transactions on computational science IX
Properties and an approximation algorithm of round-tour Voronoi diagrams
Transactions on computational science IX
On multiplicatively weighted Voronoi diagrams for lines in the plane
Transactions on computational science XIII
Round-trip voronoi diagrams and doubling density in geographic networks
Transactions on Computational Science XIV
All-maximum and all-minimum problems under some measures
Journal of Discrete Algorithms
| Hi-index | 0.04 |
In this paper, we define a new type of a planar distance function from a point to a pair of points. We focus on a few such distance functions, analyze the structure and complexity of the corresponding nearest- and furthest-neighbor Voronoi diagrams (in which every region is defined by a pair of point sites), and show how to compute the diagrams efficiently.