| org.deegree.io.rtree |
|
| Java Source File Name | Type | Comment |
| HyperBoundingBox.java | Class |
HyperBoundingBox implementing a bounding box
object in the multidimensional space. |
| HyperPoint.java | Class |
Point in multidimensional space. |
| LeafNode.java | Class |
Implementation of a LeafNode. |
| MemoryPageFile.java | Class |
A memory based implementation of a PageFile.
Implemented as a Hashtable with keys representing the page file numbers of the saved nodes. |
| Node.java | Class |
Abstract class for common implementation and definition of abstract methods for both concrete
classes LeafNode and NoneLeafNode. |
| NoneLeafNode.java | Class |
Implementation of a NoneLeafNode. |
| PageFile.java | Class |
Abstract class implementing general methods of a PageFile. |
| PageFileException.java | Class | |
| PersistentPageFile.java | Class |
A persistent implementation of a PageFile implemented based on a RandomAccesFile.
Structure of the File
-- Header --
int pageFileVersion
int dimension
int capacity = maxLoad + 1 for Overflow
int minimum
-- Body --
a sequence of page one after another with:
int typ - 1 LeafNode 2 NoneLeafNode
int place - index of entry of this node in father node
int counter - current used space in the node
int parentNode - page number of father node
int pageNumber - own page number
- for(i = 0; i < capacity; i++)
int data Entry i - page number of childnode or object ID of data entry
- always dependend on
dimension = x
double pMin x.Dimension - pMin of the common HyperBoundingBox
double pMax x.Dimension - pMax of the common HyperBoundingBox
- for(i = 0; i < capacity;
i++)
double pMin x.Dimension - pMin HyperBoundingBox for Entry i
double pMax x.Dimension - pMax HyperBoundingBox for Entry i
int entspr. |
| RTree.java | Class |
Implementation of a R-Tree after the algorithms of Antonio Guttman. |
| RTreeException.java | Class |
The common exception thrown by problems during the rtree methods. |