Result: Fast filling operations used in the reconstruction of convex lattice sets

Title:
Fast filling operations used in the reconstruction of convex lattice sets
Authors:
BRUNETTI, Sara, DAURAT, Alain, KUBA, Attila
Source:
Discrete geometry for computer imagery (13th International conference, DGCI 2006, Szeged, Hungary, October 25-27, 2006)0DGCI 2006. :98-109
Publisher Information:
Berlin; Heidelberg; New York: Springer, 2006.
Publication Year:
2006
Physical Description:
print, 14 ref 1
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Intelligence artificielle, Artificial intelligence, Reconnaissance des formes. Traitement numérique des images. Géométrie algorithmique, Pattern recognition. Digital image processing. Computational geometry, Complexité algorithme, Algorithm complexity, Complejidad algoritmo, Complexité temps, Time complexity, Complejidad tiempo, Convexité, Convexity, Convexidad, Ensemble convexe, Convex set, Conjunto convexo, Géométrie algorithmique, Computational geometry, Geometría computacional, Géométrie discrète, Discrete geometry, Geometría discreta, Pavage, Tiling, Polygone convexe, Convex polygon, Polígono convexo, Remplissage, Filling, Relleno, Réseau arithmétique, Integer lattice, Red aritmética, Tomographie, Tomography, Tomografía, Traitement image, Image processing, Procesamiento imagen, Treillis, Lattice, Enrejado, Contrainte ensembliste, Set constraint, Constreñimiento conjunto
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Dipartimento di Scienze Matematiche e Informatiche, Università di Siena, Pian dei Mantellini 44, 53100, Siena, Italy
LSIIT CNRS UMR 7005, Université Louis Pasteur (Strasbourg 1), Pôle API, Boulevard Sébastien Brant, 67400 Illkirch -Graffenstaden, France
Department of Image Processing and Computer Graphics, University of Szeged, Árpád tér 2, 6720 Szeged, Hungary
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=19150491
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.19150491
Database:
PASCAL Archive

Further Information

Filling operations are procedures which are used in Discrete Tomography for the reconstruction of lattice sets having some convexity constraints. In [1], an algorithm which performs four of these filling operations has a time complexity of O(N2 log N), where N is the size of projections, and leads to a reconstruction algorithm for convex polyominoes running in O(N6 log N)-time. In this paper we first improve the implementation of these four filling operations to a time complexity of O(N2), and additionally we provide an implementation of a fifth filling operation (introduced in [2]) in O(N2 log N) that permits to decrease the overall time-complexity of the reconstruction algorithm to O(N4 log N). More generally, the reconstruction of Q-convex sets and convex lattice sets (intersection of a convex polygon with Z2) can be done in O(N4 log N)-time.