QuadTree-class

A class representing a Quad Tree object for storing 2 dimensional points
for efficient rectangular range and knn lookup.

classes

The QuadTree data structure is useful for fast,
neighborhood-restricted lookups. We use it to implement fast k-Nearest
Neighbor and Rectangular range lookups in 2 dimenions. The
primary target is high performance interactive graphics.

Gabriel Becker

SearchTrees

Spatial Search Trees

QuadTree-class function

Objects can be created by calls of the form <code>new("QuadTree", ...)</code>.

Objects from the Class

<dl>
 <dt><code>ref</code>:</dt>
<dd>Object of class <code>"externalptr"</code> Pointer to
 the internal representation of the tree</dd> <dt><code>numNodes</code>:</dt>
<dd>Object of class <code>"integer"</code> Number of
 nodes in the tree</dd> <dt><code>dataNodes</code>:</dt>
<dd>Object of class <code>"integer"</code> Number of
 nodes in the tree which are storing data</dd> <dt><code>maxDepth</code>:</dt>
<dd>Object of class <code>"integer"</code> Maximum
 depth of the tree.</dd> <dt><code>maxBucket</code>:</dt>
<dd>Object of class <code>"integer"</code> Maximum
 number of data points which are stored at a single node</dd> <dt><code>totalData</code>:</dt>
<dd>Object of class <code>"integer"</code> Number of
 objects stored in the tree</dd> <dt><code>dataType</code>:</dt>
<dd>Object of class <code>"character"</code> Indicates
 type of data stored in the tree.</dd> 
</dl>

Slots

Class <code>"SearchTree"</code>, directly.

Extends

<dl>
 <dt>knnLookup</dt>
<dd><code>signature(tree = "QuadTree")</code>: ...</dd> <dt>rectLookup</dt>
<dd><code>signature(tree = "QuadTree")</code>: ...</dd> 
</dl>

Methods

Author

Class "QuadTree" — QuadTree-class

<dl>
 <dt><code>ref</code>:</dt>
<dd>Object of class <code>"externalptr"</code> Pointer to
 the internal representation of the tree</dd>

 <dt><code>numNodes</code>:</dt>
<dd>Object of class <code>"integer"</code> Number of
 nodes in the tree</dd>

 <dt><code>dataNodes</code>:</dt>
<dd>Object of class <code>"integer"</code> Number of
 nodes in the tree which are storing data</dd>

 <dt><code>maxDepth</code>:</dt>
<dd>Object of class <code>"integer"</code> Maximum
 depth of the tree.</dd>

 <dt><code>maxBucket</code>:</dt>
<dd>Object of class <code>"integer"</code> Maximum
 number of data points which are stored at a single node</dd>

 <dt><code>totalData</code>:</dt>
<dd>Object of class <code>"integer"</code> Number of
 objects stored in the tree</dd>

 <dt><code>dataType</code>:</dt>
<dd>Object of class <code>"character"</code> Indicates
 type of data stored in the tree.</dd>

 
</dl>

<dl>
 <dt>knnLookup</dt>
<dd><code>signature(tree = "QuadTree")</code>: ...</dd>

 <dt>rectLookup</dt>
<dd><code>signature(tree = "QuadTree")</code>: ...</dd>

 
</dl>

QuadTree-class: Class `"QuadTree"`

Description

Arguments

Objects from the Class

Slots

Extends

Methods

Author

See Also

Examples