International audienceAn invertible Euclidean reconstruction method for a 2D curve is proposed. Hints on an extension to 3D are provided. The framework of this method is the discrete analytical geometry. The reconstruction result is more compact than classical methods such as the Marching Cubes. The notions of discrete cups and patches are introduced. patches are introduced
LNCS v. 6454 is Proceedings of the 6th International Symposium, ISVC 2010, pt. 2In this paper, we pr...
Several geometric criteria to fit a polygonal closed curve to discrete two-dimensional data are cons...
The issues involved in the reconstruction of a quadratic curve in 3-D space from arbitrary perspecti...
International audienceInvertible Euclidean reconstruction methods without patches for 2D and 3D disc...
In this paper, we describe a new algorithm to compute in linear time a 3D planar polygonal curve fro...
International audienceOn the classical discrete grid, the analysis of digital straight lines (DSL fo...
International audienceIn this paper, we present a generic topological and geometrical framework whic...
In this paper, we propose an algorithm for doing reconstruction of general 3D-curves from a number o...
International audienceThe approximation of implicit planar curves by line segments is a very classic...
International audienceReversible polyhedral modelling of discrete objects is an important issue to h...
We present an algorithm that provably recon� structs a curve in the framework introduced by Amenta �...
Colloque avec actes et comité de lecture. internationale.International audienceIn this paper, we add...
Curve reconstruction algorithms are supposed to reconstruct curves from point samples. Recent papers...
Curve reconstruction algorithms are supposed to reconstruct curves from point samples. Recent papers...
This thesis deals with the problems of structuring and processing discrete data, organized or not. I...
LNCS v. 6454 is Proceedings of the 6th International Symposium, ISVC 2010, pt. 2In this paper, we pr...
Several geometric criteria to fit a polygonal closed curve to discrete two-dimensional data are cons...
The issues involved in the reconstruction of a quadratic curve in 3-D space from arbitrary perspecti...
International audienceInvertible Euclidean reconstruction methods without patches for 2D and 3D disc...
In this paper, we describe a new algorithm to compute in linear time a 3D planar polygonal curve fro...
International audienceOn the classical discrete grid, the analysis of digital straight lines (DSL fo...
International audienceIn this paper, we present a generic topological and geometrical framework whic...
In this paper, we propose an algorithm for doing reconstruction of general 3D-curves from a number o...
International audienceThe approximation of implicit planar curves by line segments is a very classic...
International audienceReversible polyhedral modelling of discrete objects is an important issue to h...
We present an algorithm that provably recon� structs a curve in the framework introduced by Amenta �...
Colloque avec actes et comité de lecture. internationale.International audienceIn this paper, we add...
Curve reconstruction algorithms are supposed to reconstruct curves from point samples. Recent papers...
Curve reconstruction algorithms are supposed to reconstruct curves from point samples. Recent papers...
This thesis deals with the problems of structuring and processing discrete data, organized or not. I...
LNCS v. 6454 is Proceedings of the 6th International Symposium, ISVC 2010, pt. 2In this paper, we pr...
Several geometric criteria to fit a polygonal closed curve to discrete two-dimensional data are cons...
The issues involved in the reconstruction of a quadratic curve in 3-D space from arbitrary perspecti...