Kinetic collision detection for simple polygons
- 1 May 2000
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 322-330
- https://doi.org/10.1145/336154.336219
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Lower bounds for kinetic planar subdivisionsPublished by Association for Computing Machinery (ACM) ,1999
- An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the PlaneDiscrete & Computational Geometry, 1997
- A compact piecewise-linear voronoi diagram for convex sites in the planeDiscrete & Computational Geometry, 1996
- Ray shooting in polygons using geodesic triangulationsAlgorithmica, 1994
- APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHSInternational Journal of Computational Geometry & Applications, 1993
- Coordinated motion planning for two independent robotsAnnals of Mathematics and Artificial Intelligence, 1991
- PLANAR POINT LOCATION REVISITEDInternational Journal of Foundations of Computer Science, 1990
- Efficient algorithms for Euclidean shortest path and visibility problems with polygonal obstaclesPublished by Association for Computing Machinery (ACM) ,1988
- A “retraction” method for planning the motion of a discJournal of Algorithms, 1985
- An algorithm for planning collision-free paths among polyhedral obstaclesCommunications of the ACM, 1979