Simple and optimal output-sensitive construction of contour trees using monotone paths (Q705555)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2131605
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simple and optimal output-sensitive construction of contour trees using monotone paths |
scientific article; zbMATH DE number 2131605 |
Statements
Simple and optimal output-sensitive construction of contour trees using monotone paths (English)
0 references
31 January 2005
0 references
A new agorithm for computing contours trees in high dimensional spaces is described. Compared with previous algorithms for the same problem, the new one has the advantage of avoiding some sorting of the whole dataset by sorting only a subset of critical points. The experiments on unstructured three-dimensional meshes are based on real-world scientific visualisation applications.
0 references
contour tree
0 references
level sets
0 references
critical point
0 references
algorithm optimality
0 references
numerical examples
0 references
real-world scientific visualisation applications
0 references
computational topology
0 references
piecewise linear Morse theory
0 references
0 references
0.8504535
0 references
0 references
0.83851963
0 references
0.8317374
0 references
0.8173079
0 references
0.8155168
0 references
