On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
Authors:
Open Access
- 1 March 1986
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 1 (1) , 59-71
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Intersection and Closest-Pair Problems for a Set of Planar DiscsSIAM Journal on Computing, 1985
- Constructing the visibility graph for n-line segments in O(n2) timeInformation Processing Letters, 1985
- A “retraction” method for planning the motion of a discJournal of Algorithms, 1985
- On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriersCommunications on Pure and Applied Mathematics, 1983
- Optimal Search in Planar SubdivisionsSIAM Journal on Computing, 1983
- Plane-sweep algorithms for intersecting geometric figuresCommunications of the ACM, 1982
- An algorithm for planning collision-free paths among polyhedral obstaclesCommunications of the ACM, 1979
- Algorithms for Reporting and Counting Geometric IntersectionsIEEE Transactions on Computers, 1979
- Osculation vertices in arrangements of curvesGeometriae Dedicata, 1973
- Convexity and a certain propertyP mIsrael Journal of Mathematics, 1970