Rapid Prototyping을 위한 점군 절단면의 직접 도시
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | 박상철 | - |
dc.contributor.author | 박형태 | - |
dc.date.accessioned | 2018-11-08T07:39:29Z | - |
dc.date.available | 2018-11-08T07:39:29Z | - |
dc.date.issued | 2007-08 | - |
dc.identifier.other | 2450 | - |
dc.identifier.uri | https://dspace.ajou.ac.kr/handle/2018.oak/6579 | - |
dc.description | 학위논문(석사)----아주대학교 일반대학원 :산업공학과,2007. 8 | - |
dc.description.tableofcontents | 1. Introduction 1 2. Previous Research 4 2.1 Projection approach 4 2.2 Virtual Edge approach 6 3. Approach to the Computation of Sectional Contour Points 7 3.1 Density Gauge Sphere 11 3.2 Point Supplementing 13 4. Contour Curve Linking 14 4.1 Delaunay Triangulation 15 4.2 Linking Process 15 5. Accuracy of Contour Curve 18 6. Conclusion and Future Works 21 References 22 | - |
dc.language.iso | eng | - |
dc.publisher | The Graduate School, Ajou University | - |
dc.rights | 아주대학교 논문은 저작권에 의해 보호받습니다. | - |
dc.title | Rapid Prototyping을 위한 점군 절단면의 직접 도시 | - |
dc.title.alternative | Park Hyeong Tae | - |
dc.type | Thesis | - |
dc.contributor.affiliation | 아주대학교 일반대학원 | - |
dc.contributor.alternativeName | Park Hyeong Tae | - |
dc.contributor.department | 일반대학원 산업공학과 | - |
dc.date.awarded | 2007. 8 | - |
dc.description.degree | Master | - |
dc.identifier.localId | 566923 | - |
dc.identifier.url | http://dcoll.ajou.ac.kr:9080/dcollection/jsp/common/DcLoOrgPer.jsp?sItemId=000000002450 | - |
dc.subject.keyword | Direct Slicing | - |
dc.subject.keyword | Point Cloud | - |
dc.subject.keyword | Rapid Prototyping | - |
dc.subject.keyword | Reverse Engineering | - |
dc.description.alternativeAbstract | Presented in the paper is an algorithm for generating a section curve by slicing a point cloud which may include tens of thousands of points. Although there have been couple of previous results, they are very sensitive on the density variations and local noises. In the paper, three technological requirements are identified; 1) dominant point sampling, 2) local vibration avoidance and 3) robustness on the density variations. To satisfy these requirements, we propose a new slicing algorithm based on a Virtual Edge (VE) approach, which is known to have a weakness for density variations. To complement the weakness of VE approach, Density Gauge (DG) sphere and point supplementing techniques have been developed and applied. The DG sphere and point supplementing techniques help to identify accurate virtual edges, which should be sliced to generate contour points. To compute the section curves from the contour points, the proposed algorithm employs the 2D Delaunay triangulation technique. The algorithm has been implemented and tested with various examples. | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.