Computing contour trees in all dimensions
Public Deposited- Creator
- Carr, Hamish
- Snoeyink, Jack
- Axen, Ulrike
- Abstract
- We show that contour trees can be computed in all dimensions by a simple algorithm that merges two trees. Our algorithm extends, simplifies, and improves work of S. P. Tarasov and M. N. Vyalyi [Construction of contour trees in 3D in O(nlogn) steps. In Proc. 14th Annu. ACM Sympos. on Comput. Geom., 68-75 (1998)] and of M. van Kreveld, R. van Oostrum, C. Bajaj, V. Pascucci and D. Schikore [Contour trees and small seed sets for isosurface traversal. In Proc. 13th Annu, ACM Sympos. Comput. Geom., 212-220 (1997)].
- Date of publication
- 2003
- Keyword
- DOI
- Identifier
- Publisher DOI: https://doi.org/10.1016/S0925-7721(02)00093-7
- Onescience id: 138940039073e3e0834037b2f93a42035e50d40e
- Resource type
- Article
- Rights statement
- In Copyright
- Journal title
- Computational Geometry - Theory and Applications
- Journal volume
- 24
- Journal issue
- 2
- Page start
- 75
- Page end
- 94
- Language
- English
- ISSN
- 1879-081X
- 0925-7721
Relations
- Parents:
This work has no parents.
Items
| Thumbnail | Title | Date Uploaded | Visibility | Actions |
|---|---|---|---|---|
|
|
1f8fa27e992309e6ee6a08056aa765262239bfdd.pdf | 2021-06-23 | Public | Download |