Pages that link to "Item:Q1312900"
From MaRDI portal
The following pages link to An optimal algorithm for solving collision distance between convex polygons in plane (Q1312900):
Displaying 7 items.
- A new fast algorithm for computing the distance between two disjoint convex polygons based on Voronoi diagram (Q863827) (← links)
- Fast algorithms for collision and proximity problems involving moving geometric objects (Q1126250) (← links)
- Collision detection algorithm of a continuous type using spherical extreme vertex diagrams (Q1767855) (← links)
- Some properties of touching distances for polygons and polyhedra (Q1808598) (← links)
- A hierarchical method for real-time distance computation among moving convex bodies (Q1974624) (← links)
- The distance between convex sets with Minkowski sum structure: application to collision detection (Q2023661) (← links)
- Convex Minimization on a Grid and Applications (Q4386447) (← links)