KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
From MaRDI portal
(Redirected from Publication:4818544)
Recommendations
Cites work
- A compact piecewise-linear Voronoi diagram for convex sites in the plane
- A “retraction” method for planning the motion of a disc
- APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
- An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
- Coordinated motion planning for two independent robots
- Efficiently Planning Compliant Motion in the Plane
- Ray shooting in polygons using geodesic triangulations
Cited in
(19)- Kinetic Collision Detection for Convex Fat Objects
- 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
- Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons
- A package for exact kinetic data structures and sweepline algorithms
- Kinetic collision detection for convex fat objects
- Minimum weight pseudo-triangulations
- scientific article; zbMATH DE number 1786516 (Why is no real title available?)
- A kinetic triangulation scheme for moving points in the plane
- Guaranteed collision detection with toleranced motions
- 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
- Moving regular k-gons in contact
- Flips in edge-labelled pseudo-triangulations
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)
