Name
Title | ||
|---|---|---|
Reconstruction of Canonical hv-Convex Discrete Sets from Horizontal and Vertical Projections |
Abstract | ||
|---|---|---|
The problem of reconstructing some special hv -convex discrete sets from their two orthogonal projections is considered. In general, the problem is known to be NP-hard, but it is solvable in polynomial time if the discrete set to be reconstructed is also 8-connected. In this paper, we define an intermediate class --- the class of hv -convex canonical discrete sets --- and give a constructive proof that the above problem remains computationally tractable for this class, too. We also discuss some further theoretical consequences and present experimental results as well. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-10210-3_22 | IWCIA |
Keywords | Field | DocType |
computationally tractable,special hv,discrete set,constructive proof,intermediate class,present experimental result,polynomial time,orthogonal projection,vertical projections,convex discrete set,convex canonical discrete set,reconstruction | Constructive proof,Horizontal and vertical,Mathematical optimization,Discrete tomography,Regular polygon,Time complexity,Mathematics | Conference |
Volume | ISSN | Citations |
5852 | 0302-9743 | 6 |
PageRank | References | Authors |
0.49 | 8 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Péter Balázs | 1 | 31 | 8.25 |