[图书][B] Advances in discrete tomography and its applications
GT Herman, A Kuba - 2008 - books.google.com
Advances in Discrete Tomography and Its Applications is a unified presentation of new
methods, algorithms, and select applications that are the foundations of multidimensional …
methods, algorithms, and select applications that are the foundations of multidimensional …
The reconstruction of polyominoes from their orthogonal projections
GJ Woeginger - Information Processing Letters, 2001 - Elsevier
The reconstruction of discrete two-dimensional pictures from their projections is one of the
central problems in the areas of medical diagnostics, computer-aided tomography, pattern …
central problems in the areas of medical diagnostics, computer-aided tomography, pattern …
An algorithm reconstructing convex lattice sets
S Brunetti, A Daurat - Theoretical computer science, 2003 - Elsevier
In this paper, we study the problem of reconstructing special lattice sets from X-rays in a
finite set of prescribed directions. We present the class of “Q-convex” sets which is a new …
finite set of prescribed directions. We present the class of “Q-convex” sets which is a new …
Reconstruction of 4-and 8-connected convex discrete sets from row and column projections
S Brunetti, A DelLungo, F DelRistoro, A Kuba… - Linear Algebra and its …, 2001 - Elsevier
In this paper we examine the problem of reconstructing a discrete two-dimensional set from
its two orthogonal projection (H, V) when the set satisfies some convexity conditions. We …
its two orthogonal projection (H, V) when the set satisfies some convexity conditions. We …
Constraint satisfaction problems on specific subsets of the n-dimensional unit cube
L Aslanyan, H Sahakyan, HD Gronau… - … Computer Science and …, 2015 - ieeexplore.ieee.org
Characterization of n-cube subsets is considered in terms of variable frequencies
(differences) or in terms of hypergraphs—their degree sequences. Characterization under …
(differences) or in terms of hypergraphs—their degree sequences. Characterization under …
Application driven inverse type constraint satisfaction problems
YI Zhuravlev, L Aslanyan, VV Ryazanov… - Pattern Recognition and …, 2017 - Springer
Mathematical science in tight integration with the natural and life sciences provide
sophisticated models and algorithms of knowledge acquisition. Overall rapid development of …
sophisticated models and algorithms of knowledge acquisition. Overall rapid development of …
The number of Z-convex polyominoes
E Duchi, S Rinaldi, G Schaeffer - Advances in applied mathematics, 2008 - Elsevier
In this paper we consider a restricted class of polyominoes that we call Z-convex
polyominoes. Z-convex polyominoes are polyominoes such that any two pairs of cells can …
polyominoes. Z-convex polyominoes are polyominoes such that any two pairs of cells can …
Discrete tomography: A historical overview
A Kuba, GT Herman - Discrete tomography: Foundations, algorithms, and …, 1999 - Springer
In this chapter we introduce the topic of discrete tomography and give a brief historical
survey of the relevant contributions. After discussing the nature of the basic theoretical …
survey of the relevant contributions. After discussing the nature of the basic theoretical …
Comparison of algorithms for reconstructing hv-convex discrete sets
E Balogh, A Kuba, C Dévényi, A Del Lungo - Linear Algebra and its …, 2001 - Elsevier
Three reconstruction algorithms to be used for reconstructing hv-convex discrete sets from
their row and column sums are compared. All these algorithms have two versions: one for …
their row and column sums are compared. All these algorithms have two versions: one for …
A multistage view on 2-satisfiability
T Fluschnik - International Conference on Algorithms and …, 2021 - Springer
We study q-SAT in the multistage model, focusing on the linear-time solvable 2-SAT. Herein,
given a sequence of q-CNF formulas and a non-negative integer d, the question is whether …
given a sequence of q-CNF formulas and a non-negative integer d, the question is whether …