k-d树（k-dimensional树的简称），是一种分割k维数据空间的数据结构。主要应用于多维空间关键数据的搜索（如：范围搜索和最近邻搜索）。用java实现，可直接运行-kd-tree (k-dimensional tree for short), is a partition the data structure of k-dimensional data space. Mainly used in the search of the key data of the multidimensi

Conventional spatial queries, such as range search and nearest neighbor retri , involve only conditions on objects’ geometric properties. Today, many modern applications call for novel forms of queries that aim to find objects satisfying both a spati

基于格子法的最近距离搜索和区域搜索。根据给定的GPS点的txt文件 搜索出距离给定经纬度的最近的用户指定的类型（例如餐馆，政府机构，atm机）(Nearest neighbor search and region search based on lattice method)