KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
From MaRDI portal
Publication:4818544
DOI10.1142/S0218195902000724zbMATH Open1152.68671MaRDI QIDQ4818544FDOQ4818544
Bettina Speckmann, Jack Snoeyink, David Kirkpatrick
Publication date: 29 September 2004
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Cites Work
- An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
- APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
- Ray shooting in polygons using geodesic triangulations
- A “retraction” method for planning the motion of a disc
- A compact piecewise-linear Voronoi diagram for convex sites in the plane
- Efficiently Planning Compliant Motion in the Plane
- Coordinated motion planning for two independent robots
Cited In (15)
- Kinetic collision detection with fast flight plan changes
- Kinetic facility location
- Kinetic and dynamic data structures for convex hulls and upper envelopes
- Kinetic collision detection for balls
- A package for exact kinetic data structures and sweepline algorithms
- Kinetic collision detection for convex fat objects
- Minimum weight pseudo-triangulations
- Title not available (Why is that?)
- A kinetic triangulation scheme for moving points in the plane
- On the number of pseudo-triangulations of certain point sets
- The stochastic walk algorithms for point location in pseudo-triangulations
- Convexity minimizes pseudo-triangulations
- Kinetic collision detection between two simple polygons.
- Decomposing a simple polygon into pseudo-triangles and convex polygons
- Flips in edge-labelled pseudo-triangulations
Recommendations
This page was built for publication: KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4818544)
