A rigorous numerical algorithm for computing the linking number of links

Abstract

We propose a rigorous numerical algorithm for computing the linking number of links defined by spatially distributed data points. The key idea is to use an analytic expression for the solid angle of a tetrahedron for quick evaluation of the degree of the Gauss map. An implementation of the algorithm with INTLAB, a Matlab toolbox for reliable computing, is also provided.