I/O-efficient contour queries on terrains

MaRDI QIDQ5365042zbMATH OpenFDO

Authors Thomas Mølhave, Bardia Sadri, Pankaj K. Agarwal

Publication date 29 September 2017

Full work available at URL http://dl.acm.org/citation.cfm?id=2133059

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Maintaining contour trees of dynamic terrains
• I/O-efficient batched union-find and its applications to terrain analysis
• I/O-efficient path traversal in succinct planar graphs
• I/O-efficient contour tree simplification
• Trekking in the alps without freezing or getting tired

Cited in

(3)

• Simplifying Massive Contour Maps
• I/O-efficient batched union-find and its applications to terrain analysis
• Maintaining contour trees of dynamic terrains

This page was built for publication: I/O-efficient contour queries on terrains

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