activity
20182021
most citedThe Simplex Tree: an Efficient Data Structure for General Simplicial Complexes

68 citations · 74 across the 4 of their papers we have counts for

collaborators

8 papers

math.GT2021

Hard Diagrams of the Unknot

Benjamin A. Burton, Hsien-Chih Chang, Maarten Löffler +5

We present three "hard" diagrams of the unknot. They require (at least) three extra crossings before they can be simplified to the trivial unknot diagram via Reidemeister moves in…

cs.CG2020

Computation of Large Asymptotics of 3-Manifold Quantum Invariants

Clément Maria, Owen Rouillé

Quantum topological invariants have played an important role in computational topology, and they are at the heart of major modern mathematical conjectures. In this article, we stud…

cs.CG20204 cited

Computing Persistent Homology with Various Coefficient Fields in a Single Pass

Jean-Daniel Boissonnat, Clément Maria

This article introduces an algorithm to compute the persistent homology of a filtered complex with various coefficient fields in a single matrix reduction. The algorithm is output-…

cs.CG202068 cited

The Simplex Tree: an Efficient Data Structure for General Simplicial Complexes

Jean-Daniel Boissonnat, Clément Maria

This paper introduces a data structure, called simplex tree, to represent abstract simplicial complexes of any dimension. All faces of the simplicial complex are explicitly stored…

math.AT2019

Intrinsic Topological Transforms via the Distance Kernel Embedding

Clément Maria, Steve Oudot, Elchanan Solomon

Topological transforms are parametrized families of topological invariants, which, by analogy with transforms in signal processing, are much more discriminative than single measure…

math.GT20192 cited

Parameterized complexity of quantum invariants

Clément Maria

We give a general fixed parameter tractable algorithm to compute quantum invariants of links presented by diagrams, whose complexity is singly exponential in the carving-width (or…