Suppose given a convex polygon $P$ with $n$ vertices in the plane. It's possible to triangulate $P$ such that for each given line $\ell$, $\ell$ cross at most $O(\log n)$ triangles?
My attempt:
I think Delaney Triangulation can help us but I have no idea that how we must change the algorithm to handle this case.