Separation sensitive kinetic separation structures for convex polygons

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2098, Issue , 2001, Pages 222-236

  Kirkpatrick, David ^a   Speckmann, Bettina ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; KINETICS;

COLLISION DETECTION; COMPLEXITY BOUNDS; HIERARCHICAL REPRESENTATION; KINETIC DATA STRUCTURE; KINETIC SEPARATION; OUTER APPROXIMATION; POLYGONAL OBJECTS; SIMPLE POLYGON;

SEPARATION;

EID: 84974730849     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47738-1_21     Document Type: Conference Paper

References (19)

1. P. K. Agarwal, J. Basch, M. de Berg, L. J. Guibas, and J. Hershberger. Lower bounds for kinetic planar subdivisions. In Proc. 15th ACM Sympos. Comp. Geom., 247-254, 1999.
2. P. K. Agarwal, J. Basch, L. J. Guibas, J. Hershberger, and L. Zhang. Deformable free space tilings for kinetic collision detection. In Proc. 5th Workshop Algorithmic Found. Robotics, 2000.
3. J. Basch, J. Erickson, L. J. Guibas, J. Hershberger, and L. Zhang. Kinetic collision detection for two simple polygons. In Proc. 10th ACM-SIAM Sympos. Discrete Algorithms, 102-111, 1999.
4. J. Basch, L. Guibas, and J. Hershberger. Data structures for mobile data. In Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, 747-756, 1997.
5. B. Chazelle and D. P. Dobkin. Intersection of convex objects in two and three dimensions. J. ACM, 34(l):l-27, Jan. 1987.
6. T. H. Gormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.
7. D. Dobkin, J. Hershberger, D. Kirkpatrick, and S. Suri. Implicitly searching convolutions and computing depth of collision. In Proc. 1st Annu. SIGAL Internal, Sympos. Algorithms, volume 450 of Lecture Notes Comput. Sci., 165-180. Springer-Verlag, 1990.
8. D. P. Dobkin and D. G. Kirkpatrick. Fast detection of polyhedral intersection. Theoret. Comput. Sci., 27(3):241-253, Dec. 1983.
9. D. P. Dobkin and D. G. Kirkpatrick. A linear algorithm for determining the separation of convex polyhedra. J. Algorithms, 6:381-392, 1985.
10. D. P. Dobkin and D. G. Kirkpatrick. Determining the separation of preprocessed polyhedra—A unified approach. In M. S. Paterson, editor, Automata, Languages and Programming, 17th International Colloquium, volume 443 of Lecture Notes in Computer Science, 400-413, Warwick University, England, 16-20 July 1990. Springer- Verlag.
11. J. Erickson, L. Guibas, J. Stolfi, and L. Zhang. Separation-sensitive collision detection for convex objects. In Proc. 10th ACM-SIAM Sympos. Discrete Algorithms, 327-336, 1999.
12. L. Guibas, J. Snoeyink, and L. Zhang. Compact voronoi diagrams for moving convex polygons. In To appear Proc. 7th Scandinavian Workshop on Algorithm Theory, 2000.
13. L. J. Guibas. Kinetic data structures: A state of the art report. In Proc. 3rd Workshop Algorithmic Found. Robotics, 191-209, 1998.
14. D. Kirkpatrick, J. Snoeyink, and B. Speckmann. Kinetic collision detection for simple polygons. In Proc. 16th ACM Sympos. On Comp. Geom., 322-330, 2000.
15. D. Kirkpatrick and B. Speckmann. Separation sensitive kinetic collision detection for simple polygons. In preparation.
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. D. M. Mount. Intersection detection and separators for simple polygons. In Proc. 8th Annu, ACM Sympos. Comput. Geom., 303-311, 1992.
18. S. Suri. Minimum link paths in polygons and related problems. PhD thesis, Dept. Comp. Sci., Johns Hopkins Univ., 1987.
19. G. T. Toussaint. Shortest path solves translation separability of polygons. Technical Report SOCS-85.27, School Comput. Sci., McGill Univ., 1985.