On the number of views of polyhedral terrains
- 1 July 1994
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 12 (2) , 177-182
- https://doi.org/10.1007/bf02574373
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Almost tight upper bounds for lower envelopes in higher dimensionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- New bounds for lower envelopes in three dimensions, with applications to visibility in terrainsPublished by Association for Computing Machinery (ACM) ,1993
- Efficiently computing and representing aspect graphs of polyhedral objectsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- Aspect graphs: An introduction and survey of recent resultsInternational Journal of Imaging Systems and Technology, 1990
- Visibility, occlusion, and the aspect graphInternational Journal of Computer Vision, 1990
- Visibility problems for polyhedral terrainsJournal of Symbolic Computation, 1989
- An algorithm for constructing the aspect graphPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Characteristic Views As A Basis For Three-Dimensional Object RecognitionPublished by SPIE-Intl Soc Optical Eng ,1982
- The singularities of the visual mappingBiological Cybernetics, 1976