This paper illustrates how convexity hypotheses help collapsing simplicial complexes. We first consider a collection of compact convex sets and show that the nerve of the collection is collapsible whenever the union of sets in the collection is convex. We apply this result to prove that the Delaunay complex of a finite point set is collapsible. We then consider a convex domain defined as the convex hull of a finite point set. We show that if the point set samples sufficiently densely the domain, then both the Čech complex and the Rips complex of the point set are collapsible for a well-chosen scale parameter. A key ingredient in our proofs consists in building a filtration by sweeping space with a growing sphere whose center has been fixed and studying events occurring through the filtration. Since the filtration mimics the sublevel sets of a Morse function with a single critical point, we anticipate this work to lay the foundations for a non-smooth, discrete Morse Theory. 2012 ACM Subject Classification Theory of computation → Computational geometry
[1]
R. Ho.
Algebraic Topology
,
2022
.
[2]
Ragnar Freij,et al.
Equivariant discrete Morse theory
,
2009,
Discret. Math..
[3]
André Lieutier,et al.
Geometry-driven Collapses for Converting a Čech Complex into a Triangulation of a Nicely Triangulable Shape
,
2013,
Discret. Comput. Geom..
[4]
Ulrich Bauer,et al.
The Morse theory of Čech and Delaunay complexes
,
2013,
1312.1231.
[5]
André Lieutier,et al.
Efficient Data Structure for Representing and Simplifying Simplicial complexes in High Dimensions
,
2012,
Int. J. Comput. Geom. Appl..
[6]
K. Borsuk.
On the imbedding of systems of compacta in simplicial complexes
,
1948
.
[7]
Bruno Benedetti.
Discrete Morse Theory for Manifolds with Boundary
,
2010,
1007.3175.
[8]
André Lieutier,et al.
Vietoris-Rips complexes also provide topologically correct reconstructions of sampled shapes
,
2013,
Comput. Geom..