Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 223,835,265 papers from all fields of science
Search
Sign In
Create Free Account
Adaptive k-d tree
An adaptive k-d tree is a tree for multidimensional points where successive levels may be split along different dimensions.
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
2 relations
List of data structures
Tree (data structure)
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
Automatic Interpretation of Floor Plans Using Spatial Indexing
Hanan Sametaya SOFFERComputer
2007
Corpus ID: 50518580
A system is presented that classiies objects in raw images using statistical pattern recognition and spatial indexing. The system…
Expand
2006
2006
Towards Online Adaptation In Action Games: Case Storage and Retrieval
Thomas P. Hartley
,
Q. Mehdi
2006
Corpus ID: 16637730
In this paper we present our work towards the development of an online learning and adaptation architecture for non-player…
Expand
2005
2005
Approximate Orthogonal Range Search using Patricia Tries
B. Nickerson
,
Qingxiu Shi
Canadian Conference on Computational Geometry
2005
Corpus ID: 7435172
We use Patricia tries to answer 2-approximate orthogonal range search on a set of n random points and rectangles in k-dimensional…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE