Ghosh, Subir Kumar ; Maheshwari, Anil ; Pal, Sudebkumar Prasant ; Saluja, Sanjeev ; Veni Madhavan, C. E. (1991) Computing the shortest path tree in a weak visibility polygon Lecture Notes in Computer Science, 560 . pp. 369-389. ISSN 0302-9743
Full text not available from this repository.
Official URL: http://www.springerlink.com/content/f46636pk3v3115...
Related URL: http://dx.doi.org/10.1007/3-540-54967-6_82
Abstract
In this paper we propose two linear time algorithms for computing the shortest path tree rooted at any vertex of a weak visibility polygon. The first algorithm computes the shortest path tree in a polygon weakly visible from a given internal segment. The second algorithm computes the shortest path tree in a weak visibility polygon without the knowledge of a visibility segment. In both algorithms we use the convexity property of shortest paths in weak visibility polygons established in [4,11].
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Springer. |
| ID Code: | 76291 |
| Deposited On: | 31 Dec 2011 08:55 |
| Last Modified: | 31 Dec 2011 08:55 |
Repository Staff Only: item control page
