scientific article; zbMATH DE number 1445395

MaRDI QIDQ4952718zbMATH OpenFDO

Authors Hamish Carr, Jack Snoeyink, Ulrike Axen

Publication date 10 May 2000

zbMATH Keywords

contour trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Computing contour trees in all dimensions
• Simple and optimal output-sensitive construction of contour trees using monotone paths
• Triplet merge trees
• Parallel computation of the topology of level sets
• Representing Interpolant Topology for Contour Tree Computation

Cited in

(7)

• Computing contour trees in all dimensions
• Topology analysis of time-dependent multi-fluid data using the Reeb graph
• Representing Interpolant Topology for Contour Tree Computation
• I/O-efficient contour tree simplification
• Triplet merge trees
• Distributed Task-Parallel Topology-Controlled Volume Rendering
• Simple and optimal output-sensitive construction of contour trees using monotone paths

This page was built for publication:

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