Flow Complex: General Structure and Algorithm

@inproceedings{Buchin2005FlowCG,
  title={Flow Complex: General Structure and Algorithm},
  author={Kevin Buchin and Joachim Giesen},
  booktitle={CCCG},
  year={2005}
}
The flow complex is a data structure, similar to the Delaunay triangulation, to organize a set of (weighted) points in R. Its structure has been examined in detail in two and three dimensions but only little is known about its structure in general. Here we propose the first algorithm for computing the flow complex in any dimension which reflects its recursive structure. On the basis of the algorithm we give a generalized and simplified proof of the homotopy equivalence of alphaand flow-shapes. 

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-3 of 3 extracted citations

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Flow complexes : structure, algorithms and applications

M. John
PhD thesis, Technische Wissenschaften ETH Zürich, • 2003
View 1 Excerpt

Spatial Tesselations: Concepts and Applications of Voronoi Diagrams

A. Okabe, B. Boots, K. Sugihara, S. N. Chiu
2000

The Union of Balls and Its Dual Shape

Discrete & Computational Geometry • 1995
View 1 Excerpt

Critical point theory for distance functions

K. Grove
Proc. Sympos. Pure Math., pages 357–385. Amer. Math. Soc., • 1993
View 2 Excerpts