Abstract
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. This paper presents an efficient algorithm for reconstructing polyhedral 3D objects from two-view drawings. The main feature of the algorithm is to improve the reconstruction process speed. First, the partially constructed objects are reconstructed from the restricted candidate faces corresponding to each area on the two-view drawings. Then the complete objects are obtained from the partially constructed objects by adding perpendicular faces with geometrical validity. By limiting the number of candidate faces corresponding to areas only, the combinatorial search space can be considerably reduced. 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 demonstrate the completeness of the algorithm.
| Original language | English |
|---|---|
| Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Publisher | Springer Verlag |
| Pages | 241-248 |
| Number of pages | 8 |
| Volume | 1352 |
| ISBN (Print) | 3540639314, 9783540639312 |
| Publication status | Published - 1997 |
| Event | 3rd Asian Conference on Computer Vision, ACCV 1998 - Hong Kong, Hong Kong Duration: 1998 Jan 8 → 1998 Jan 10 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 1352 |
| ISSN (Print) | 03029743 |
| ISSN (Electronic) | 16113349 |
Other
| Other | 3rd Asian Conference on Computer Vision, ACCV 1998 |
|---|---|
| Country | Hong Kong |
| City | Hong Kong |
| Period | 98/1/8 → 98/1/10 |
Fingerprint
ASJC Scopus subject areas
- Computer Science(all)
- Theoretical Computer Science
Cite this
Reconstruction of non-manifold objects from two orthographic views. / Kim, Chang-Hun; Suh, Tae Jung.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1352 Springer Verlag, 1997. p. 241-248 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1352).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Reconstruction of non-manifold objects from two orthographic views
AU - Kim, Chang-Hun
AU - Suh, Tae Jung
PY - 1997
Y1 - 1997
N2 - 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. This paper presents an efficient algorithm for reconstructing polyhedral 3D objects from two-view drawings. The main feature of the algorithm is to improve the reconstruction process speed. First, the partially constructed objects are reconstructed from the restricted candidate faces corresponding to each area on the two-view drawings. Then the complete objects are obtained from the partially constructed objects by adding perpendicular faces with geometrical validity. By limiting the number of candidate faces corresponding to areas only, the combinatorial search space can be considerably reduced. 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 demonstrate the completeness of the algorithm.
AB - 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. This paper presents an efficient algorithm for reconstructing polyhedral 3D objects from two-view drawings. The main feature of the algorithm is to improve the reconstruction process speed. First, the partially constructed objects are reconstructed from the restricted candidate faces corresponding to each area on the two-view drawings. Then the complete objects are obtained from the partially constructed objects by adding perpendicular faces with geometrical validity. By limiting the number of candidate faces corresponding to areas only, the combinatorial search space can be considerably reduced. 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 demonstrate the completeness of the algorithm.
UR - http://www.scopus.com/inward/record.url?scp=84947585271&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84947585271&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84947585271
SN - 3540639314
SN - 9783540639312
VL - 1352
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 241
EP - 248
BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PB - Springer Verlag
ER -