The search functionality is under construction.

The search functionality is under construction.

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.

- Publication
- IEICE TRANSACTIONS on Information Vol.E82-D No.7 pp.1093-1100

- Publication Date
- 1999/07/25

- Publicized

- Online ISSN

- DOI

- Type of Manuscript
- PAPER

- Category
- Image Processing,Computer Graphics and Pattern Recognition

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.

Copy

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

Copy

@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},}

Copy

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 -