Cited by 337Topological and Geometric Data AnalysisHomotopy and Cohomology in Algebraic TopologyGeometric and Algebraic Topology

Topological estimation using witness complexes

Open access
Silva, Vin De, Carlsson, Gunnar·2004·The Eurographics Association

Abstract

This paper tackles the problem of computing topological invariants of geometric objects in a robust manner, using only point cloud data sampled from the object. It is now widely recognised that this kind of topological analysis can give qualitative information about data sets which is not readily available by other means. In particular, it can be an aid to visualisation of high dimensional data. Standard simplicial complexes for approximating the topological type of the underlying space (such as Cech, Rips, or a-shape) produce simplicial complexes whose vertex set has the same size as the underlying set of point cloud data. Such constructions are sometimes still tractable, but are wasteful (of computing resources) since the homotopy types of the underlying objects are generally realisable on much smaller vertex sets. We obtain smaller complexes by choosing a set of ‘landmark’ points from our data set, and then constructing a "witness complex" on this set using ideas motivated by the usual Delaunay complex in Euclidean space. The key idea is that the remaining (non-landmark) data points are used as witnesses to the existence of edges or simplices spanned by combinations of landmark points. Our construction generalises the topology-preserving graphs of Martinetz and Schulten [MS94] in two directions. First, it produces a simplicial complex rather than a graph. Secondly it actually produces a nested family of simplicial complexes, which represent the data at different feature sc…

Integrity signals

Registry

DataCite · 10.2312/spbg/spbg04/157-166

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The witness complex is one solution to the problem of unmanageable Rips complexes.

    “The witness complex of Carlsson and de Silva [8,9,14] is one solution to this problem.”

    From Barcodes: the persistent topology of data (2007) · cites this paper as [9]

  • The witness complex yields smaller complexes by using a version of the Voronoi diagram on the data set X itself, with vertex set a set of landmark points smaller than X.

    “A second construction that yields smaller complexes is the witness complex (de Silva and Carlsson 2004) in its various forms. The idea here is to use a version of the Voronoi diagram on the data set X itself, rather than on a space in which X is embedded. The vertex set of the complex constructed is smaller than X , consisting of a set of landmark points within X .”

    From Topological pattern recognition for point cloud data (2014) · cites this paper as de Silva and Carlsson 2004

No citation lists for this paper

No citation lists for this paper yet — checked again daily.

References 14 · Cited by 337

Authors
Silva, V. D., & Carlsson, G.
Affiliations
Stanford University (US)
Venue
The Eurographics Association
Publisher
The Eurographics Association
Published
2004
Pages
157-166
OpenAlex
W1486210143
Cited by
337
References
14
Citations by year
2026: 3 · 2025: 4 · 2024: 11 · 2023: 12 · 2022: 9 · 2021: 21 · 2020: 27 · 2019: 25 · 2018: 14 · 2017: 15 · 2016: 17 · 2015: 18 · 2014: 23 · 2013: 21 · 2012: 21
FWCI
12.84
Type
journal article
Language
en
Open access
Locations
Eurographics
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Topological and Geometric Data Analysis
  • Physical Sciences › Mathematics › Mathematical Physics › Homotopy and Cohomology in Algebraic Topology
  • Physical Sciences › Mathematics › Geometry and Topology › Geometric and Algebraic Topology
Keywords
topological invariants, point cloud data, simplicial complexes, landmark points, persistent homology, homotopy type, high-dimensional data visualization

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review