完整後設資料紀錄
DC 欄位語言
dc.contributor.authorCHEN, Zen_US
dc.contributor.authorPERNG, DBen_US
dc.contributor.authorCHEN, CJen_US
dc.contributor.authorWU, CSen_US
dc.date.accessioned2014-12-08T15:05:02Z-
dc.date.available2014-12-08T15:05:02Z-
dc.date.issued1992-01-01en_US
dc.identifier.issn0951-192Xen_US
dc.identifier.urihttp://dx.doi.org/10.1080/095119X9208547560en_US
dc.identifier.urihttp://hdl.handle.net/11536/3561-
dc.description.abstractA fast algorithm for 3D part reconstruction from a 3-view drawing is presented. A set of rules are specified to facilitate the part reconstruction. The main idea is to use the rules to determine the truth or falsity of 3D faces and the coexistence or non-coexistence relationships between 3D faces. In a graph search formulation of the reconstruction problem, these rules can reduce remarkably (a) the graph search space, (b) the occurrence of backtracking in the search and (c) the branching factor of the tree expansion. We shall present our method with illustrations. Currently we limit the type of part to be plane-faced for presentation simplicity, although we are extending our method to cover the cylindrical parts, too. Experimental results indicate the set of rules is useful and our reconstruction method is very effective.en_US
dc.language.isoen_USen_US
dc.titleFAST RECONSTRUCTION OF 3D-MECHANICAL PARTS FROM 2D-ORTHOGRAPHIC VIEWS WITH RULESen_US
dc.typeArticleen_US
dc.identifier.doi10.1080/095119X9208547560en_US
dc.identifier.journalINTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURINGen_US
dc.citation.volume5en_US
dc.citation.issue1en_US
dc.citation.spage2en_US
dc.citation.epage9en_US
dc.contributor.department資訊科學與工程研究所zh_TW
dc.contributor.department工業工程與管理學系zh_TW
dc.contributor.departmentInstitute of Computer Science and Engineeringen_US
dc.contributor.departmentDepartment of Industrial Engineering and Managementen_US
dc.identifier.wosnumberWOS:A1992HK15100001-
dc.citation.woscount21-
顯示於類別:期刊論文