Difference between revisions of "Delaunay complex and alpha shapes"
Jump to navigation
Jump to search
m |
|||
| (2 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
| − | In this tutorial we will learn how to employ the C++ library GUDHI<ref>http://gudhi.gforge.inria.fr/</ref> (Geometric understanding in higher dimensions). For a more complete picture of | + | In this tutorial we will learn how to employ the C++ library GUDHI<ref>http://gudhi.gforge.inria.fr/</ref> (Geometric understanding in higher dimensions) in order to compute the Delaunay complex and alpha shapes of given point cloud data. For a more complete picture of GUDHI we refer to the project homepage and recommend reading the tutorials provided there. |
| + | |||
| + | This tutorial describes the numerics leading to results as in [[What is Topological Data Analysis? - A Primer]]. | ||
__FORCETOC__ | __FORCETOC__ | ||
| Line 8: | Line 10: | ||
== Basic constructions == | == Basic constructions == | ||
| − | + | == References == | |
<references /> | <references /> | ||
Latest revision as of 19:03, 5 May 2019
In this tutorial we will learn how to employ the C++ library GUDHI[1] (Geometric understanding in higher dimensions) in order to compute the Delaunay complex and alpha shapes of given point cloud data. For a more complete picture of GUDHI we refer to the project homepage and recommend reading the tutorials provided there.
This tutorial describes the numerics leading to results as in What is Topological Data Analysis? - A Primer.