2012 · 41 citations · 28 references
ComputingComputer ScienceHigh-performance ComputingParallel AlgorithmsParallel ComputingScientific ComputingComputational TopologyData ParallelismGeometry ProcessingGraphics Processing Unit ComputingGraphics Processing UnitsMesh ProcessingContour TreesParallel Algorithm ScalabilityScalable Parallel AlgorithmsScalar Field TopologyScientific Computing On GpusScientific Data AnalysisTopological AbstractionVisual Exploration
The contour tree is a topological abstraction of a scalar field that captures evolution in level set connectivity. It is an effective representation for visual exploration and analysis of scientific data. We describe a work-efficient, output sensitive, and scalable parallel algorithm for computing the contour tree of a scalar field defined on a domain that is represented using either an unstructured mesh or a structured grid. A hybrid implementation of the algorithm using the GPU and multi-core CPU can compute the contour tree of an input containing 16 million vertices in less than ten seconds with a speedup factor of upto 13. Experiments based on an implementation in a multi-core CPU environment show near-linear speedup for large data sets.
28
Adhi Harmoko S, M.Komp, Joseph Marie Jacquard et al. · 2005 · 18.4K citations
V. J. Rayward‐Smith, Thomas H. Cormen, Charles E. Leiserson et al. · Journal of the Operational Research Society · 1991 · 17K citations
Marching cubes: A high resolution 3D surface construction algorithm
William E. Lorensen, H. E. Cline · 1987 · 10.2K citations · Full text
Computing, Radiology, Visualization +17
Michael J. Ackerman · Proceedings of the IEEE · 1998 · 722 citations
Computing, Anatomy, Visualization +17
Computing contour trees in all dimensions
Hamish Carr, Jack Snoeyink, Ulrike Axen · Computational Geometry · 2002 · 460 citations