Search arXivSearch

arXiv · 1304.3680

Geometry-driven collapses for converting a Cech complex into a triangulation of a nicely triangulable shape

Abstract

Given a set of points that sample a shape, the Rips complex of the data points is often used in machine-learning to provide an approximation of the shape easily-computed. It has been proved recently that the Rips complex captures the homotopy type of the shape assuming the vertices of the complex meet some mild sampling conditions. Unfortunately, the Rips complex is generally high-dimensional. To remedy this problem, it is tempting to simplify it through a sequence of collapses. Ideally, we would like to end up with a triangulation of the shape. Experiments suggest that, as we simplify the complex by iteratively collapsing faces, it should indeed be possible to avoid entering a dead end such as the famous Bing's house with two rooms. This paper provides a theoretical justification for this empirical observation. We demonstrate that the Rips complex of a point-cloud (for a well-chosen scale parameter) can always be turned into a simplicial complex homeomorphic to the shape by a sequence of collapses, assuming the shape is nicely triangulable and well-sampled (two concepts we will explain in the paper). To establish our result, we rely on a recent work which gives conditions under which the Rips complex can be converted into a Cech complex by a sequence of collapses. We proceed in two phases. Starting from the Cech complex, we first produce a sequence of collapses that arrives to the Cech complex, restricted by the shape. We then apply a sequence of collapses that transforms the result into the nerve of some robust covering of the shape.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dominique Attali, André Lieutier. 2015-11-13. Geometry-driven collapses for converting a Cech complex into a triangulation of a nicely triangulable shape. https://doi.org/10.1007/s00454-015-9733-7

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A constant-factor approximation of the Gromov-Hausdorff distance in the plane

We give the first polynomial-time constant-factor approximation of the Gromov-Hausdorff distance d_GH between finite point sets in the Euclidean plane; in fixed Euclidean dimension such an approximation was previously known only on the line (Majhi, Vitter and Wenk, 2024). Global alignment cannot succeed: the classical dimension drop defeats alignment by isometries, a multiplicity gap defeats alignment by bijections, and a reflection barrier defeats sorting under any single global reflection pattern. The algorithm is therefore local. Guessing the images of one diameter pair pins every point's longitudinal coordinate to within O(d_GH). Heights are read in windows whose height spread is at most a fixed multiple of their length, where a chain argument makes every compatible match local in the plane. One reflection sign per window is then chosen by 2-SAT; at the right frame and guess, any solution yields a correspondence of distortion O(d_GH). For the bijective relative of d_GH, half the least additive distortion over bijections, the same scheme reduces the planar problem to a matching question that we leave open.

cs.CG

Witness Set in Weak Visibility Polygons is Polynomial-Time Solvable

In the classical Art Gallery Problem (AGP), guards are placed in a polygon so that together they see every point. The Witness Set Problem (WSP), introduced by Amit, Mitchell, and Packer, is a natural dual to the AGP. In this paper, we study the WSP in weak visibility polygons (WVPs), the simple polygons in which every point is seen from some point of one fixed edge. A witness set is a set of points whose visibility regions are pairwise disjoint, so that no single guard sees two of them. A maximum witness set, therefore, lower-bounds the guard number. Exact polynomial-time algorithms for the WSP are known only for monotone mountains, a proper subclass of WVPs. We give the first exact polynomial-time algorithms for the WSP in WVPs, in two settings. In the Discrete Witness Set Problem (DiscWSP), the witnesses come from a given set of $m$ points, and we find a maximum witness subset in $O(n + m \log(n+m))$ time on an $n$-vertex polygon. The algorithm rests on a structural fact: the visibility intersection graph of a WVP, in which two points are adjacent if their visibility regions intersect, is a trapezoid graph, that is, an intersection graph of trapezoids between two parallel lines. Moreover, the class of these graphs properly contains the interval graphs and the permutation graphs, which may be of independent interest in graph theory. We also prove an $Ω(n \log n)$ lower bound in the algebraic decision-tree model for instances with $m = Θ(n)$, so our algorithm for DiscWSP is optimum. In the Continuous Witness Set Problem (ContWSP), a witness may be any point of the polygon, and we give an exact algorithm running in $O(n \log n + ρ^{2}(n + ρ^{2}))$ time, where $ρ$ is the number of reflex vertices.

cs.CG

Bichromatic Line-Centers for Point Pairs

We study the \emph{bichromatic line-center problem} for $n$ pairs of points in the plane. A feasible solution assigns one point from each pair to the red set $R$ and the other to the blue set $B$. The goal is to minimize $\max\{w^\circ(R),\,w^\circ(B)\}$, where $w^\circ(X)$ denotes the minimum width of a strip enclosing $X$; the midlines of the corresponding optimal strips define the line-centers of $R$ and $B$. We consider several variants induced by orientational constraints on line-centers and provide efficient algorithms for each. For one line-center, which consists of computing a minimum-width strip that contains at least one point from each pair, we give an $O(n^2)$-time algorithm. For two line-centers, we obtain an $O(n)$-time algorithm when both are horizontal, and $Θ(n\log n)$-time algorithms when the two centers are parallel or when both orientations are prescribed. When exactly one orientation is prescribed, we give an $O(n^2)$-time algorithm. Finally, for the unrestricted case, we present an $O(n^3\log n)$-time algorithm.

cs.CG