International audienceThis paper tackles the problem of the computation of a planar polygonal curve from a digital planar curve, such that the digital data can be exactly retrieved from the polygonal curve. The proposed transformation also provides an analytical modelling of a digital plane segment as a discrete polygon composed of a face, edges and vertices. A dual space representation of lines and planes is used to ensure that the computed curve remains inside the digital curve, and this tool enables to define a very efficient algorithm. Applied on the digital plane segments resulting from thedecomposition of a digital surface, this algorithm provides a set of polygons modelling exactly the digital surface
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...
The paper describes and explains the computational geometry method that simulates the physical model...
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...
In this paper, we describe a new algorithm to compute in linear time a 3D planar polygonal curve fro...
From results about digital convexity, we define a reversible polygon that faith-fully represents the...
International audienceFrom results about digital convexity, we define a reversible polygon that fait...
International audienceInvertible Euclidean reconstruction methods without patches for 2D and 3D disc...
Contribution à un ouvrage.Decomposition of a digital curve into convex and concave parts is of relev...
In this paper, we propose a quick threshold-free algorithm, which computes the angular shape of a 2D...
International audienceIn this paper, we present a generic topological and geometrical framework whic...
International audienceOn the classical discrete grid, the analysis of digital straight lines (DSL fo...
We consider simple digital curves in a 3D orthogonal grid as special polyhedrally bounded sets. The...
We present a method for segmenting a planar digital curve into line segments and circular arcs. It i...
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...
The paper describes and explains the computational geometry method that simulates the physical model...
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...
In this paper, we describe a new algorithm to compute in linear time a 3D planar polygonal curve fro...
From results about digital convexity, we define a reversible polygon that faith-fully represents the...
International audienceFrom results about digital convexity, we define a reversible polygon that fait...
International audienceInvertible Euclidean reconstruction methods without patches for 2D and 3D disc...
Contribution à un ouvrage.Decomposition of a digital curve into convex and concave parts is of relev...
In this paper, we propose a quick threshold-free algorithm, which computes the angular shape of a 2D...
International audienceIn this paper, we present a generic topological and geometrical framework whic...
International audienceOn the classical discrete grid, the analysis of digital straight lines (DSL fo...
We consider simple digital curves in a 3D orthogonal grid as special polyhedrally bounded sets. The...
We present a method for segmenting a planar digital curve into line segments and circular arcs. It i...
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...
The paper describes and explains the computational geometry method that simulates the physical model...