Computing visibility on terrains in external memory

DOI10.1145/1412228.1412233MaRDI QIDQ5406173zbMATH OpenOpenAlexFDO

Authors Laura Toma, Yi Zhuang, Herman Haverkort

Publication date 1 April 2014

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL https://research.tue.nl/nl/publications/ed379fb4-4e97-4d88-b396-13dfebc0f320

zbMATH Keywords

computational geometrydata structures and algorithmsdigital elevation modelsI/O-efficiencyterrainsvisibility

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Analysis of algorithms (68W40)

Recommendations

• TERRAIN VISIBILITY WITH MULTIPLE VIEWPOINTS
• Terrain visibility with multiple viewpoints
• An efficient algorithm for the 1D total visibility-index problem
• I/O-Efficient Algorithms for Problems on Grid-Based Terrains
• An efficient algorithm for the 1D total visibility-index problem and its parallelization

Cited in

(7)

• Visibility maps of realistic terrains have linear smoothed complexity
• COMPUTING THE SET OF ALL THE DISTANT HORIZONS OF A TERRAIN
• An efficient algorithm for the 1D total visibility-index problem and its parallelization
• An efficient algorithm for the 1D total visibility-index problem
• TERRAIN VISIBILITY WITH MULTIPLE VIEWPOINTS
• Terracost: computing least-cost-path surfaces for massive grid terrains
• Computing Terrain Multi-visibility Maps for a Set of View Segments Using Graphics Hardware

This page was built for publication: Computing visibility on terrains in external memory

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