Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
429236 | Information Processing Letters | 2006 | 6 Pages |
Abstract
The farthest line segment Voronoi diagram shows properties different from both the closest-segment Voronoi diagram and the farthest-point Voronoi diagram. Surprisingly, this structure did not receive attention in the computational geometry literature. We analyze its combinatorial and topological properties and outline an O(nlogn) time construction algorithm that is easy to implement. No restrictions are placed upon the n input line segments; they are allowed to touch or cross.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics