Switching Graphs and Digraphs Associated with Total Reconstructed Sets from Two Projection Data

この論文をさがす

説明

application/pdf

紀要論文

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 modifications of switching components. We let this structure correspond a graph or a digraph. Our primary aim is to overview the origin of complexity of non-uniqueness of the reconstruction, and to obtain way to a good solution. But the results are interesting also as a new source of examples of graphs.

収録刊行物

詳細情報 詳細情報について

問題の指摘

ページトップへ