Paper Info
Title
On the number of hv-convex discrete sets
Abstract
One of the basic problems in discrete tomography is the reconstruction of discrete sets from few projections. Assuming that the set to be reconstructed fulfills some geometrical properties is a commonly used technique to reduce the number of possibly many different solutions of the same reconstruction problem. The class of hv-convex discrete sets and its subclasses have a well-developed theory. Several reconstruction algorithms as well as some complexity results are known for those classes. The key to achieve polynomial-time reconstruction of an hv-convex discrete set is to have the additional assumption that the set is connected as well. This paper collects several statistics on hv-convex discrete sets, which are of great importance in the analysis of algorithms for reconstructing such kind of discrete sets.
Year
DOI
Venue
2008
10.1007/978-3-540-78275-9_10
IWCIA
Keywords
Field
DocType
reconstruction algorithm,additional assumption,reconstruction problem,discrete set,complexity result,different solution,basic problem,discrete tomography,polynomial-time reconstruction,hv-convex discrete set,polynomial time,development theory
Social connectedness,Mathematical optimization,Reconstruction problem,Computer science,Discrete tomography,Discrete optimization,Analysis of algorithms,Regular polygon,Discrete system,Discrete measure
Conference
Volume
ISSN
ISBN
4958
0302-9743
3-540-78274-5
Citations 
PageRank 
References 
4
0.56
12
Authors
1
Name
Order
Citations
PageRank
Péter Balázs1318.25