| 
deegree 2.1 (2007/11/08 09:57 build-328-official) | |||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectorg.deegree.io.rtree.RTree
public class RTree
 Implementation of a R-Tree after the algorithms of Antonio Guttman. With nearest neighbour search
 after algorithm of Cheung & Fu 
| Constructor Summary | |
|---|---|
RTree(int dimension,
           int maxLoad)
Creates an empty R-Tree with a memory-mapped pagefile (MemoryPageFile) and an empty root node  | 
|
RTree(int dimension,
           int maxLoad,
           String fileName)
Creates an empty R-Tree with a persistent pagefile (PersistentPageFile) and an empty root node.  | 
|
RTree(String fileName)
Creates an R-Tree from an EXISTING persistent pagefile (PersistentPageFile).  | 
|
| Method Summary | |
|---|---|
 void | 
close()
Closes the rtree.  | 
 Object[] | 
contains(HyperBoundingBox box)
Searches all entries in the R-Tree whose HyperBoundingBoxes contain the given.  | 
 boolean | 
delete(HyperBoundingBox box)
Deletes all entries from the R-Tree with given HyperBoundingBox  | 
 boolean | 
delete(HyperBoundingBox box,
             int objID)
Deletes an entry from the RTree.  | 
 Object[] | 
find(HyperBoundingBox box)
Retrieves all entries with the given HyperBoundingBox.  | 
 boolean | 
insert(Object obj,
             HyperBoundingBox box)
Inserts the given Object associated with the given HyperBoundingBox object into the R-Tree.  | 
 Object[] | 
intersects(HyperBoundingBox box)
Searches all entries in the R-Tree whose HyperBoundingBoxes intersect with the given.  | 
 double[] | 
nearestNeighbour(HyperPoint point)
Queries the nearest neighbour to given search HyperPoint  | 
| Methods inherited from class java.lang.Object | 
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait | 
| Constructor Detail | 
|---|
public RTree(int dimension,
             int maxLoad)
      throws RTreeException
dimension - -
            dimension of the data to storemaxLoad - -
            maximum load of a node
RTreeException
public RTree(int dimension,
             int maxLoad,
             String fileName)
      throws RTreeException
dimension - -
            dimension of the data to storemaxLoad - -
            maximum load of a nodefileName - -
            name of the rtree file
RTreeException
public RTree(String fileName)
      throws RTreeException
fileName - -
            name of the existing rtree file
RTreeException| Method Detail | 
|---|
public Object[] intersects(HyperBoundingBox box)
                    throws RTreeException
box - -
            given test HyperBoundingBox
RTreeException
public Object[] contains(HyperBoundingBox box)
                  throws RTreeException
box - -
            given test HyperBoundingBox
RTreeException
public boolean insert(Object obj,
                      HyperBoundingBox box)
               throws RTreeException
obj - -
            Object to insertbox - -
            associated HyperBoundingBox
RTreeException
public double[] nearestNeighbour(HyperPoint point)
                          throws RTreeException
point - -
            search point
RTreeException
public void close()
           throws RTreeException
RTreeException - -
             if an error occures.
public boolean delete(HyperBoundingBox box,
                      int objID)
               throws RTreeException
box - -
            HyperBoundingBox of the entry to deletedobjID - -
            Integer value of Object-ID to be deleted
RTreeException
public boolean delete(HyperBoundingBox box)
               throws RTreeException
box - -
            HyperBoundingBox
RTreeException
public Object[] find(HyperBoundingBox box)
              throws RTreeException
box - -
            HyperBoundingBox
RTreeException
  | 
deegree 2.1 (2007/11/08 09:57 build-328-official) | |||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
an open source project founded by lat/lon, Bonn, Germany.
					For more information visit: http://deegree.sourceforge.net