This paper uses the theoretical material developed in a previous article by the authors in order to reconstruct a subclass of 2L-convex polyominoes. The main idea is to control the shape of these polyominoes by combining 4 types of geometries. Some modifications are made in the reconstruction algorithm of Chrobak and Durr for HV -convex polyominoes in order to impose these geometries
AbstractMany problems of computer-aided tomography, pattern recognition, image processing and data c...
Article dans revue scientifique avec comité de lecture.The convexity of a discrete region is a prope...
In 1997 R. Gardner and P. Gritzmann proved a milestone result for uniqueness in Discrete Tomography:...
This paper uses the theoretical material developed in a previous article by the authors in order to ...
A polymino $P$ is called $2L$-convex if for every two cells there exists a monotone path included in...
International audienceA polyomino P is called 2L-convex if for every two cells there exists a monoto...
Several papers in the available literature tackled problems concerning convex polyominoes in discret...
The reconstruction of discrete two-dimensional pictures from their projections is one of the central...
The reconstruction of discrete two-dimensional pictures from their projections is one of the central...
International audienceAbstract A remarkable family of discrete sets which has recently attracted the...
AbstractThe problem of reconstructing a convex polyominoes from its horizontal and vertical projecti...
In the usual aim of discrete tomography, the reconstruction of an unknown discrete set is considered...
In 1997 R. Gardner and P. Gritzmann proved a milestone result for uniqueness in Discrete Tomography:...
AbstractMany problems of computer-aided tomography, pattern recognition, image processing and data c...
Article dans revue scientifique avec comité de lecture.The convexity of a discrete region is a prope...
In 1997 R. Gardner and P. Gritzmann proved a milestone result for uniqueness in Discrete Tomography:...
This paper uses the theoretical material developed in a previous article by the authors in order to ...
A polymino $P$ is called $2L$-convex if for every two cells there exists a monotone path included in...
International audienceA polyomino P is called 2L-convex if for every two cells there exists a monoto...
Several papers in the available literature tackled problems concerning convex polyominoes in discret...
The reconstruction of discrete two-dimensional pictures from their projections is one of the central...
The reconstruction of discrete two-dimensional pictures from their projections is one of the central...
International audienceAbstract A remarkable family of discrete sets which has recently attracted the...
AbstractThe problem of reconstructing a convex polyominoes from its horizontal and vertical projecti...
In the usual aim of discrete tomography, the reconstruction of an unknown discrete set is considered...
In 1997 R. Gardner and P. Gritzmann proved a milestone result for uniqueness in Discrete Tomography:...
AbstractMany problems of computer-aided tomography, pattern recognition, image processing and data c...
Article dans revue scientifique avec comité de lecture.The convexity of a discrete region is a prope...
In 1997 R. Gardner and P. Gritzmann proved a milestone result for uniqueness in Discrete Tomography:...