3 citations · 3 across the 2 of their papers we have counts for
5 papers
Computing the Intrinsic Delaunay Triangulation of a Closed Polyhedral Surface
Loïc Dubois
Every surface that is intrinsically polyhedral can be represented by a portalgon: a collection of polygons in the Euclidean plane with some pairs of equally long edges abstractly i…
A Discrete Analog of Tutte's Barycentric Embeddings on Surfaces
Éric Colin de Verdière, Vincent Despré, Loïc Dubois
Tutte's celebrated barycentric embedding theorem describes a natural way to build straight-line embeddings (crossing-free drawings) of a (3-connected) planar graph: map the vertice…
Making Multicurves Cross Minimally on Surfaces
Loïc Dubois
On an orientable surface , consider a collection of closed curves. The (geometric) intersection number is the minimum number of self-intersections that a collection…
Untangling Graphs on Surfaces
Éric Colin de Verdière, Vincent Despré, Loïc Dubois
Consider a graph drawn on a surface (for example, the plane minus a finite set of obstacle points), possibly with crossings. We provide an algorithm to decide whether such a drawin…
Two lower bounds for -centered colorings
Loïc Dubois, Gwenaël Joret, Guillem Perarnau +2
Given a graph and an integer , a coloring is \emph{-centered} if for every connected subgraph of , either uses more than colors o…