Research Article
Nearest Neighbors and Continous Nearest Neighbor Queries based on Voronoi Diagrams
College of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China
Zhongxiao Hao
College of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, China
Marcelo Tavares Reply
It is not clear how the author check if a point is inside a polygon in constant time. It is also not so clear how the VR-Trees are constructed.