Nearest Neighbors and Continous Nearest Neighbor Queries based on Voronoi Diagrams Miao Wang and Zhongxiao Hao Abstract PDF Fulltext XML References Citation
Comments Marcelo Tavares 23 August, 2010 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.
Marcelo Tavares
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.