I/O-efficient batched union-find and its applications to terrain analysis

DOI10.1145/1868237.1868249MaRDI QIDQ3188993zbMATH OpenOpenAlexFDO

Authors Lars Arge, Ke Yi, Pankaj K. Agarwal

Publication date 9 September 2014

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1868237.1868249

zbMATH Keywords

union-findI/O-efficient algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Recommendations

• I/O-Efficient Algorithms for Problems on Grid-Based Terrains
• I/O-efficient contour queries on terrains
• I/O-efficient computation of water flow across a terrain
• I/O-efficient contour tree simplification
• I/O-efficient event based depression flood risk

Cited in

(4)

• I/O-efficient contour queries on terrains
• I/O-Efficient Algorithms for Problems on Grid-Based Terrains
• Removing local extrema from imprecise terrains
• An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications

This page was built for publication: I/O-efficient batched union-find and its applications to terrain analysis

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