Sudarshan, S. ; Pandu Rangan, C. (1990) A fast algorithm for computing sparse visibility graphs Algorithmica, 5 (1-4). pp. 201-214. ISSN 0178-4617
Full text not available from this repository.
Official URL: http://doi.org/10.1007/BF01840385
Related URL: http://dx.doi.org/10.1007/BF01840385
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Springer Nature Switzerland AG |
| Keywords: | Computational geometry;Visibility graph;Shortest path |
| ID Code: | 128564 |
| Deposited On: | 28 Oct 2022 05:22 |
| Last Modified: | 28 Oct 2022 05:22 |
Repository Staff Only: item control page
