ACM Home Page
Please provide us with feedback. Feedback
Kinetic collision detection for simple polygons
Full text PdfPdf (917 KB)
Source Annual Symposium on Computational Geometry archive
Proceedings of the sixteenth annual symposium on Computational geometry table of contents
Clear Water Bay, Kowloon, Hong Kong
Pages: 322 - 330  
Year of Publication: 2000
ISBN:1-58113-224-7
Authors
David Kirkpatrick  Department of Computer Science, University of British Columbia
Jack Snoeyink  Department of Computer Science, UNC Chapel Hill
Bettina Speckmann  Department of Computer Science, University of British Columbia
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 39,   Citation Count: 12
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/336154.336219
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
P. K. Agarwal, J. Basch, L. J. Guibas, J. Hershberger, and L. Zhang. Deformable free space tilings for kinetic collision detection, in To appear Proc. 5th Workshop Algorithmic Found. Robotics, 2000.
 
3
 
4
5
6
 
7
B. Chazelle, H. Edelsbrunner, M. Grigni, L. J. Guibas, J. Hershberger, M. Sharir, and J. Snoeyink. Ray shooting in polygons using geodesic triangulations. Algorithmica, 12:54-68, 1994.
 
8
 
9
 
10
L. Guibas, J. Snoeyink, and L. Zhang. Compact voronoi diagrams for moving convex polygons.
 
11
 
12
L. J. Guibas, J. E. Hershberger, J. S. B. Mitchell, and J. S. Snoeyink. Approximating polygons and subdivisions with minimum link paths. Internat. J. Comput. Geom. Appl., 3(4):383-415, Dec. 1993.
13
 
14
S. Kapoor, S. N. Maheshwari, and J. S. B. Mitchell. An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane. Discrete Comput. Geom., 18:377-383, 1997.
15
 
16
M. McAllister, D. Kirkpatrick, and J. Snoeyink. A compact piecewise-linear voronoi diagram for convex sites in the plane. Discrete Comp. Geom., 15:73-105, 1996.
 
17
K. Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice Hall, Englewood Cliffs, NJ, 1994.
 
18
C. O'Dfinlaing and C. K. Yap. A "retraction" method for planning the motion of a disk. J. Algorithms, 6:104-111, 1985.
 
19
F. P. Preparata. Planar point location revisited. Internat. J. Found. Comput. Sci. , 1 (1):71-86, 1990.
 
20
T. Roos. Dynamic Voronoi diagrams. Ph.D. thesis, Bayerische Julius-Maximilians-Univ., Wfirzburg, Germany, Sept. 1991.
 
21
M. Sharir and S. Sifrony. Coordinated motion planning for two independent robots. Ann. Math. Artif. Intell., 3:107-130, 1991.
 
22

CITED BY  12

Collaborative Colleagues:
David Kirkpatrick: colleagues
Jack Snoeyink: colleagues
Bettina Speckmann: colleagues