Name
Abstract | ||
|---|---|---|
We study the problem of reconstructing finite subsets of the integer lattice Z2 from their approximate X-rays in a finite number of prescribed lattice directions. We provide a polynomial-time algorithm for reconstructing Q-convex sets from their "approximate" X-rays. A Qconvex set is a special subset of Z2 having some convexity properties. This algorithm can be used for reconstructing convex subsets of Z2 from their exact X-rays in some sets of four prescribed lattice directions, or in any set of seven prescribed mutually nonparallel lattice directions. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1007/3-540-44438-6_10 | DGCI |
Keywords | Field | DocType |
approximate x-rays,finite subsets,approximate x-ray,finite number,nonparallel lattice direction,convex subsets,qconvex set,convexity property,polynomial-time algorithm,prescribed lattice direction,special lattice sets,integer lattice,convex set | Discrete mathematics,Combinatorics,Convexity,Finite set,Lattice (order),Algorithm,Regular polygon,Integer lattice,Time complexity,Mathematics | Conference |
Volume | ISSN | ISBN |
1953 | 0302-9743 | 3-540-41396-0 |
Citations | PageRank | References |
3 | 0.51 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sara Brunetti | 1 | 122 | 16.23 |
| Alain Daurat | 2 | 112 | 14.08 |
| Alberto Del Lungo | 3 | 376 | 44.84 |