Fast similarity search in scalar fields using merging histograms

DOI10.1007/978-3-319-44684-4_7MaRDI QIDQ5359510zbMATH OpenOpenAlexFDO

Authors Himangshu Saikia, Hans-Peter Seidel, Tino Weinkauf

Publication date 25 September 2017

Published in Mathematics and Visualization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-44684-4_7

Mathematics Subject Classification ID

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

Recommendations

• Interactive comparison of multifield scalar data based on largest contours
• Fast Retrieval of Isolated Visual Shapes
• Measuring the distance between merge trees
• scientific article; zbMATH DE number 1756675
• Triplet merge trees

Cited in

(4)

• Interactive comparison of multifield scalar data based on largest contours
• Fast topology-based feature tracking using a directed acyclic graph
• Topological Feature Search in Time-Varying Multifield Data
• Labeled interleaving distance for Reeb graphs

This page was built for publication: Fast similarity search in scalar fields using merging histograms

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