Fast Filling Operations Used in the Reconstruction of Convex Lattice Sets

DOI10.1007/11907350_9zbMath1136.68557OpenAlexW1516160864MaRDI QIDQ5386013

Sara Brunetti, Attila Kuba, Alain Daurat

Publication date: 17 April 2008

Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11907350_9

zbMATH Keywords

ConvexityDiscrete TomographyFilling Operations

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Polyominoes (05B50)

Related Items (5)

Reconstruction of Convex Sets from One or Two X-rays ⋮ Regular switching components ⋮ A framework for generating some discrete sets with disjoint components by using uniform distributions ⋮ Reconstruction of convex lattice sets from tomographic projections in quartic time ⋮ Further steps on the reconstruction of convex polyominoes from orthogonal projections

This page was built for publication: Fast Filling Operations Used in the Reconstruction of Convex Lattice Sets