6 citations · 10 across the 12 of their papers we have counts for
Showing cs.CGShow all
3 papers · 1 filter
cs.CG2023
Degenerate crossing number and signed reversal distance
Niloufar Fuladi, Alfredo Hubard, Arnaud de Mesmay
Given a graph drawn in the plane, the degenerate crossing number of the drawing is the number of points in the plane which are contained in the relative interior of at least two ed…
cs.CG2023★ 1 cited
A Structural Approach to Tree Decompositions of Knots and Spatial Graphs
Corentin Lunel, Arnaud de Mesmay
Knots are commonly represented and manipulated via diagrams, which are decorated planar graphs. When such a knot diagram has low treewidth, parameterized graph algorithms can be le…
cs.CG2022
Finding Weakly Simple Closed Quasigeodesics on Polyhedral Spheres
Jean Chartier, Arnaud de Mesmay
A closed quasigeodesic on a convex polyhedron is a closed curve that is locally straight outside of the vertices, where it forms an angle at most on both sides. While the exist…