Computing contour trees in all dimensions
By Hamish A. Carr, Jack Snoeyink, Ulrike Axen. ACM-SIAM Symposium on Discrete Algorithms, 2000
639 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Computer Vision and Pattern Recognition, Signal Processing
View Paper: https://www.semanticscholar.org/paper/1f64a00131efd4441a79f94238a4ebbbef5230ad
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Herbert Edelsbrunner
- John Harer
- Silvia Biasotti
- Michela Spagnuolo
- Daniela Giorgi
- Bianca Falcidieno
- Afra Zomorodian
- Peter Bubenik
In Computer Vision and Pattern Recognition
- Herbert Edelsbrunner
- John Harer
- Silvia Biasotti
- Michela Spagnuolo
- Bianca Falcidieno
- Daniela Giorgi
- Afra Zomorodian
- Thierry Sousbie
Citations in the corpus
- Reeb graphs for shape analysis and applications (2008, methodology): “This tree was firstly introduced in [35] with the name of Augmented Contour Tree (ACT) but it was renamed contour topology tree by [22] to avoid confusion with the augmented contour tree described in [38], which denotes the subdivision of the contour tree by all vertices of the input mesh.”
- Hierarchical Morse—Smale Complexes for Piecewise Linear 2-Manifolds (2003, background): “Our results complement and improve related work in visualization [1, 5, 16] and computational geometry [3, 4, 17].”