Computing homology groups of simplicial complexes in R 3
Authors:
Open Access
- 1 March 1998
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 45 (2) , 266-287
Abstract
Recent developments in analyzing molecular structures and representing solid models using simplicial complexes have further enhanced the need for computing structural information about simplicial complexes in R 3 . This paper develops basic techniques required to manipulate and analyze structures of complexes in R 3 . A new approach to analyze simplicial complexes in Euclidean 3-space R 3 is described. First, methods from topology are used to analyze triangulated 3-manifolds in R 3 . Then, it is shown that these methods can, in fact, be applied to arbitrary simplicial complexes in R 3 after (simulating) the process of thickening a complex to a 3-manifold homotopic to it. As a consequence considerable structural information about the complex can be determined and certain discrete problems solved as well. For example, it is shown how to determine homology groups, as well as concrete representations of their generators, for a given complex in R 3Keywords
This publication has 9 references indexed in Scilit:
- An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphereComputer Aided Geometric Design, 1995
- The union of balls and its dual shapeDiscrete & Computational Geometry, 1995
- Three-dimensional alpha shapesACM Transactions on Graphics, 1994
- A Basic Course in Algebraic Topology1991
- Untangling DNAThe Mathematical Intelligencer, 1990
- Computational Geometry1985
- Classical Topology and Combinatorial Group Theory1980
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer MatrixSIAM Journal on Computing, 1979
- Geometric Topology in Dimensions 2 and 31977