Avoiding the Global Sort: A Faster Contour Tree Algorithm
نویسندگان
چکیده
منابع مشابه
Avoiding the Global Sort: A Faster Contour Tree Algorithm
We revisit the classical problem of computing the contour tree of a scalar field f : M → R, where M is a triangulated simplicial mesh in R. The contour tree is a fundamental topological structure that tracks the evolution of level sets of f and has numerous applications in data analysis and visualization. All existing algorithms begin with a global sort of at least all critical values of f , wh...
متن کاملDo hypercubes sort faster than tree machines?
SUMMARY We develop a balanced, parallel quicksort algorithm for a hypercube and compare it with a similar algorithm for a binary tree machine. The performance of the hypercube algorithm is measured on a Computing Surface.
متن کاملA Faster Algorithm for the Inverse Spanning Tree Problem Ravindra
In this paper, we consider the inverse spanning tree problem. Given an undirected graph Go = (Ni, AO) with n nodes, mn arcs, an arc cost vector c, and a spanning tree T, the inverse spanning tree problem is to perturb the arc cost vector c to a vector d so that T is a minimum spanning tree with respect to the cost vector d and the cost of perturbation given by Id c = L(l j) Aldij ciil is minimu...
متن کاملA Faster Algorithm for the Inverse Spanning Tree Problem
In this paper, we consider the inverse spanning tree problem. Given an undi0 Ž 0 0 . rected graph G s N , A with n nodes, m arcs, an arc cost vector c, and a spanning tree T 0, the inverse spanning tree problem is to perturb the arc cost vector c to a vector d so that T 0 is a minimum spanning tree with respect to the < < < < cost vector d and the cost of perturbation given by d y c s Ý d y c i...
متن کاملA Faster Algorithm for the Steiner Tree Problem
The best algorithm for the Steiner tree problem by Dreyfus and Wagner is 33 years old. We celebrate this occasion and present a variation on this theme. A new algorithm is developed, which improves the running time from O(3 · n) to O ` (2 + ε) · poly(n) ́
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2017
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-017-9901-z