A convex polygon among polygonal obstacles: placement and high-clearance motion
- 1 July 1993
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 3 (2) , 59-89
- https://doi.org/10.1016/0925-7721(93)90001-m
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal spaceDiscrete & Computational Geometry, 1990
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequencesJournal of Combinatorial Theory, Series A, 1989
- On the general motion-planning problem with two degrees of freedomDiscrete & Computational Geometry, 1989
- Constrained delaunay triangulationsAlgorithmica, 1989
- Placing the largest similar copy of a convex polygon among polygonal obstaclesPublished by Association for Computing Machinery (ACM) ,1989
- A sweepline algorithm for Voronoi diagramsAlgorithmica, 1987
- Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemesCombinatorica, 1986
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstaclesDiscrete & Computational Geometry, 1986
- Some dynamic computational geometry problemsComputers & Mathematics with Applications, 1985
- Voronoi diagrams based on convex distance functionsPublished by Association for Computing Machinery (ACM) ,1985