Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
414418 | Computational Geometry | 2008 | 23 Pages |
Abstract
The flow complex is a geometric structure, similar to the Delaunay tessellation, to organize a set of (weighted) points in Rk. Flow shapes are topological spaces corresponding to substructures of the flow complex. The flow complex and flow shapes have found applications in surface reconstruction, shape matching, and molecular modeling. In this article we give an algorithm for computing the flow complex of weighted points in any dimension. The algorithm reflects the recursive structure of the flow complex. On the basis of the algorithm we establish a topological similarity between flow shapes and the nerve of a corresponding ball set, namely homotopy equivalence.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics