Efficient construction of the Čech complex

In many applications, the first step into the topological analysis of a discrete point set P sampled from a manifold is the construction of a simplicial complex with vertices on P. In this paper, we present an algorithm for the efficient computation of the Cech complex of P for a given value @e of the radius of the covering balls. Experiments show that the proposed algorithm can generally handle input sets of several thousand points, while for the topologically most interesting small values of @e can handle inputs with tens of thousands of points. We also present an algorithm for the construction of all possible Cech complices on P.

[1]  Alireza Tahbaz-Salehi,et al.  Distributed Coverage Verification in Sensor Networks Without Location Information , 2010, IEEE Transactions on Automatic Control.

[2]  Afra Zomorodian,et al.  Fast construction of the Vietoris-Rips complex , 2010, Comput. Graph..

[3]  Deok-Soo Kim,et al.  Querying simplexes in quasi-triangulation , 2012, Comput. Aided Des..

[4]  Hermann A. Maurer,et al.  New Results and New Trends in Computer Science , 1991, Lecture Notes in Computer Science.

[5]  Deok-Soo Kim,et al.  Quasi-worlds and quasi-operators on quasi-triangulations , 2010, Comput. Aided Des..

[6]  Leonidas J. Guibas,et al.  Reconstruction Using Witness Complexes , 2007, SODA '07.

[7]  Herbert Edelsbrunner,et al.  Topological persistence and simplification , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[8]  Emo Welzl,et al.  Smallest enclosing disks (balls and ellipsoids) , 1991, New Results and New Trends in Computer Science.

[9]  Deok-Soo Kim,et al.  Three-dimensional beta-shapes and beta-complexes via quasi-triangulation , 2010, Comput. Aided Des..

[10]  Gunnar E. Carlsson,et al.  Topological estimation using witness complexes , 2004, PBG.

[11]  Vin de Silva,et al.  Coverage in sensor networks via persistent homology , 2007 .

[12]  Afra Zomorodian,et al.  Computing Persistent Homology , 2004, SCG '04.

[13]  Leonidas J. Guibas,et al.  Image webs: Computing and exploiting connectivity in image collections , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[14]  P. Alexandroff,et al.  Simpliziale Approximationen in der allgemeinen Topologie , 1927 .

[15]  L. Vietoris.  Über den höheren Zusammenhang kompakter Räume und eine Klasse von zusammenhangstreuen Abbildungen , 1927 .

[16]  Deok-Soo Kim,et al.  Three-dimensional beta shapes , 2006, Comput. Aided Des..

[17]  Eduard Čech,et al.  Théorie générale de l'homologie dans un espace quelconque , 1932 .

[18]  Erin W. Chambers,et al.  Vietoris–Rips Complexes of Planar Point Sets , 2009, Discret. Comput. Geom..

[19]  Bernd Gärtner,et al.  Fast and Robust Smallest Enclosing Balls , 1999, ESA.

[20]  Mikael Vejdemo-Johansson.  Interleaved computation for persistent homology , 2011, ArXiv.

[21]  H. Edelsbrunner.  The union of balls and its dual shape , 1995 .