Obstacle growing in a nonpolygonal world
- 20 April 1987
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 25 (1) , 41-50
- https://doi.org/10.1016/0020-0190(87)90091-3
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Constructing the visibility graph for n-line segments in O(n2) timeInformation Processing Letters, 1985
- Spatial Planning: A Configuration Space ApproachIEEE Transactions on Computers, 1983
- Plane-sweep algorithms for intersecting geometric figuresCommunications of the ACM, 1982
- An Optimal Algorithm for Determining the Visibility of a Polygon from an EdgeIEEE Transactions on Computers, 1981
- An algorithm for planning collision-free paths among polyhedral obstaclesCommunications of the ACM, 1979