Stefan Schirra
ABSTRACT
No abstract available.
- 1.H. Edelsbrunner, L. Guibas, and J. Stolfi. Optimal point location in a monotone subdivision. SIAM Journal on Computing, 15'317-340, 1986. Google Scholar
Digital Library
- 2.D. Hare1 and R.E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing, 13(2):338-355, 1984. Google ScholarDigital Library
- 3.S. N'fi~her and K. Mehlhorn. LEDA- A Library of Efficient Data Types and Algorithms. In Int. Coll. on Automata, Languages and Programming, ICALP 90, LNCS 443, pages 1-5, 1990. Google ScholarDigital Library
- 4.C. O'Ddnlaing and C. Yap. A "retraction" method for planning the motion of a disk. Jourhal of Algorithms, 6:104-111, 1985.Google ScholarCross Ref
- 5.H. Rolmert. Moving a disc between polygons. Algorithmica, 6:182-191, 1991.Google ScholarDigital Library
- 6.C. Yap. An O(nlog n) algorithm for the Voronoi diagram of a set of simple curve segments. Discrete and Computational Geometry, 2:365-393, 1987.Google ScholarDigital Library
Index Terms
- Moving a disc between polygons
Recommendations
Moving a disc between polygons
AbstractAn algorithm is given for finding a collision-free path for a disc between a collection of polygons havingn corners in total. The polygons are fixed and can be preprocessed. A query specifies the radiusr of the disc to be moved and the start and ...
Minimum-perimeter intersecting polygons
LATIN'10: Proceedings of the 9th Latin American conference on Theoretical InformaticsGiven a set ${\mathcal S}$ of segments in the plane, a polygon P is an intersecting polygon of ${\mathcal S}$ if every segment in ${\mathcal S}$ intersects the interior or the boundary of P. The problem MPIP of computing a minimum-perimeter intersecting ...
Comments