Fast Linking Numbers for Topology Verification of Loopy Structures

by   Ante Qu, et al.

It is increasingly common to model, simulate, and process complex materials based on loopy structures, such as in yarn-level cloth garments, which possess topological constraints between inter-looping curves. While the input model may satisfy specific topological linkages between pairs of closed loops, subsequent processing may violate those topological conditions. In this paper, we explore a family of methods for efficiently computing and verifying linking numbers between closed curves, and apply these to applications in geometry processing, animation, and simulation, so as to verify that topological invariants are preserved during and after processing of the input models. Our method has three stages: (1) we identify potentially interacting loop-loop pairs, then (2) carefully discretize each loop's spline curves into line segments so as to enable (3) efficient linking number evaluation using accelerated kernels based on either counting projected segment-segment crossings, or by evaluating the Gauss linking integral using direct or fast summation methods (Barnes-Hut or fast multipole methods). We evaluate CPU and GPU implementations of these methods on a suite of test problems, including yarn-level cloth and chainmail, that involve significant processing: physics-based relaxation and animation, user-modeled deformations, curve compression and reparameterization. We show that topology errors can be efficiently identified to enable more robust processing of loopy structures.


page 2

page 6

page 7

page 8

page 10

page 11

page 17

page 19


Spiraling and Folding: The Topological View

For every n, we construct two curves in the plane that intersect at leas...

Mode Surfaces of Symmetric Tensor Fields: Topological Analysis and Seamless Extraction

Mode surfaces are the generalization of degenerate curves and neutral su...

Global Topology of 3D Symmetric Tensor Fields

There have been recent advances in the analysis and visualization of 3D ...

A Theory of Topological Derivatives for Inverse Rendering of Geometry

We introduce a theoretical framework for differentiable surface evolutio...

Betti numbers of attention graphs is all you really need

We apply methods of topological analysis to the attention graphs, calcul...

Deciding contractibility of a non-simple curve on the boundary of a 3-manifold: A computational Loop Theorem

We present an algorithm for the following problem. Given a triangulated ...

Please sign up or login with your details

Forgot password? Click here to reset