Computing Linking Numbers of a Filtration

Authors:
Herbert Edelsbrunner;Afra Zomorodian
Affiliations:
-;-
Venue:
WABI '01 Proceedings of the First International Workshop on Algorithms in Bioinformatics
Year:
2001

Citing 6
Cited 0

Fast algorithms for finding nearest common ancestors

SIAM Journal on Computing
Introduction to algorithms

Introduction to algorithms
Three-dimensional alpha shapes

ACM Transactions on Graphics (TOG)
An incremental algorithm for Betti numbers of simplicial complexes on the 3-spheres

Computer Aided Geometric Design - Special issue on grid generation, finite elements, and geometric design
The computational complexity of knot and link problems

Journal of the ACM (JACM)
Topological persistence and simplification

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.