On the number of views of polyhedral terrains

DOI10.1007/BF02574373zbMath0809.52011OpenAlexW2138332656MaRDI QIDQ1334930

Micha Sharir, Pankaj K. Agarwal

Publication date: 26 September 1994

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131324

zbMATH Keywords

polyhedral terraincomplexity of lower envelopesnumber of views

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (7)

Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications ⋮ The overlay of lower envelopes and its applications ⋮ On the number of views of translates of a cube and related problems. ⋮ REGION INTERVISIBILITY IN TERRAINS ⋮ Visibility maps of segments and triangles in 3D ⋮ COMPUTING THE SET OF ALL THE DISTANT HORIZONS OF A TERRAIN ⋮ Notes on the complexity of exact view graph algorithms for piecewise smooth algebraic surfaces

Cites Work

• The singularities of the visual mapping
• New bounds for lower envelopes in three dimensions, with applications to visibility in terrains

This page was built for publication: On the number of views of polyhedral terrains