The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Algoritma yang cekap untuk membina semula semua objek 3D polihedral daripada dua pandangan ortografik dibentangkan. Memandangkan perwakilan ortografik dua pandangan bagi objek 3D adalah samar-samar, ia memerlukan banyak carian gabungan dalam proses pembinaan semula. Juga, beberapa bilangan penyelesaian yang berbeza dengan niat pereka boleh wujud dalam masalah itu. Kertas kerja ini mencadangkan algoritma dua fasa untuk mengurangkan ruang carian dan untuk memilih penyelesaian yang paling munasabah yang diterangkan oleh unjuran yang diberikan. Pertama, objek yang dibina separa dibina semula daripada muka calon terhad yang sepadan dengan setiap kawasan pada lukisan dua pandangan dalam fasa pertamanya. Kemudian objek lengkap diperoleh daripada objek yang dibina separa dengan menambah calon lain yang mempunyai kesahan geometri dalam fasa kedua. Algoritma melakukan carian gabungan berdasarkan peraturan keputusan muka bersama dua heuristik. Peraturan keputusan menyemak kesahan geometri dan peraturan heuristik meningkatkan kelajuan carian. Di samping itu, pembinaan semula mendapati objek 3D yang paling munasabah yang paling mungkin dipilih oleh pemerhati manusia terlebih dahulu di antara pelbagai penyelesaian yang diberikan. Beberapa contoh daripada pelaksanaan kerja diberikan untuk menunjukkan kesempurnaan algoritma.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Tae Jung SUH, Woong Soon KIM, Chang Hun KIM, "Two Phase 3D Object Reconstruction from Two-View Drawings" in IEICE TRANSACTIONS on Information,
vol. E82-D, no. 7, pp. 1093-1100, July 1999, doi: .
Abstract: An efficient algorithm for reconstructing all polyhedral 3D objects from two orthographic views is presented. Since the two-view orthographic representation of a 3D object is ambiguous, it requires a numerous amount of combinatorial searches in the process of reconstruction. Also, multiple number of solutions in contrast to the designers intention can be existed in the problem. This paper proposes a two phase algorithm to reduce the search space and to select the most plausible solution described by the given projections. First, the partially constructed objects are reconstructed from the restricted candidate faces corresponding to each area on the two-view drawings in its first phase. Then the complete objects are obtained from the partially constructed objects by adding other candidates with geometrical validity in the second phase. The algorithm performs a combinatorial search based on the face decision rules along with two heuristics. Decision rules check geometrical validity and heuristic rules enhance the search speed. In addition, the reconstruction finds the most plausible 3D object that human observers are most likely to select first among the given multiple solutions. Several examples from a working implementation are given to show the completeness of the algorithm.
URL: https://global.ieice.org/en_transactions/information/10.1587/e82-d_7_1093/_p
Salinan
@ARTICLE{e82-d_7_1093,
author={Tae Jung SUH, Woong Soon KIM, Chang Hun KIM, },
journal={IEICE TRANSACTIONS on Information},
title={Two Phase 3D Object Reconstruction from Two-View Drawings},
year={1999},
volume={E82-D},
number={7},
pages={1093-1100},
abstract={An efficient algorithm for reconstructing all polyhedral 3D objects from two orthographic views is presented. Since the two-view orthographic representation of a 3D object is ambiguous, it requires a numerous amount of combinatorial searches in the process of reconstruction. Also, multiple number of solutions in contrast to the designers intention can be existed in the problem. This paper proposes a two phase algorithm to reduce the search space and to select the most plausible solution described by the given projections. First, the partially constructed objects are reconstructed from the restricted candidate faces corresponding to each area on the two-view drawings in its first phase. Then the complete objects are obtained from the partially constructed objects by adding other candidates with geometrical validity in the second phase. The algorithm performs a combinatorial search based on the face decision rules along with two heuristics. Decision rules check geometrical validity and heuristic rules enhance the search speed. In addition, the reconstruction finds the most plausible 3D object that human observers are most likely to select first among the given multiple solutions. Several examples from a working implementation are given to show the completeness of the algorithm.},
keywords={},
doi={},
ISSN={},
month={July},}
Salinan
TY - JOUR
TI - Two Phase 3D Object Reconstruction from Two-View Drawings
T2 - IEICE TRANSACTIONS on Information
SP - 1093
EP - 1100
AU - Tae Jung SUH
AU - Woong Soon KIM
AU - Chang Hun KIM
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E82-D
IS - 7
JA - IEICE TRANSACTIONS on Information
Y1 - July 1999
AB - An efficient algorithm for reconstructing all polyhedral 3D objects from two orthographic views is presented. Since the two-view orthographic representation of a 3D object is ambiguous, it requires a numerous amount of combinatorial searches in the process of reconstruction. Also, multiple number of solutions in contrast to the designers intention can be existed in the problem. This paper proposes a two phase algorithm to reduce the search space and to select the most plausible solution described by the given projections. First, the partially constructed objects are reconstructed from the restricted candidate faces corresponding to each area on the two-view drawings in its first phase. Then the complete objects are obtained from the partially constructed objects by adding other candidates with geometrical validity in the second phase. The algorithm performs a combinatorial search based on the face decision rules along with two heuristics. Decision rules check geometrical validity and heuristic rules enhance the search speed. In addition, the reconstruction finds the most plausible 3D object that human observers are most likely to select first among the given multiple solutions. Several examples from a working implementation are given to show the completeness of the algorithm.
ER -