1. Sampling conditions and topological guarantees for shape reconstruction algorithms Andre Lieutier, Dassault Sytemes Thanks to Dominique Attali for some slides (the nice ones) Thanks to Dominique Attali, Fréderic Chazal, David Cohen-Steiner for joint work

2. Shape Reconstruction INPUTOUTPUT Surface of physical object UNKNOWN geometrically accurate topologically correct Triangulation Sample in R 3

3. INPUTOUTPUT Unordered sequence of images varying in pose and lighting Low-dimensional complex Shape Reconstruction (or manifold learning)

4. INPUTOUTPUT Space with small intrinsec dimension Sample in R d UNKNOWN geometrically accurate topologically correct Simplicial complex

5. Algorithms in 2D heuristics to select a subset of the Delaunay triangulation

6. Algorithms in 3D heuristics to select a subset of the Delaunay triangulation

7. A Simple Algorithm INPUTOUTPUT  -offset = union of balls with radius centered on the sample ShapeSample UNKNOWN

8. A Simple Algorithm INPUTOUTPUT ShapeSample  -offset  -complex UNKNOWN From Nerve Theorem:

9. A Simple Algorithm OUTPUT ShapeSample

11. Reconstruction theorem

12. [Niyogi Smale Weinberger 2004] Sampling conditions

14. Beyond the reach : WFS and  -reach

15. 1  reach  - reach wfs   Beyond the reach : WFS and  -reach

16. Previous best known result for faithful reconstruction of set with positive m-reach (Chazal, Cohen-Steiner,Lieutier 2006)

18. Best known result for faithful reconstruction of set with positive m-reach

19. Under the conditions of the theorem, a simple offset of the sample is a faithful reconsruction Previous best known result for faithful reconstruction of set with positive m-reach (Chazal, Cohen-Steiner,Lieutier 2006)

20. Recovering homology (Cohen-Steiner,Edelsbrunner,Harer 2006) (Chazal, Lieutier 2006)

21. Recovering homology (Cohen-Steiner,Edelsbrunner,Harer 2006) (Chazal, Lieutier 2006)

22. Recovering homology (Cohen-Steiner,Edelsbrunner,Harer 2006) (Chazal, Lieutier 2006)

23. Recovering homology (Cohen-Steiner,Edelsbrunner,Harer 2006) (Chazal, Lieutier 2006)

24. Recovering homology (Cohen-Steiner,Edelsbrunner,Harer 2006) (Chazal, Lieutier 2006)

25. Rips Complex

26. Samplng condition for Cech and Rips (D. Attali, A. Lieutier 2011) [CCL06] [NSW04]

27. Questions ?

29. Cech / Rips the same topology, but... Rips and Cech complexes generally don’t share the same topology, but...

30. Cech / Rips

31. Possesses a spirituous cycle that we want to kill ! Possesses a spirituous cycle that we want to kill !

32. Cech / Rips Had there been a point close to the center, it would have distroy spirituous cycles appearing in the Rips, without changing the Cech.

33. Convexity defects function

34. Large  -reach => small convexity defect functions

35. Density authorized [CCL06] [NSW04]

36. Questions ?

37. Cech Complex

38. Nerve Theorem

39. Optimal sampling condition is tigth

40. Persistent homology

47. Simplicial complexes and Nerve Theorem Nerve theorem (Leray, Weyl, others,..1940’ s ): If any non empty intersection of sets of F is contractible, then the nerve N(F) has the same homotopy type as the union of all the sets of the familly. A familly of sets F Its nerve N(F) (Lets say finite familly of compacts sets)

48. Nerve Theorem Delauney complex The Delauney complex is the nerve of (closures of full dimensional) Voronoi cells  -complex The  -complex is the nerve of the intersections of (closures of full dimensional) voronoi cells with the  -offset of the point set

49. Generalized gradient, WFS and  -reach 1  reach  - reach wfs

50. Topological stability of offsets 1  reach  - reach wfs

51. Reconstruction from  -reach based condition and topological persistence..