Simple and optimal output-sensitive construction of contour trees using monotone paths

@article{Chiang2005SimpleAO,
  title={Simple and optimal output-sensitive construction of contour trees using monotone paths},
  author={Yi-Jen Chiang and Tobias Lenz and Xiang Lu and G{\"u}nter Rote},
  journal={Comput. Geom.},
  year={2005},
  volume={30},
  pages={165-195}
}
Contour trees are used when high-dimensional data are preprocessed for efficient extraction of isocontours for the purpose of visualization. So far, efficient algorithms for contour trees are based on processing the data in sorted order. We present a new algorithm that avoids sorting of the whole dataset, but sorts only a subset of so-called component-critical points. They form only a small fraction of the vertices in the dataset, for typical data that arise in practice. The algorithm is simple… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 58 CITATIONS

Task-based Augmented Contour Trees with Fibonacci

VIEW 4 EXCERPTS
CITES BACKGROUND, RESULTS & METHODS
HIGHLY INFLUENCED

Task-based augmented merge trees with Fibonacci heaps

  • 2017 IEEE 7th Symposium on Large Data Analysis and Visualization (LDAV)
  • 2017
VIEW 4 EXCERPTS
CITES BACKGROUND, RESULTS & METHODS
HIGHLY INFLUENCED

Contour forests: Fast multi-threaded augmented contour trees

  • 2016 IEEE 6th Symposium on Large Data Analysis and Visualization (LDAV)
  • 2016
VIEW 4 EXCERPTS
CITES BACKGROUND, RESULTS & METHODS
HIGHLY INFLUENCED

Visualizing 2D scalar fields with hierarchical topology

  • 2015 IEEE Pacific Visualization Symposium (PacificVis)
  • 2015
VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

A hybrid parallel algorithm for computing and tracking level set topology

  • 2012 19th International Conference on High Performance Computing
  • 2012
VIEW 5 EXCERPTS
CITES BACKGROUND, RESULTS & METHODS
HIGHLY INFLUENCED

A Minimal Contouring Approach to the Computation of the Reeb Graph

  • IEEE Transactions on Visualization and Computer Graphics
  • 2009
VIEW 7 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Describing shapes by geometrical-topological properties of real functions

  • ACM Comput. Surv.
  • 2008
VIEW 12 EXCERPTS
CITES METHODS, BACKGROUND & RESULTS
HIGHLY INFLUENCED

Reeb graph computation based on a minimal contouring

  • 2008 IEEE International Conference on Shape Modeling and Applications
  • 2008
VIEW 6 EXCERPTS
HIGHLY INFLUENCED

Task-Based Augmented Contour Trees with Fibonacci Heaps

  • IEEE Transactions on Parallel and Distributed Systems
  • 2019
VIEW 3 EXCERPTS
CITES BACKGROUND & RESULTS
HIGHLY INFLUENCED

Reeb graphs for shape analysis and applications

VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2004
2019

CITATION STATISTICS

  • 10 Highly Influenced Citations

References

Publications referenced by this paper.
SHOWING 1-10 OF 38 REFERENCES

Efficient computation of the topology of level sets

  • IEEE Visualization, 2002. VIS 2002.
  • 2002
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

Efficient construction of contour trees using monotonic paths, Dip lomarbeit (M.Sc

T. Lenz
  • Institut für Informatik, Freie Universität,
  • 2002
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Computing contour trees in all dimensions

VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

M

C. Bajaj
  • van Kreveld, R. van Oostrum, V. Pascucci, D.R. Schikore, Contour trees and small seed sets for is traversal, Tech. Rep. UU-CS-1998-25, Department of Computer Science, Utrecht University
  • 1998
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL