Tangential (Delaunay) Lifting (PointCloud to Simplicial)

[bekemax]

This submission implements lifting from a point cloud to a tangential complex, introduced in [1]

A Tangential (Delaunay) complex is a simplicial complex designed to reconstruct a $k$-dimensional manifold embedded in
$d$-dimensional Euclidean space. The input is a point sample coming from an unknown manifold. The running time depends only linearly on the extrinsic dimension $d$ and exponentially on the intrinsic dimension $k$.

Present implementation basically uses TCs implemented in Gudhi by Clément Jamin (image from there)

[1] Jean-Daniel Boissonnat and Arijit Ghosh. Manifold reconstruction using tangential delaunay complexes. Discrete & Computational Geometry, 51(1):221–267, 2014. URL: http://dx.doi.org/10.1007/s00454-013-9557-2, doi:10.1007/s00454-013-9557-2.

[review-notebook-app]

Check out this pull request on 

See visual diffs & provide feedback on Jupyter Notebooks.

---

Powered by ReviewNB

[gbg141]

Hello @bekemax! Thank you for your submission. As we near the end of the challenge, I am collecting participant info for the purpose of selecting and announcing winners. Please email me (or have one member of your team email me) at [email protected] so I can share access to the voting form. In your email, please include:

• your first and last name (as well as any other team members)
• the title of the method you implemented
• the input domain of the method you implemented
• the output domain of the method you implemented
• your pull request number (Tangential (Delaunay) Lifting (PointCloud to Simplicial) #59)

Before July 12, make sure that your submission respects all Submission Requirements laid out on the challenge page. Any submission that fails to meet this criteria will be automatically disqualified.