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
É apresentado um algoritmo eficiente para reconstruir todos os objetos 3D poliédricos a partir de duas vistas ortográficas. Como a representação ortográfica de duas vistas de um objeto 3D é ambígua, ela requer uma grande quantidade de pesquisas combinatórias no processo de reconstrução. Além disso, podem existir no problema vários números de soluções em contraste com a intenção do designer. Este artigo propõe um algoritmo de duas fases para reduzir o espaço de busca e selecionar a solução mais plausível descrita pelas projeções dadas. Primeiro, os objetos parcialmente construídos são reconstruídos a partir das faces candidatas restritas correspondentes a cada área nos desenhos de duas vistas na sua primeira fase. Em seguida, os objetos completos são obtidos a partir dos objetos parcialmente construídos, adicionando outros candidatos com validade geométrica na segunda fase. O algoritmo realiza uma busca combinatória baseada nas regras de decisão facial juntamente com duas heurísticas. As regras de decisão verificam a validade geométrica e as regras heurísticas aumentam a velocidade de busca. Além disso, a reconstrução encontra o objeto 3D mais plausível que os observadores humanos provavelmente selecionarão primeiro entre as múltiplas soluções fornecidas. Vários exemplos de uma implementação funcional são fornecidos para mostrar a integridade do algoritmo.
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.
Copiar
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
Copiar
@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},}
Copiar
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 -