Lower bound for point set triangulation
No, that's not a valid argument.  You'd have to describe how to find which part of the triangulation is the convex hull, in $o(n \log n)$ time, to make that a valid argument.