Talk:Adaptive k-d tree

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

???

This article has not yet received a rating on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Page Deletion

This help request has been answered. If you need more help, please place a new {{help me}} request on this page followed by your questions, or contact the responding user(s) directly on their user talk page.

I feel this Wikipedia page needs to be deleted due to it being only one line. Adamdaley (talk) 05:09, 7 August 2010 (UTC)[reply]

It's just a stub, a short article. Shortness is not indicative of uselessness. Wikipedia only speedily deletes articles that fall under this criteria. —La Pianista ^{♫ ♪} 05:28, 7 August 2010 (UTC)[reply]

The only useful thing on it beyond its name are those references; there's literally nothing other than them that informs me (as someone thinking about trying to write an implementation, or at least to know enough about it to do so) in the slightest. Merging things into K-d tree would make a bunch of sense (leaving this page as a redirect) and could surely be done without losing anything of value. –Donal Fellows (talk) 05:58, 7 March 2012 (UTC)[reply]