5 citations · 8 across the 5 of their papers we have counts for
8 papers
The Hyperbolic Surface Distance, Diameter, and Dirichlet Problems
Vincent Despre, Auguste Gezalyan, Marc Pouget
Despite the prominence of hyperbolic surfaces in mathematics, basic algorithmic questions about them, even computing the distance between two points, have remained open, leaving ma…
NeuralParker: A Reinforcement Learning Planner for Irregular Parking Environments
Zihan Wang, Bai Huang, Yang Guan +4
Automated parking commonly assumes marked slots and short approach maneuvers. Delivery and service vehicles, however, may need to reach an operator-specified pose in an irregular b…
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…
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…
Systoles and diameters of hyperbolic surfaces
Florent Balacheff, Vincent Despré, Hugo Parlier
In this article we explore the relationship between the systole and the diameter of closed hyperbolic orientable surfaces. We show that they satisfy a certain inequality, which can…
Computing the Geometric Intersection Number of Curves
Vincent Despré, Francis Lazarus
The geometric intersection number of a curve on a surface is the minimal number of self-intersections of any homotopic curve, i.e. of any curve obtained by continuous deformation.…
Some Triangulated Surfaces without Balanced Splitting
Vincent Despré, Francis Lazarus
Let G be the graph of a triangulated surface of genus . A cycle of G is splitting if it cuts into two components, neither of which is homeomorphic to a disk. A spl…
Encoding toroidal triangulations
Vincent Despré, Daniel Gonçalves, Benjamin Lévêque
Poulalhon and Schaeffer introduced an elegant method to linearly encode a planar triangulation optimally. The method is based on performing a special depth-first search algorithm o…