COMPUTING THE SET OF ALL THE DISTANT HORIZONS OF A TERRAIN

DOI10.1142/S0218195905001841MaRDI QIDQ3373053zbMATHOpenAlexFDO

Authors Daniel Archambault, W. Evans, David 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)

Recommendations

• Remarks on the computation of the horizon of a digital terrain
• Computing visibility on terrains in external memory
• Computing Large Planar Regions in Terrains
• Computing Terrain Multi-visibility Maps for a Set of View Segments Using Graphics Hardware
• Computing realistic terrains from imprecise elevations
• Algorithms for ε-Approximations of Terrains

Cites work

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

Cited in

(3)

• Computing large planar regions in terrains, with an application to fracture surfaces
• Computing Large Planar Regions in Terrains
• Remarks on the computation of the horizon of a digital terrain

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3373053)