Delaney triangulation algoritham -incremental

I am looking to implement delaney incremental algoritham but most sites dont explain it well. For example first step is to create triangle that will include all points in the set. Can anyone try to explain this algoritham or point me to some site that explains it well

Thank you