Visibility maps of realistic terrains have linear smoothed complexity

DOI10.20382/JOCG.V1I1A5MaRDI QIDQ2968069zbMATH OpenOpenAlexFDO

Authors Constantinos P. Tsirogiannis, Mark de Berg, Herman Haverkort

Publication date 9 March 2017

Full work available at URL https://doaj.org/article/82ff4ddfe0824755bb6f2f6a373805f6

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial complexity of geometric structures (52C45)

Recommendations

• Visibility maps of realistic terrains have linear smoothed complexity
• Visibility preserving terrain simplification, an experimental study
• On characterizing terrain visibility graphs
• Terrain visibility graphs: persistence is not enough
• Computing visibility on terrains in external memory
• Computing Terrain Multi-visibility Maps for a Set of View Segments Using Graphics Hardware
• On Voronoi visibility maps of 1.5D terrains with multiple viewpoints
• Visibility maps and spherical algorithms

Cited in

(4)

• Visibility maps of realistic terrains have linear smoothed complexity
• On realistic terrains
• Smoothed analysis of local search algorithms
• On the Most Likely Voronoi Diagram and Nearest Neighbor Searching

This page was built for publication: Visibility maps of realistic terrains have linear smoothed complexity

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