Kd tree nearest neighbor search

Nearest neighbour search: wiki

实现代码: gist

生成分散点, 点之间可以指定最小距离

获取 2d 平面中离将要插入的点最近的点, 如果将要插入的点离该点的距离大于指定的最小距离, 则插入该点

Online demo: github-pages

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
docs		docs
misc		misc
src		src
webpack		webpack
.babelrc		.babelrc
.eslintrc		.eslintrc
.gitignore		.gitignore
Readme.md		Readme.md
package.json		package.json
tsconfig.json		tsconfig.json
webpack.config.js		webpack.config.js
yarn.lock		yarn.lock

Provide feedback