COMPUTING THE SET OF ALL THE DISTANT HORIZONS OF A TERRAIN

DOI10.1142/S0218195905001841zbMath1113.65018OpenAlexW2108375200MaRDI QIDQ3373053

Daniel Archambault, William S. Evans, David G. Kirkpatrick

Publication date: 13 March 2006

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

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

zbMATH Keywords

algorithmhorizonorthographic viewsterrain surface

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Finding the upper envelope of n line segments in O(n log n) time
• On the number of views of polyhedral terrains
• Almost tight upper bounds for lower envelopes in higher dimensions
• On a class of \(O(n^ 2)\) problems in computational geometry
• On-line construction of the upper envelope of triangles and surface patches in three dimensions
• A Computational Geometric Approach to Visual Hulls

This page was built for publication: COMPUTING THE SET OF ALL THE DISTANT HORIZONS OF A TERRAIN