38 pages, 2 figuresGiven a smooth submanifold of the Euclidean space, a finite point cloud and a scale parameter, we introduce a construction which we call the flat Delaunay complex (FDC). This is a variant of the tangential Delaunay complex (TDC) introduced by Boissonnat et al.. Building on their work, we provide a short and direct proof that when the point cloud samples sufficiently nicely the submanifold and is sufficiently safe (a notion which we define in the paper), our construction is homeomorphic to the submanifold. Because the proof works even when data points are noisy, this allows us to propose a perturbation scheme that takes as input a point cloud sufficiently nice and returns a point cloud which in addition is sufficiently saf...
Computing Delaunay triangulations in $\mathbb{R}^d$ involves evaluating the so-called in\_sphere pre...
We apply ideas from mesh generation to improve the time and space complexities of computing the full...
International audienceIn this paper we consider the problem of optimality in manifold reconstruction...
We give a provably correct algorithm to reconstruct a k-dimensional manifold embedded in d-dimension...
It is a well-established fact that the witness complex is closely related to the restricted Delaunay...
International audienceWe present an algorithm for producing Delaunay triangulations of manifolds. Th...
We present a Delaunay refinement algorithm for meshing a piecewise smooth complex in three dimension...
In this paper, we give the first algorithm that outputs a faithful reconstruction of a submanifold o...
In this thesis we address some of the problems in the field of piecewise linear approxima- tion of k...
We present a novel reconstruction algorithm that, given an input point set sampled from an object S,...
Computing Delaunay triangulations in Rdinvolves evaluating the so-called in\_sphere predicate thatde...
We present a novel reconstruction algorithm that, given an input point set sampled from an object S,...
In this paper, we give the first algorithm that outputs a faithful reconstruction of a submanifold o...
Recently a Delaunay refinement algorithm has been proposed that can mesh domains as general as piece...
Euclidean data complexes are simplicial complexes that have been constructed from a point cloud in E...
Computing Delaunay triangulations in $\mathbb{R}^d$ involves evaluating the so-called in\_sphere pre...
We apply ideas from mesh generation to improve the time and space complexities of computing the full...
International audienceIn this paper we consider the problem of optimality in manifold reconstruction...
We give a provably correct algorithm to reconstruct a k-dimensional manifold embedded in d-dimension...
It is a well-established fact that the witness complex is closely related to the restricted Delaunay...
International audienceWe present an algorithm for producing Delaunay triangulations of manifolds. Th...
We present a Delaunay refinement algorithm for meshing a piecewise smooth complex in three dimension...
In this paper, we give the first algorithm that outputs a faithful reconstruction of a submanifold o...
In this thesis we address some of the problems in the field of piecewise linear approxima- tion of k...
We present a novel reconstruction algorithm that, given an input point set sampled from an object S,...
Computing Delaunay triangulations in Rdinvolves evaluating the so-called in\_sphere predicate thatde...
We present a novel reconstruction algorithm that, given an input point set sampled from an object S,...
In this paper, we give the first algorithm that outputs a faithful reconstruction of a submanifold o...
Recently a Delaunay refinement algorithm has been proposed that can mesh domains as general as piece...
Euclidean data complexes are simplicial complexes that have been constructed from a point cloud in E...
Computing Delaunay triangulations in $\mathbb{R}^d$ involves evaluating the so-called in\_sphere pre...
We apply ideas from mesh generation to improve the time and space complexities of computing the full...
International audienceIn this paper we consider the problem of optimality in manifold reconstruction...