Sciweavers

650 search results - page 27 / 130
» Progressive simplicial complexes
Sort
View
COMPGEOM
2010
ACM
14 years 4 months ago
Approximating loops in a shortest homology basis from point data
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...
Tamal K. Dey, Jian Sun, Yusu Wang
COMPGEOM
2011
ACM
13 years 2 months ago
An output-sensitive algorithm for persistent homology
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...
Chao Chen, Michael Kerber
DFG
1992
Springer
14 years 3 months ago
Complexity of Boolean Functions on PRAMs - Lower Bound Techniques
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
Miroslaw Kutylowski
TCBB
2010
122views more  TCBB 2010»
13 years 9 months ago
On the Complexity of uSPR Distance
We show that subtree prune and regraft (uSPR) distance on unrooted trees is fixed parameter tractable with respect to the distance. We also make progress on a conjecture of Steel...
Maria Luisa Bonet, Katherine St. John
CVRMED
1995
Springer
14 years 2 months ago
Medical Image Segmentation Using Topologically Adaptable Snakes
This paper presents a technique for the segmentation of anatomic structures in medical images using a topologically adaptable snakes model. The model is set in the framework of dom...
Tim McInerney, Demetri Terzopoulos