Difference between revisions of "Talk:Range Search"
Jump to navigation
Jump to search
m |
(Thanks for help and little clarification) |
||
| Line 4: | Line 4: | ||
:: Actually not so, as points of equal distance will be selected in order of first or last visited in a KNN depending on implementation. — <span style="font-family: monospace">[[User:Chase-san|Chase]]-[[User_talk:Chase-san|san]]</span> 11:32, 8 August 2011 (UTC) | :: Actually not so, as points of equal distance will be selected in order of first or last visited in a KNN depending on implementation. — <span style="font-family: monospace">[[User:Chase-san|Chase]]-[[User_talk:Chase-san|san]]</span> 11:32, 8 August 2011 (UTC) | ||
| + | |||
| + | Thanks to all for help. A little clarification: imho, advantage of RS, that if you have many data points, but current situation is placed in area with low density of data, you did not get not corresponding data --[[User:Jdev|Jdev]] 16:54, 8 August 2011 (UTC) | ||
Revision as of 17:54, 8 August 2011
Your KNN algorithm illustration isn't correct, as it is showing a range box like the others. A more accurate depiction would be lines drawn to the nearest 4/8 neighbors. As for the range search, My KdTree Implementation supports them. — Chase-san 10:47, 8 August 2011 (UTC)
- Yes, you're rigth. i'll redraw it later. but it's any way will be rhomb for Manhettan distance formula and circle for Euclidean distance formula, where radius is max distance to neighbor. --Jdev 11:07, 8 August 2011 (UTC)
Thanks to all for help. A little clarification: imho, advantage of RS, that if you have many data points, but current situation is placed in area with low density of data, you did not get not corresponding data --Jdev 16:54, 8 August 2011 (UTC)
