A system to place observers on a polyhedral terrain in polynomial time
- 3 May 2000
- journal article
- Published by Elsevier in Image and Vision Computing
- Vol. 18 (10) , 773-780
- https://doi.org/10.1016/s0262-8856(99)00045-1
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Placing observers to cover a polyhedral terrain in polynomial timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On levels of detail in terrainsPublished by Association for Computing Machinery (ACM) ,1995
- Visibility algorithms on triangulated digital terrain modelsInternational Journal of Geographical Information Science, 1994
- Three-coloring the vertices of a triangulated simple polygonPattern Recognition, 1992
- Voronoi diagrams—a survey of a fundamental geometric data structureACM Computing Surveys, 1991
- Minimal roughness property of the Delaunay triangulationComputer Aided Geometric Design, 1990
- Visibility problems for polyhedral terrainsJournal of Symbolic Computation, 1989
- A linear 5-coloring algorithm of planar graphsJournal of Algorithms, 1981
- A short proof of Chvátal's Watchman TheoremJournal of Combinatorial Theory, Series B, 1978
- A combinatorial theorem in plane geometryJournal of Combinatorial Theory, Series B, 1975