Dynamic Planar Nearest Neighbors

Maintain a set $S$ of $n$ points in the Euclidean plane under insertion and deletion. Given a query point $q$, return a point of $S$ nearest to $q$. Determine whether insertions, deletions, and queries can all be supported in $O(\log n)$ time using near-linear space.