  We preprocess the input subdivision with $n$ points on the plane in
$O(n\sqrt{\log n})$ time to facilitate point location in constant time.
Previously the preprocessing time is $O(n\log n)$ and point location takes
$O(\log n)$ time.
