# Flip-based algorithm for Delaunay triangulation in expected or average-case O(nlogn)

Focusing on the 2D plane:

Lawson's Flip Algorithm works in worst-case $$O(n^2)$$ flips. I have seen it mentioned that (other?) flip-based algorithms work in expected $$O(nlogn)$$ time for two dimensions. What is a simple example of an algorithm like this (perhaps with proof of complexity)? How would this be found?

Edit: If there are none in expected $$O(nlogn)$$, are there average-case $$O(nlogn)$$ flip-based algorithms?