On the complexity of computing the homology type of a triangulation

An algorithm for computing the homology type of a triangulation is analyzed. By triangulation is meant a finite simplicial complex; its homology type is given by its homology groups (with integer coefficients). The algorithm could be used in computer-aided design to tell whether two finite-element meshes or Bezier-spline surfaces are of the same topological type, and whether they can be embedded in R/sup 3/. Homology computation is a pure combinatorial problem of considerable intrinsic interest. While the worst-case bounds obtained for this algorithm are poor, it is argued that many triangulations (in general) and virtually all triangulations in design are very sparse in a particular sense. This sparseness measure is formalized, and a probabilistic analysis of the sparse case is performed to show that the expected running time, of the algorithm is roughly quadratic in the geometric complexity (number of simplices) and linear in the dimension.<<ETX>>

[1]  Ravi Kannan,et al.  Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix , 1979, SIAM J. Comput..

[2]  H. Seifert,et al.  Lehrbuch der Topologie , 1934 .

[3]  Henry J. Stephen Smith,et al.  XV. On systems of linear indeterminate equations and congruences , 1861, Philosophical Transactions of the Royal Society of London.

[4]  George E. Collins,et al.  Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .

[5]  George E. Collins,et al.  Algorithms for the Solution of Systems of Linear Diophantine Equations , 1982, SIAM J. Comput..

[6]  Edgar H. Brown,et al.  FINITE COMPUTABILITY OF POSTNIKOV COMPLEXES , 1957 .

[7]  Chee-Keng Yap,et al.  Algebraic cell decomposition in NC , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[8]  Derek F. Holt,et al.  The Mechanical Computation of First and Second Cohomology Groups , 1985, J. Symb. Comput..

[9]  Costas S. Iliopoulos.  Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Infinite Abelian Groups and Solving Systems of Linear Diophantine Equations , 1989, SIAM J. Comput..

[10]  J. Schwartz,et al.  On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

[11]  Chee-Keng Yap,et al.  Computational complexity of combinatorial surfaces , 1990, SCG '90.

[12]  H. Whitney.  Elementary Structure of Real Algebraic Varieties , 1957 .

[13]  Bruce Randall Donald,et al.  On Computing the Homology Type of a Triangulation , 1990 .

[14]  Costas S. Iliopoulos,et al.  Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix , 1989, SIAM J. Comput..

[15]  Wolfgang Haken,et al.  On Recursively Unsolvable Problems in Topology and Their Classification , 1968 .

[16]  Paul David Domich.  Residual methods for computing hermite and smith normal forms (congruence, determinant, sparsity) , 1985 .