Loading...
Please wait, while we are loading the content...
Similar Documents
Farthest Line Segment Voronoi Diagrams (2006)
Content Provider | CiteSeerX |
---|---|
Author | Aurenhammer, F. Drysdale, R. L. S. Krasser, H. |
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(n log n) 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. |
File Format | |
Publisher Date | 2006-01-01 |
Access Restriction | Open |
Subject Keyword | Line Segment Voronoi Diagram Farthest-point Voronoi Diagram Time Construction Algorithm Input Line Segment Computational Geometry Literature Closest-segment Voronoi Diagram Topological Property |
Content Type | Text |