Moving a disc between polygons
- 1 June 1991
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 6 (1-6) , 182-191
- https://doi.org/10.1007/bf01759040
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A tight lower bound for the complexity of path-planning for a discInformation Processing Letters, 1988
- AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segmentsDiscrete & Computational Geometry, 1987
- Optimal Point Location in a Monotone SubdivisionSIAM Journal on Computing, 1986
- A sweepline algorithm for Voronoi diagramsPublished by Association for Computing Machinery (ACM) ,1986
- A “retraction” method for planning the motion of a discJournal of Algorithms, 1985
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- Generalization of Voronoi Diagrams in the PlaneSIAM Journal on Computing, 1981
- Efficient computation of continuous skeletonsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- Location of a Point in a Planar Subdivision and Its ApplicationsSIAM Journal on Computing, 1977