I/O-Efficient Algorithms for Problems on Grid-Based Terrains

DOI10.1145/945394.945395MaRDI QIDQ5463423zbMATH OpenOpenAlexFDO

Authors Lars Arge, Laura Toma, Jeffrey Scott Vitter

Publication date 4 August 2005

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

Full work available at URL http://www.jea.acm.org/2001/ArgeIO/

zbMATH Keywords

connected componentsexperimental algorithmsflowgrid based terrainsI/O efficientI/O modelshortes paths

Mathematics Subject Classification ID

Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Analysis of algorithms (68W40)

Recommendations

• I/O-efficient event based depression flood risk
• External-memory algorithms for processing line segments in geographic information systems
• I/O-efficient computation of water flow across a terrain
• External-memory algorithms for processing line segments in geographic information systems
• I/O-efficient batched union-find and its applications to terrain analysis

Cited in

(10)

• An external-memory depth-first search algorithm for general grid graphs
• The complexity of flow on fat terrains and its i/o-efficient computation
• I/O-efficient batched union-find and its applications to terrain analysis
• Computing Large Planar Regions in Terrains
• I/O-efficient event based depression flood risk
• Computing floods caused by non-uniform sea-level rise
• Terracost: computing least-cost-path surfaces for massive grid terrains
• I/O-efficient computation of water flow across a terrain
• Computing visibility on terrains in external memory
• External-memory depth-first search algorithm for solid grid graphs

This page was built for publication: I/O-Efficient Algorithms for Problems on Grid-Based Terrains

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