Editing Delaunay triangulation (section)

===Sweephull===

Sweephull<ref>{{cite web|url=http://www.s-hull.org/paper/s_hull.pdf |archive-url=https://web.archive.org/web/20131027221354/http://www.s-hull.org/paper/s_hull.pdf |archive-date=2013-10-27 |url-status=live|title=S-hull|website=s-hull.org|access-date=25 April 2018}}</ref> is a hybrid technique for 2D Delaunay triangulation that uses a radially propagating sweep-hull, and a flipping algorithm. The sweep-hull is created sequentially by iterating a radially-sorted set of 2D points, and connecting triangles to the visible part of the convex hull, which gives a non-overlapping triangulation. One can build a convex hull in this manner so long as the order of points guarantees no point would fall within the triangle. But, radially sorting should minimize flipping by being highly Delaunay to start. This is then paired with a final iterative triangle flipping step.