DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Shin, Sung-Yong | - |
dc.contributor.advisor | 신성용 | - |
dc.contributor.author | Park, Tae-Joon | - |
dc.contributor.author | 박태준 | - |
dc.date.accessioned | 2011-12-13T05:55:31Z | - |
dc.date.available | 2011-12-13T05:55:31Z | - |
dc.date.issued | 1994 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=69583&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/34042 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 전산학과, 1994.2, [ iii, 39 p. ] | - |
dc.description.abstract | This thesis proposes an efficient physically-based method to generate a triangular mesh that approximates a parametric surface. As an approximation of the curvature characteristics of a surface region, we propose the curvature feature, that is a computationally simple but effective measure of the surface curvedness. In the proposed algorithm, the curvature feature of a surface region is regarded as an attracting force, and applied to a vertex using a spring model. The surface curvedness is distributed uniformly over the mesh by this algorithm. To determine the location of each vertex in the mesh, an initial triangulation is formed using the restricted quadtree and iteratively optimized based on the spring model. Since our approach uses a local optimization instead of a global optimization to determine the location of each vertex at each optimization step, a mesh can be generated fast enough for interactive applications. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | 그래픽스. | - |
dc.subject | 삼각 분할. | - |
dc.title | Physically-based surface triangulation for parametric surfaces | - |
dc.title.alternative | 매개변수곡면에 대한 물리기반의 삼각분할법 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 69583/325007 | - |
dc.description.department | 한국과학기술원 : 전산학과, | - |
dc.identifier.uid | 000923212 | - |
dc.contributor.localauthor | Shin, Sung-Yong | - |
dc.contributor.localauthor | 신성용 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.