Guarding polyhedral terrains
- 1 February 1997
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 7 (3) , 173-185
- https://doi.org/10.1016/0925-7721(95)00034-8
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Three-coloring the vertices of a triangulated simple polygonPattern Recognition, 1992
- Analyses of visibility sites on topographic surfacesInternational Journal of Geographical Information Science, 1991
- Coverage problems and visibility regions on topographic surfacesAnnals of Operations Research, 1989
- Visibility problems for polyhedral terrainsJournal of Symbolic Computation, 1989
- A linear 5-coloring algorithm of planar graphsJournal of Algorithms, 1981
- An efficient algorithm for decomposing a polygon into star-shaped polygonsPattern Recognition, 1981
- A short proof of Chvátal's Watchman TheoremJournal of Combinatorial Theory, Series B, 1978
- Every planar map is four colorable. Part I: DischargingIllinois Journal of Mathematics, 1977
- A combinatorial theorem in plane geometryJournal of Combinatorial Theory, Series B, 1975