Browse > Article

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

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)
Publication Information
Textile Science and Engineering / v.43, no.1, 2006 , pp. 39-45 More about this Journal
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
triangular mesh; delaunay triangulation; dart; 3D apparel CAD;
Citations & Related Records
연도 인용수 순위
  • Reference
1 R. A. Dwyer, 'A Faster Divide-and-conquer Algorithm for Constructing Delaunay Triangulations', Algorithmica, 1987, 2, 137-151   DOI
2 E. W. Dijkstra, 'A Note on Two Problems in Connection with Graphs', Numeriche Math, 1959, 1, 269-271   DOI
3 J. R. Shewchuk, 'Delaunay Refinement Algorithms for Triangular Mesh Generation', Computational Geometry: Theory and Applications, 2002, 22(1-3), 21-74   DOI
4 M. Bern, D. Dobkiny, and D. Eppstein, 'Triangulating Polygons without Large Angles', International Journal of Computational Geometry and Applications, 1995, 5, 171-192   DOI
5 J. O'Rourke, 'Computational Geometry in C', Cambridge University Press, 1994, pp. 52-69
6 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   DOI
7 K. L. Clarkson and P. W. Shor, 'Applications of Random Sampling in Computational Geometry(II)-Discrete and Computational Geometry', 1989, 4, 387-421   DOI
8 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   DOI   ScienceOn
9 S. Fortune, 'A Sweepline Algorithm for Voronoi Diagrams', Algorithmica, 1987, 2, 153-174   DOI