Premium
Sweepline algorithm for unstructured‐grid generation on two‐dimensional non‐convex domains
Author(s) -
Fang Jiunn,
Parpia Ijaz. H.,
Ken Stephen R.
Publication year - 1993
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.1620361606
Subject(s) - regular polygon , grid , algorithm , domain (mathematical analysis) , set (abstract data type) , variety (cybernetics) , simple (philosophy) , mathematics , computer science , geometry , artificial intelligence , mathematical analysis , philosophy , epistemology , programming language
The sweepline algorithm has been modified to triangulate a set of nodes on a non‐convex domain. The new method is based on a fragile sweepline which is split and rejoined in a manner which ensures that boundaries are preserved. Both the original and the modified algorithms are introduced using simple examples. It is shown that a set of N nodes is triangulated in O ( N log N ) time. The validity of the new method has been confirmed through testing on a variety of problems, and two test cases are presented in this paper.