References of "despré, vincent"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailFlipping Geometric Triangulations on Hyperbolic Surfaces
Despré, vincent; Schlenker, Jean-Marc UL; Teillaud, Monique

in symposium on computational geometry (SoCG) (2020)

We consider geometric triangulations of surfaces, i.e., triangulations whose edges can be realized by disjoint locally geodesic segments. We prove that the flip graph of geometric triangulations with ... [more ▼]

We consider geometric triangulations of surfaces, i.e., triangulations whose edges can be realized by disjoint locally geodesic segments. We prove that the flip graph of geometric triangulations with fixed vertices of a flat torus or a closed hyperbolic surface is connected. We give upper bounds on the number of edge flips that are necessary to transform any geometric triangulation on such a surface into a Delaunay triangulation. [less ▲]

Detailed reference viewed: 34 (2 UL)
Full Text
See detailDelaunay Triangulations of Points on Circles
despré, vincent; devillers, olivier; Parlier, Hugo UL et al

E-print/Working paper (2018)

Delaunay triangulations of a point set in the Euclidean plane are ubiquitous in a number of computational sciences, including computational geometry. Delaunay triangulations are not well defined as soon ... [more ▼]

Delaunay triangulations of a point set in the Euclidean plane are ubiquitous in a number of computational sciences, including computational geometry. Delaunay triangulations are not well defined as soon as 4 or more points are concyclic but since it is not a generic situation, this difficulty is usually handled by using a (symbolic or explicit) perturbation. As an alternative, we propose to define a canonical triangulation for a set of concyclic points by using a max-min angle characterization of Delaunay triangulations. This point of view leads to a well defined and unique triangulation as long as there are no symmetric quadruples of points. This unique triangulation can be computed in quasi-linear time by a very simple algorithm. [less ▲]

Detailed reference viewed: 82 (10 UL)