REGION INTERVISIBILITY IN TERRAINS

DOI10.1142/S0218195907002367zbMath1141.65349OpenAlexW1589815768MaRDI QIDQ5386744

René van Oostrum, Esther Moet, Marc J. van Kreveld

Publication date: 14 May 2008

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195907002367

zbMATH Keywords

algorithmtriangulationvisibilitypolyhedral terrains

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Unnamed Item
• Computing all large sums-of-pairs in \(\mathbb R^n\) and the discrete planar two-watchtower problem
• The internal representation of solid shape with respect to vision
• Efficient hidden surface removal for objects with small union size
• Triangulating a simple polygon
• Visibility with a moving point of view
• On the number of views of polyhedral terrains
• On a class of \(O(n^ 2)\) problems in computational geometry
• Lines in space: Combinatorics and algorithms
• Polygon triangulation: Efficiency and minimality

This page was built for publication: REGION INTERVISIBILITY IN TERRAINS