论文信息 - Computing homology groups of simplicial complexes in R3

Computing homology groups of simplicial complexes in R3

Recent developments in analyzing molecular structures and representing solid models using simplicial complexes have further enhanced the need for computing structural information about simplicial c...

K DeyTamal | GuhaSumanta

[1] J. Stillwell. Classical topology and combinatorial group theory , 1980 .

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

[3] E. Moise. Geometric Topology in Dimensions 2 and 3 , 1977 .

[4] J. Friedman,et al. Computing Betti Numbers via Combinatorial Laplacians , 1996, STOC '96.

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

[6] James R. Munkres,et al. Elements of algebraic topology , 1984 .

[7] Tamal K. Dey,et al. Optimal algorithms for curves on surfaces , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[8] Herbert Edelsbrunner,et al. On the Definition and the Construction of Pockets in Macromolecules , 1998, Discret. Appl. Math..

[9] W. Massey. A basic course in algebraic topology , 1991 .

[10] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .

[11] Herbert Edelsbrunner,et al. Modeling with Simplicial Complexes , 1994, Canadian Conference on Computational Geometry.