Before revision:  The proposed analysis technique also shows that the expected depth is {\cal O}( \ln n ), which partially solves a recent conjecture by\emph{ [  Hemmer et al. that is used in the CGAL implementation of the TSD [ .
After revision:  The proposed analysis technique also shows that the expected depth is {\cal O}( \ln n ), which partially solves a recent conjecture by\emph{ Las Vegas verifiers to obtain search DAGs with optimal worst-case bounds. This positively answers the conjectured logarithmic search cost in the DAG of Delaunay triangulations[ Hemmer et al. that is used in the CGAL implementation of the TSD [ .