In this paper, we describe a new algorithm to compute in linear time a 3D planar polygonal curve from a planar digital curve, that is a curve which belongs to a digital plane. Based on this algorithm, we propose a new method for converting the boundary of digital volumetric objects into polygonal meshes which aims at providing a topologically consistent and invertible reconstruction, i.e. the digitization of the ob- tained object is equal to the original digital data. Indeed, we do not want any information to be added or lost. In order to limit the number of generated polygonal faces, our approach is based on the use of digital geometry tools which allow the reconstruction of large pieces of planes
Many applications, manipulation or just visualization of discrete volumes are time consuming proble...
The authors present a graduate iterative merging algorithm for polygon approximation. The algorithm ...
Contour polygonal approximation is usually defined as a set of selected points, which describes a po...
International audienceThis paper tackles the problem of the computation of a planar polygonal curve ...
International audienceReversible polyhedral modelling of discrete objects is an important issue to h...
International audienceInvertible Euclidean reconstruction methods without patches for 2D and 3D disc...
International audienceFrom results about digital convexity, we define a reversible polygon that fait...
International audienceIn this paper, we present a generic topological and geometrical framework whic...
We consider simple digital curves in a 3D orthogonal grid as special polyhedrally bounded sets. The...
International audienceAn invertible Euclidean reconstruction method for a 2D curve is proposed. Hint...
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...
From results about digital convexity, we define a reversible polygon that faith-fully represents the...
AbstractCurve reconstruction algorithms are supposed to reconstruct curves from point samples. Recen...
Contribution à un ouvrage.Decomposition of a digital curve into convex and concave parts is of relev...
Many applications, manipulation or just visualization of discrete volumes are time consuming proble...
The authors present a graduate iterative merging algorithm for polygon approximation. The algorithm ...
Contour polygonal approximation is usually defined as a set of selected points, which describes a po...
International audienceThis paper tackles the problem of the computation of a planar polygonal curve ...
International audienceReversible polyhedral modelling of discrete objects is an important issue to h...
International audienceInvertible Euclidean reconstruction methods without patches for 2D and 3D disc...
International audienceFrom results about digital convexity, we define a reversible polygon that fait...
International audienceIn this paper, we present a generic topological and geometrical framework whic...
We consider simple digital curves in a 3D orthogonal grid as special polyhedrally bounded sets. The...
International audienceAn invertible Euclidean reconstruction method for a 2D curve is proposed. Hint...
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...
From results about digital convexity, we define a reversible polygon that faith-fully represents the...
AbstractCurve reconstruction algorithms are supposed to reconstruct curves from point samples. Recen...
Contribution à un ouvrage.Decomposition of a digital curve into convex and concave parts is of relev...
Many applications, manipulation or just visualization of discrete volumes are time consuming proble...
The authors present a graduate iterative merging algorithm for polygon approximation. The algorithm ...
Contour polygonal approximation is usually defined as a set of selected points, which describes a po...