Constructing the visibility graph for n-line segments in O(n2) time
- 1 May 1985
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 20 (4), 167-171
- https://doi.org/10.1016/0020-0190(85)90044-4
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Euclidean shortest paths in the presence of rectilinear barriersNetworks, 1984
- An algorithm for planning collision-free paths among polyhedral obstaclesCommunications of the ACM, 1979
- A note on two problems in connexion with graphsNumerische Mathematik, 1959