Decomposition Algorithms for Reconstructing Discrete Sets with Disjoint Components
Publisher
Birkhäuser Boston
Reference18 articles.
1. Balazs, P.: A decomposition technique for reconstructing discrete sets from four projections. Image and Vision Computing, submitted.
2. Balázs, P.: Reconstruction of discrete sets from four projections: Strong decomposability. Electr. Notes Discr. Math., 20, 329–345 (2005).
3. Balazs, P., Balogh, E., Kuba, A.: Reconstruction of 8-connected but not 4-connected hv-convex discrete sets. Discr. Appl. Math., 147, 149–168 (2005).
4. Balogh, E., Kuba, A., Dévényi, C., Del Lungo, A.: Comparison of algorithms for reconstructing hv-convex discrete sets. Lin. Algebra Appl. 339, 23–35 (2001).
5. Barcucci, E., Del Lungo, A., Nivat, M., Pinzani, R.: Reconstructing convex polyominoes from horizontal and vertical projections. Theor. Comput. Sci., 155, 321–347 (1996).