An iterative algorithm for homology computation on simplicial shapes
Computer-Aided Design(2011)
摘要
We propose a new iterative algorithm for computing the homology of arbitrary shapes discretized through simplicial complexes. We demonstrate how the simplicial homology of a shape can be effectively expressed in terms of the homology of its sub-components. The proposed algorithm retrieves the complete homological information of an input shape including the Betti numbers, the torsion coefficients and the representative homology generators.
更多查看译文
关键词
Computational topology,Simplicial complexes,Shape decomposition,Z-homology,Mayer–Vietoris sequence,Generators
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要