Placing observers to cover a polyhedral terrain in polynomial time
- 24 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Ray Shooting, Depth Orders and Hidden Surface RemovalPublished by Springer Nature ,1993
- 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
- Computational GeometryPublished by Springer Nature ,1985
- 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