The straight skeleton of a polygon is a variant of the medial axis, introduced by Aichholzer et al., defined by a shrinking process in which each edge of the polygon moves inward at a fixed rate. We construct the straight skeleton of an n-gon with r reflex vertices in time O(n 1+" +n 8=11+" r 9=11+" ), for any fixed " ? 0, improving the previous best upper bound of O(nr log n). Our algorithm simulates the sequence of collisions between edges and vertices during the shrinking process, using a technique of Eppstein for maintaining extrema of binary functions to reduce the problem of finding successive interactions to two dynamic range query problems: (1) maintain a changing set of triangles in IR 3 and answer queries asking which triangle would be first hit by a query ray, and (2) maintain a changing set of rays in IR 3 and answer queries asking for the lowest intersection of any ray with a query triangle. We also exploit a novel characterization of the straight skeleton as a ...
|
315
|
A transfomation for extracting new descriptors of shape
– Blum
- 1967
|
|
220
|
Icollide: An interactive and exact collision detection system for large-scale environments
– Cohen, Lin, et al.
|
|
218
|
Applying parallel computation algorithms in the design of serial algorithms
– Megiddo
- 1983
|
|
190
|
Data structures for mobile data
– BASCH, GUIBAS, et al.
- 1999
|
|
184
|
Geometric range searching and its relatives
– AGARWAL, ERICKSON
- 1999
|
|
145
|
Collision detection for interactive graphics applications
– Hubbard
- 1995
|
|
118
|
Ray shooting and parametric search
– Agarwal, Matousek
- 1993
|
|
111
|
Impulse-Based Simulation of Rigid Bodies
– Mirtich, Canny
- 1995
|
|
83
|
Decomposable searching problems I: static-to-dynamic transformation
– Bentley, Saxe
- 1980
|
|
80
|
A retraction method for planning the motion of a disc
– O'Dunlaing, Yap
- 1982
|
|
74
|
Medial axis transformation of a planar shape
– Lee
- 1982
|
|
71
|
Kinetic data structures — a state of the art report
– GUIBAS
- 1998
|
|
65
|
A linear-time algorithm for computing the Voronoĭ diagram of a convex polygon
– Aggarwal, Guibas, et al.
- 1989
|
|
63
|
Reporting points in halfspaces
– Matousek
- 1992
|
|
50
|
Finding the medial axis of a simple polygon in linear time
– Chin, Snoeyink, et al.
- 1999
|
|
50
|
Concrete and Abstract Voronoi Diagrams
– Klein
|
|
44
|
A novel type of skeleton for polygons
– Aichholzer, Aurenhammer, et al.
- 1995
|
|
44
|
Geometry helps in matching
– Vaidya
- 1989
|
|
43
|
Proximity problems on moving points
– BASCH, GUIBAS, et al.
- 1997
|
|
43
|
Fast hierarchical clustering and other applications of dynamic closest pairs
– Eppstein
|
|
38
|
Geometric applications of a randomized optimization technique
– Chan
- 1999
|
|
36
|
Range searching with semialgebraic sets, Discrete Comput
– Agarwal, Matouˇsek
- 1994
|
|
32
|
Dynamic Euclidean minimum spanning trees and extrema of binary functions
– Eppstein
- 1992
|
|
31
|
Building Voronoi diagrams for convex polygons in linear expected time
– Chew
- 1986
|
|
27
|
Overmars M. H.: Batched Dynamic Solutions to Decomposable Searching Problems
– Edelsbrunner
- 1985
|
|
23
|
Fixed-dimensional linear programming queries made easy
– Chan
- 1996
|
|
23
|
Fast collision detection among multiple moving spheres
– Kim, Guibas, et al.
|
|
22
|
A compact piecewise-linear Voronoi diagram for convex sites in the plane
– McAllister, Kirkpatrick, et al.
- 1996
|
|
19
|
Folding and cutting paper
– Demaine, Demaine, et al.
- 1998
|
|
16
|
Offline algorithms for dynamic minimum spanning tree problems
– Eppstein
|
|
14
|
The use of awareness in collision prediction
– Foisy, Hayward, et al.
- 1990
|
|
14
|
Automatic mesh generation using the symmetric axis transformation of polygonal domains
– Srinivasan, Nackman, et al.
- 1992
|
|
14
|
Oriented Projective Geometry: A Framework for Geometric Computations
– Stol
- 1991
|
|
13
|
Dynamic halfspace range reporting and its applications. Algorithmica 13
– AGARWAL, MATOUˇSEK
- 1995
|
|
13
|
Randomization yields simple O(n log n) algorithms for difcult (n) problems
– Devillers
- 1992
|
|
13
|
Medial axis transform to boundary representation conversion
– Vermeer
- 1994
|
|
12
|
Applications of a new space-partitioning technique. Discrete and Computational Geometry
– Agarwal, Sharir
- 1993
|
|
11
|
A disk-packing algorithm for an origami magic trick
– Bern, Demaine, et al.
- 2001
|
|
11
|
Maintenance of geometric extrema
– Dobkin, Suri
- 1991
|
|
10
|
Shortest paths in the plane with polygonal obstacles
– Storer, Reif
- 1994
|
|
9
|
Pocket Machining Based on Contour-Parallel Tool Paths Generated by Means of Proximity Maps
– Held, Luk'acs, et al.
- 1994
|
|
9
|
Range searching with ecient hierarchical cuttings
– Matousek
- 1993
|
|
9
|
Ray shooting amidst spheres in three dimensions and related problems
– Mohaban, Sharir
- 1997
|
|
6
|
Ecient ray shooting and hidden surface removal. Algorithmica
– Berg, Halperin, et al.
- 1994
|
|
6
|
Galleries, light matchings and visibility graphs
– Czyzowicz, Rival, et al.
- 1989
|
|
5
|
P-complete geometric problems
– Atallah, Callahan, et al.
- 1993
|
|
5
|
Life Without Death is P-complete
– Griffeath, Moore
- 1996
|
|
4
|
Straight skeletons for general polygonal in the plane
– Aichholzer, Aurenhammer
- 1996
|
|
4
|
A singly-exponential strati scheme for real semi-algebraic varieties and its applications
– Chazelle, Edelsbrunner, et al.
- 1989
|
|
3
|
Interactive Simulation of Solid Rigid Bodies
– Bara
- 1995
|
|
