Data structures and network algorithms
Data structures and network algorithms
Visibility and intersection problems in plane geometry
Discrete & Computational Geometry
Finding the upper envelope of n line segments in O(n log n) time
Information Processing Letters
Introduction to algorithms
Discrete & Computational Geometry - Selected papers from the fifth annual ACM symposium on computational geometry, Saarbrücken, Germany, June 5-11, 1989
Partitioning arrangements of lines, part I: an efficient deterministic algorithm
Discrete & Computational Geometry - Selected papers from the fifth annual ACM symposium on computational geometry, Saarbrücken, Germany, June 5-11, 1989
Cutting hyperplane arrangements
Discrete & Computational Geometry
Cutting hyperplanes for divide-and-conquer
Discrete & Computational Geometry
A pedestrian approach to ray shooting: shoot a ray, take a walk
SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
Folding flat silhouettes and wrapping polyhedral packages: new results in computational origami
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Folding and one straight cut suffice
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Constructing Planar Cuttings in Theory and Practice
SIAM Journal on Computing
JCDCG '98 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Straight Skeletons for General Polygonal Figures in the Plane
COCOON '96 Proceedings of the Second Annual International Conference on Computing and Combinatorics
Quickest paths, straight skeletons, and the city Voronoi diagram
Proceedings of the eighteenth annual symposium on Computational geometry
Straight-skeleton based contour interpolation
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Polygon decomposition based on the straight line skeleton
Proceedings of the nineteenth annual symposium on Computational geometry
Contour interpolation by straight skeletons
Graphical Models
Straight Skeletons of Three-Dimensional Polyhedra
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Straight skeletons of three-dimensional polyhedra
Proceedings of the twenty-fifth annual symposium on Computational geometry
Polygon decomposition based on the straight line skeleton
Proceedings of the 11th international conference on Theoretical foundations of computer vision
Hinged dissection of polypolyhedra
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
We present a new algorithm to compute a motorcycle graph. It runs in O(n√n log n) time when n is the size of the input. We give a new characterization of the straight skeleton of a polygon possibly with holes. For a simple polygon, we show that it yields a randomized algorithm that reduces the straight skeleton computation to a motorcycle graph computation in O(n log2 n) time. Combining these results, we can compute the straight skeleton of a non-degenerate simple polygon with n vertices, among which r are reflex vertices, in O(n log2n + r√r log r) expected time. For a degenerate simple polygon, our expected time bound becomes O(n log2 n + r17/11+ε).