Computing Metric and Topological Properties of Configuration-Space Obstacles
Conference Paper, Proceedings of (ICRA) International Conference on Robotics and Automation, Vol. 1, pp. 170 - 176, May, 1989
Abstract
The author describes an algorithm that takes two polygons as input, and computes a representation of their corresponding configuration-space obstacle, including contact information. The algorithm's output includes a full metric and topological description of the obstacle surface, as well as the set of polygon features that are in contact for each point of the surface. The representation is exact, up to the limits of floating-point arithmetic. The algorithm has been implemented and test-run on over 40 input pairs; run times varied between 12 and 135 s.
BibTeX
@conference{Brost-1989-15714,author = {Randy C. Brost},
title = {Computing Metric and Topological Properties of Configuration-Space Obstacles},
booktitle = {Proceedings of (ICRA) International Conference on Robotics and Automation},
year = {1989},
month = {May},
volume = {1},
pages = {170 - 176},
address = {Scottsdale},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.