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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Nonplayer characters (NPCs) in today's computer games lack the ability to adapt to situations that were not envisaged by the… (More)
Is this relevant?
2007
2007
  • HANAN SAMETAYA SOFFERComputer
  • 2007
A system is presented that classiies objects in raw images using statistical pattern recognition and spatial indexing. The system… (More)
Is this relevant?
2006
2006
Preface An investigation into algorithms for fast approximate nearest-neighbors (kNN) classification is reported. The principal… (More)
  • figure 2.1
  • figure 3.1
  • figure 3.2
  • figure 3.3
  • figure 3.4
Is this relevant?
2006
2006
In this paper we present our work towards the development of an online learning and adaptation architecture for non-player… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
We use Patricia tries to answer -approximate orthogonal range search on a set of n random points and rectangles in k-d space. The… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?