I/O-efficient contour tree simplification

DOI10.1007/978-3-642-10631-6_116MaRDI QIDQ3652300zbMATH OpenOpenAlexFDO

Authors Lars Arge, Morten Revsbæk

Publication date 17 December 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10631-6_116

Mathematics Subject Classification ID

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

Recommendations

• Simple and optimal output-sensitive construction of contour trees using monotone paths
• Publication:4952718
• Simplifying massive planar subdivisions
• Avoiding the global sort: a faster contour tree algorithm
• Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree

Cited in

(7)

• Avoiding the global sort: a faster contour tree algorithm
• Avoiding the global sort: a faster contour tree algorithm
• I/O-efficient batched union-find and its applications to terrain analysis
• Computational Topology via Functional Programming: A Baseline Analysis
• Simplifying massive planar subdivisions
• I/O-efficient contour queries on terrains
• Simple and optimal output-sensitive construction of contour trees using monotone paths

This page was built for publication: I/O-efficient contour tree simplification

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