International audienceThis paper deals with the polyhedrization of discrete volumes. The aim is to do a reversibletransformation from a discrete volume to a Euclidean polyhedron, i.e. such that the discretization of theEuclidean volume is exactly the initial discrete volume. We propose a new polynomial algorithm to split thesurface of any discrete volume into pieces of naive discrete planes with well-defined shape properties, andpresent a study of the time complexity as well as a study of the influence of the voxel tracking order duringthe execution of this algorithm
Introduction We present a locality-based algorithm to solve the problem of splitting a complex of c...
International audienceWe propose in this paper a segmentation process that can deal with noisy discr...
In this paper, we describe a new algorithm to compute in linear time a 3D planar polygonal curve fro...
International audienceThis paper deals with the polyhedrization of discrete volumes. The aim is to d...
This paper deals with the polyhedrization of discrete volumes. The aim is to do a reversible transfo...
Many applications, manipulation or just visualization of discrete volumes are time consuming proble...
International audienceThe aim of this article is to present a reversible and topologically correct c...
International audienceReversible polyhedral modelling of discrete objects is an important issue to h...
En imagerie 3d, la polyédrisation est utilisée pour accroître le réalisme et simplifier la représent...
En informatique, les images sont numériques et donc composées de pixels en 2D et de voxels en 3D. Da...
In computer science, pictures are digital and so, they are composed of pixels in 2D or of voxels in ...
We present efficient algorithms for several problems of movable separability in 3-dimensional space....
<p>The paper presents a very straightforward and effective algorithm to convert a space partitioning...
International audienceThis paper is composed of two parts. In the first one, we present an analysis ...
The paper presents a very straightforward and effective algorithm to convert a space partitioning, m...
Introduction We present a locality-based algorithm to solve the problem of splitting a complex of c...
International audienceWe propose in this paper a segmentation process that can deal with noisy discr...
In this paper, we describe a new algorithm to compute in linear time a 3D planar polygonal curve fro...
International audienceThis paper deals with the polyhedrization of discrete volumes. The aim is to d...
This paper deals with the polyhedrization of discrete volumes. The aim is to do a reversible transfo...
Many applications, manipulation or just visualization of discrete volumes are time consuming proble...
International audienceThe aim of this article is to present a reversible and topologically correct c...
International audienceReversible polyhedral modelling of discrete objects is an important issue to h...
En imagerie 3d, la polyédrisation est utilisée pour accroître le réalisme et simplifier la représent...
En informatique, les images sont numériques et donc composées de pixels en 2D et de voxels en 3D. Da...
In computer science, pictures are digital and so, they are composed of pixels in 2D or of voxels in ...
We present efficient algorithms for several problems of movable separability in 3-dimensional space....
<p>The paper presents a very straightforward and effective algorithm to convert a space partitioning...
International audienceThis paper is composed of two parts. In the first one, we present an analysis ...
The paper presents a very straightforward and effective algorithm to convert a space partitioning, m...
Introduction We present a locality-based algorithm to solve the problem of splitting a complex of c...
International audienceWe propose in this paper a segmentation process that can deal with noisy discr...
In this paper, we describe a new algorithm to compute in linear time a 3D planar polygonal curve fro...