QueryTree

computational.geometry.pointlocation
Class QueryTree

java.lang.Object
  computational.geometry.pointlocation.QueryTree

This structure is used to construct nodes of the rooted tree used in Kirkpatrick's method. Every node has it's unique id, triangle and its children.

Method Summary
`void`	`addChild(QueryTree child)` Adds children to the node
`boolean`	`contains(Point point)` Checkes if triangle controlled by the node contains point
`QueryTree`	`getChild(int i)` Returns the i-th children of the node
`java.util.Vector`	`getChildren()` Returns children of the node
`int`	`getID()` Returns id of the node
`int`	`getNumChildren()` Returns number of children of the node
`Triangle`	`getTriangle()` Returns triangle of the node
`void`	`setID(int _rootID)` Sets id of the node
`java.lang.String`	`toString()` Returns string representation of the node

Methods inherited from class java.lang.Object
`clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait`

Method Detail

public void addChild(QueryTree child)

Adds children to the node

public boolean contains(Point point)

Checkes if triangle controlled by the node contains point

public QueryTree getChild(int i)

Returns the i-th children of the node

public java.util.Vector getChildren()

Returns children of the node

public int getID()

Returns id of the node

public int getNumChildren()

Returns number of children of the node

public Triangle getTriangle()

Returns triangle of the node

public void setID(int _rootID)

Sets id of the node

public java.lang.String toString()

Returns string representation of the node