Some theoretical results on discrete contour trees

Autor:	Song, Yuqing
Rok vydání:	2022
Předmět:	Computer Science - Computer Vision and Pattern Recognition Computer Science - Computational Geometry
Druh dokumentu:	Working Paper
Popis:	Contour trees have been developed to visualize or encode scalar data in imaging technologies and scientific simulations. Contours are defined on a continuous scalar field. For discrete data, a continuous function is first interpolated, where contours are then defined. In this paper we define a discrete contour tree, called the iso-tree, on a scalar graph, and discuss its properties. We show that the iso-tree model works for data of all dimensions, and develop an axiomatic system formalizing the discrete contour structures. We also report an isomorphism between iso-trees and augmented contour trees, showing that contour tree algorithms can be used to compute discrete contour trees, and vice versa. Comment: 5 pages, 5 figures
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2206.12123 Zobrazit plný text záznamu View this record from Arxiv