We quantise Whitney’s construction to prove the existence of a triangulation for any C^2 manifold, so that we get an algorithm with explicit bounds. We also give a new elementary proof, which is completely geometric
Earlier work on Delaunay triangulation of point sets on the 2D flat torus, which is locally isometri...
A full version of the paper is available at [5], http://ramsaydyer.com/tmp/loccrit.pdfWe present cri...
Computing Delaunay triangulations in $\mathbb{R}^d$ involves evaluating the so-called in\_sphere pre...
We quantise Whitney’s construction to prove the existence of a triangulation for any C^2 manifold, s...
International audienceWe quantize Whitney's construction to prove the existence of a triangulation f...
This thesis addresses the manifold meshing problem in arbitrary dimension. Intuitively, suppose we a...
International audienceWe present an algorithm for producing Delaunay triangulations of manifolds. Th...
Algorithms that decompose a manifold into simple pieces reveal the geometric and topological structu...
Cette thèse s’adresse au problème du maillage d’une variété donnée dans une dimension arbitrair...
Coxeter triangulations are triangulations of Euclidean space based on a single simplex. By this we m...
This paper presents a rather simple tracing algorithm to sample and mesh an m-dimensional sub-manifo...
Delaunay has shown that the Delaunay complex of a finite set of points of Euclidean space triangulat...
International audienceWe propose an algorithm to sample and mesh a k-submanifold M of positive reach...
The restricted Delaunay triangulation can be conceived as an operator that takes as input a k-manifo...
The CGAL library offers software packages to compute Delaunay triangulations of the (flat) torus of ...
Earlier work on Delaunay triangulation of point sets on the 2D flat torus, which is locally isometri...
A full version of the paper is available at [5], http://ramsaydyer.com/tmp/loccrit.pdfWe present cri...
Computing Delaunay triangulations in $\mathbb{R}^d$ involves evaluating the so-called in\_sphere pre...
We quantise Whitney’s construction to prove the existence of a triangulation for any C^2 manifold, s...
International audienceWe quantize Whitney's construction to prove the existence of a triangulation f...
This thesis addresses the manifold meshing problem in arbitrary dimension. Intuitively, suppose we a...
International audienceWe present an algorithm for producing Delaunay triangulations of manifolds. Th...
Algorithms that decompose a manifold into simple pieces reveal the geometric and topological structu...
Cette thèse s’adresse au problème du maillage d’une variété donnée dans une dimension arbitrair...
Coxeter triangulations are triangulations of Euclidean space based on a single simplex. By this we m...
This paper presents a rather simple tracing algorithm to sample and mesh an m-dimensional sub-manifo...
Delaunay has shown that the Delaunay complex of a finite set of points of Euclidean space triangulat...
International audienceWe propose an algorithm to sample and mesh a k-submanifold M of positive reach...
The restricted Delaunay triangulation can be conceived as an operator that takes as input a k-manifo...
The CGAL library offers software packages to compute Delaunay triangulations of the (flat) torus of ...
Earlier work on Delaunay triangulation of point sets on the 2D flat torus, which is locally isometri...
A full version of the paper is available at [5], http://ramsaydyer.com/tmp/loccrit.pdfWe present cri...
Computing Delaunay triangulations in $\mathbb{R}^d$ involves evaluating the so-called in\_sphere pre...
DOI
Add to ORKG