Efficient algorithms for Euclidean shortest path and visibility problems with polygonal obstacles
- 1 January 1988
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 172-182
- https://doi.org/10.1145/73393.73411
Abstract
No abstract availableThis publication has 0 references indexed in Scilit: