An Incremental Algorithm for Betti Numbers of Simplicial Complexes

Download PDF
Open Webpage

Cecil Jose A. Delfinado, Herbert Edelsbrunner

Published: 01 Jan 1993, Last Modified: 15 May 2024SCG 1993EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: A general and direct method for computing the betti numbers of the homology groups of a finite simplicial complex is given. For subcomplexes of a triangulation of S3 this method has implementations that run in time O(nα(n)) and O(n), where n is the number of simplices in the triangulation. If applied to the family of α-shapes of a finite point set in ℝ3 it takes time O(nℝ(n)) to compute the betti numbers of all α-shapes.