Sweepline algorithm for unstructured‐grid generation on two‐dimensional non‐convex domains
Jiunn Fang, Ijaz H. Parpia, Stephen R. Kennon · International Journal for Numerical Methods in Engineering · 1993
Abstract 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.