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.
収録刊行物
-
- お茶の水女子大學自然科學報告
-
お茶の水女子大學自然科學報告 56 (2), 33-45, 2006-01
お茶の水女子大学
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1050282677926744960
-
- NII論文ID
- 110006559627
-
- NII書誌ID
- AN00033958
-
- ISSN
- 00298190
-
- HANDLE
- 10083/2395
-
- NDL書誌ID
- 7954600
-
- 本文言語コード
- en
-
- 資料種別
- departmental bulletin paper
-
- データソース種別
-
- IRDB
- NDLサーチ
- CiNii Articles