Textile Science and Engineering (한국섬유공학회지)

The Korean Fiber Society (한국섬유공학회)
권호 표지

Triangular Mesh Generation Algorithm for an Acute Angle Dart in 3D Apparel Design

3차원 의복 디자인에서의 예각 다트를 고려한 삼각형 메쉬 생성 알고리즘

  • Sul In-Hwan (Intelligent Textile System Research Center and School of Materials Science and Engineering, Seoul National University) ;
  • Kim Sung-Min (Faculty of Applied Chemistry, Chonnam National University) ;
  • Kang Tae-Jin (Intelligent Textile System Research Center and School of Materials Science and Engineering, Seoul National University)
  • Published : 2006.02.01
⟨ Previous Next ⟩

Abstract

A new Triangular mesh generation algorithm based on Delaunay triangulation for three-dimensional apparel CAD system was developed. Triangular element shape was chosen to represent complex pattern shapes effectively. The triangulation scheme is based on incremental searching method and extreme pattern geometries such as a narrow dart angle, which conventional mesh generation algorithms could not deal with, was considered. The initial pattern shape is assumed to be a general non-convex polygon with holes and darts. Input data were transformed to an integer domain to reduce round off error. Local triangulation scheme and edge-based half-plane searching scheme were used to optimize calculation speed and the resultant meshes showed good triangulation for 3D apparel CAD patterns.

Keywords

References

  1. M. Bern, D. Dobkiny, and D. Eppstein, 'Triangulating Polygons without Large Angles', International Journal of Computational Geometry and Applications, 1995, 5, 171-192 https://doi.org/10.1142/S0218195995000106
  2. J. R. Shewchuk, 'Delaunay Refinement Algorithms for Triangular Mesh Generation', Computational Geometry: Theory and Applications, 2002, 22(1-3), 21-74 https://doi.org/10.1016/S0925-7721(01)00047-5
  3. D. E. Breen, D. H. House, and M. J. Wozny, 'A Particle-Based Model for Simulating the Draping Behavior of Woven Cloth', Text Res J, 1994, 64(11), 663-673 https://doi.org/10.1177/004051759406401106
  4. R. A. Dwyer, 'A Faster Divide-and-conquer Algorithm for Constructing Delaunay Triangulations', Algorithmica, 1987, 2, 137-151 https://doi.org/10.1007/BF01840356
  5. S. Fortune, 'A Sweepline Algorithm for Voronoi Diagrams', Algorithmica, 1987, 2, 153-174 https://doi.org/10.1007/BF01840357
  6. K. L. Clarkson and P. W. Shor, 'Applications of Random Sampling in Computational Geometry(II)-Discrete and Computational Geometry', 1989, 4, 387-421 https://doi.org/10.1007/BF02187740
  7. P. Su and R. L. Scot Drysdale, 'A Comparison of Sequential Delaunay Triangulation. Algorithms', Computational Geometry: Theory and Applications, 1996, 7(5/6), 361-386 https://doi.org/10.1016/S0925-7721(96)00025-9
  8. J. O'Rourke, 'Computational Geometry in C', Cambridge University Press, 1994, pp. 52-69
  9. E. W. Dijkstra, 'A Note on Two Problems in Connection with Graphs', Numeriche Math, 1959, 1, 269-271 https://doi.org/10.1007/BF01386390