Technical Reports

The ICICS/CS Reading Room


UBC CS TR-99-09 Summary

Computing Contour Trees in All Dimensions, August 26, 1999 Hamish Carr, Jack Snoeyink and Ulrike Axen, 10 pages

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 Tarasov and Vyalyi and of van Kreveld et al.


If you have any questions or comments regarding this page please send mail to help@cs.ubc.ca.