https://github.com/kunukn/single-detect
Detect singles on 2D dimension space
https://github.com/kunukn/single-detect
Last synced: about 2 months ago
JSON representation
Detect singles on 2D dimension space
- Host: GitHub
- URL: https://github.com/kunukn/single-detect
- Owner: kunukn
- License: other
- Created: 2013-01-14T21:39:55.000Z (over 12 years ago)
- Default Branch: master
- Last Pushed: 2014-09-20T16:50:15.000Z (over 10 years ago)
- Last Synced: 2025-01-31T07:31:13.017Z (4 months ago)
- Language: C#
- Size: 4.17 MB
- Stars: 2
- Watchers: 1
- Forks: 2
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
Single Detect with C#
=============Detect singles and K-nearest neighbors in 2D dimension space
* Console code examples for K-nearest neighbors (knn) and singles
* Gui code examples for knn and singles (WPF with animation and mouse interaction, i.e. dynamic data)
* Algorithm strategy option between Grid, Naive and KdTree
* Option to apply knn on same type points only
* Euclidean distance is used
Single detection
------------About Single detection? Read this [blog](http://kunuk.wordpress.com/2013/01/13/single-detection-in-2d-dimension).

The red colors are the identified singles.
K-nearest neighbor
------------About K-nearest neighbor? Read this [blog](http://kunuk.wordpress.com/2013/01/21/k-nearest-neighbor-in-2d-dimension-space).

The origin in the center is the red color.
You can move the mouse pointer around and the neighbors will be updated.
The pink colors are the nearest neighbors and are slightly larger in size.
Nearest neighbors by same type only. The origin is the red and the same type are all the purple colors.
The identified nearest neighbors are the purple colors slightly larger in size
(Only supported in Naive and Grid strategy algorithm).