International audienceWe give a definition of the Delaunay triangulation of a point set in a closed Euclidean d-manifold, i.e. a compact quotient space of the Euclidean space for a discrete group of isometries (a so-called Bieberbach group or crystallographic group). We describe a geometric criterion to check whether a partition of the manifold actually forms a triangulation (which subsumes that it is a simplicial complex). We provide an incremental algorithm to compute the Delaunay triangulation of the manifold defined by a given set of input points, if it exists. Otherwise, the algorithm returns the Delaunay triangulation of a finite-sheeted covering space of the manifold. The algorithm has optimal randomized worst-case time and space com...
Equipe GPIG de GIPSA-labInternational audienceWe show that the Delaunay triangulation of a set of po...
Even though Delaunay originally introduced his famous triangulations in the case of infinite point s...
We give a provably correct algorithm to reconstruct a k-dimensional manifold embedded in d-dimension...
International audienceWe give a definition of the Delaunay triangulation of a point set in a closed ...
International audienceWe give a definition of the Delaunay triangulation of a point set in a closed ...
International audienceWe present an algorithm for producing Delaunay triangulations of manifolds. Th...
In this paper we propose a new approach to constructing the Delaunay Triangulation and the optimum a...
Intrinsic Delaunay triangulation (IDT) naturally generalizes Delaunay triangulation from R2 to curve...
Computing Delaunay triangulations in $\mathbb{R}^d$ involves evaluating the so-called in\_sphere pre...
We study triangulations of spaces of constant negative curvature -1 from both theoretical and practi...
In this work, we discuss triangulations of different topological spaces for given point sets. We pro...
Abstract. We consider a new construction, the weak Delaunay triangu-lation of a finite point set in ...
In the Euclidean plane, a Delaunay triangulation can be characterized by the requirement that the ci...
Delaunay has shown that the Delaunay complex of a finite set of points of Euclidean space triangulat...
In this work we discuss triangulations of different topological spaces for given point sets. We prop...
Equipe GPIG de GIPSA-labInternational audienceWe show that the Delaunay triangulation of a set of po...
Even though Delaunay originally introduced his famous triangulations in the case of infinite point s...
We give a provably correct algorithm to reconstruct a k-dimensional manifold embedded in d-dimension...
International audienceWe give a definition of the Delaunay triangulation of a point set in a closed ...
International audienceWe give a definition of the Delaunay triangulation of a point set in a closed ...
International audienceWe present an algorithm for producing Delaunay triangulations of manifolds. Th...
In this paper we propose a new approach to constructing the Delaunay Triangulation and the optimum a...
Intrinsic Delaunay triangulation (IDT) naturally generalizes Delaunay triangulation from R2 to curve...
Computing Delaunay triangulations in $\mathbb{R}^d$ involves evaluating the so-called in\_sphere pre...
We study triangulations of spaces of constant negative curvature -1 from both theoretical and practi...
In this work, we discuss triangulations of different topological spaces for given point sets. We pro...
Abstract. We consider a new construction, the weak Delaunay triangu-lation of a finite point set in ...
In the Euclidean plane, a Delaunay triangulation can be characterized by the requirement that the ci...
Delaunay has shown that the Delaunay complex of a finite set of points of Euclidean space triangulat...
In this work we discuss triangulations of different topological spaces for given point sets. We prop...
Equipe GPIG de GIPSA-labInternational audienceWe show that the Delaunay triangulation of a set of po...
Even though Delaunay originally introduced his famous triangulations in the case of infinite point s...
We give a provably correct algorithm to reconstruct a k-dimensional manifold embedded in d-dimension...