Computing Linking Numbers of a Filtration

We develop fast algorithms for computing the linking number of a simplicial complex within a filtration. We give experimental results in applying our work toward the detection of non-trivial tangling in biomolecules, modeled as alpha complexes. Keywords. Computational geometry and topology, knots, linking number, three-manifolds, filtrations, alpha shapes, algorithms.

• Type: Conference
• Year: 2001
• Where: WABI
• Authors: Herbert Edelsbrunner, Afra Zomorodian
• Keywords: Bioinformatics, Fast Algorithms, Linking Number, Non-trivial Tangling, WABI 2001