Planning a Purely Translational Motion for a Convex Object in Two-Dimensional Space Using Generalized Voronoi Diagrams.
Micha Sharir, D. Leven (1987)
Discrete & computational geometry
Similarity:
Displaying similar documents to “An Efficient Motion-Planning Algorithm for a Convex Polygonal Object in Two-Dimensional Polygonal Space.”
Planning a Purely Translational Motion for a Convex Object in Two-Dimensional Space Using Generalized Voronoi Diagrams.
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra.
S. Suri, C. Monma (1992)
Discrete & computational geometry
Similarity:
A Linear-Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon.
Leonidas J. Guibas, Peter W. Shor, A. Aggarwal, James Saxe (1989)
Discrete & computational geometry
Similarity:
Higher-Dimensional Voronoi Diagrams in Linear Expected Time.
R.A. Dwyer (1991)
Discrete & computational geometry
Similarity:
Computing a Centerpoint of a Finite Planar Set of Points in Linear Time.
A. Mukhopadhyay, S. Jadhav (1994)
Discrete & computational geometry
Similarity:
Motions of a Short-Linked Robot Arm in a Square.
V. Kantabutra (1992)
Discrete & computational geometry
Similarity:
An Efficient Algorithm for Guard Placement in Polygons with Holes.
I. Bjorling-Sachs, D.L. Souvaine (1995)
Discrete & computational geometry
Similarity:
A Fast Las Vegas Algorithm for Triangulating a Simple Polygon.
Robert E. Tarjan, K.L. Clarkson, Christopher J. van Wyk (1989)
Discrete & computational geometry
Similarity:
A Geometric Inequality and the Complexity of Computing Volume.
G. Elekes (1986)
Discrete & computational geometry
Similarity:
Computing the Volume is Difficult.
I. Bárány, Zoltán Füredi (1987)
Discrete & computational geometry
Similarity:
Triangulating Point Sets in Space.
D. Avis, Hossam ElGindy (1987)
Discrete & computational geometry
Similarity: