Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9514627 | Electronic Notes in Discrete Mathematics | 2005 | 20 Pages |
Abstract
We discuss the structure of the total reconstructed sets from given two projections of a plane figure. In case uniqueness does not hold, we have many solutions which are related among them via exchange of switching pair. We let this structure correspond a graph, named switching graph. Through this consideration we might overview the origin of complexity of non-uniqueness of the reconstruction, and the way to obtain good reconstruction. We present some such results toward this direction.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Akira Kaneko, Rina Nagahama,