| Package | Description |
|---|---|
| math.bsp | |
| math.bsp.node |
| Modifier and Type | Field and Description |
|---|---|
protected IBspNode<TData,TBoundary> |
BspTree.root |
| Modifier and Type | Method and Description |
|---|---|
IBspNode<TData,TBoundary> |
BspTree.getRoot() |
| Modifier and Type | Method and Description |
|---|---|
void |
BspTree.addData(IBspNode<TData,TBoundary> node,
TData data)
Add data to a particular node
Low-level API.
|
void |
BspTree.removeData(IBspNode<TData,TBoundary> node,
TData dataToRemove)
Remove data from a particular node
Low-level API.
|
void |
BspTree.replace(IBspNode<TData,TBoundary> oldNode,
IBspNode<TData,TBoundary> newNode)
Replace old node in the tree by a new node
Low-level API.
|
void |
BspTree.replace(IBspNode<TData,TBoundary> oldNode,
IBspNode<TData,TBoundary> newNode)
Replace old node in the tree by a new node
Low-level API.
|
protected void |
BspTree.setDepthRecursively(IBspNode<TData,TBoundary> node,
int depth) |
void |
BspTree.setRoot(IBspNode<TData,TBoundary> value)
Set the root node
Low-level API.
|
| Modifier and Type | Class and Description |
|---|---|
class |
BspInternalNode<TData,TBoundary>
Internal node
A node with boundary and positive and negative child.
|
class |
BspLeafNode<TData,TBoundary>
Leaf node
A node that contains only data.
|
| Modifier and Type | Field and Description |
|---|---|
protected IBspNode<TData,TBoundary> |
BspInternalNode.negativeChild |
protected IBspNode<TData,TBoundary> |
BspInternalNode.positiveChild |
| Modifier and Type | Method and Description |
|---|---|
IBspNode<TData,TBoundary> |
BspInternalNode.getNegativeChild() |
IBspNode<TData,TBoundary> |
BspInternalNode.getPositiveChild() |
| Modifier and Type | Method and Description |
|---|---|
void |
BspInternalNode.setNegativeChild(IBspNode<TData,TBoundary> value)
Set negative child
Low-level API.
|
void |
BspInternalNode.setPositiveChild(IBspNode<TData,TBoundary> value)
Set positive child
Low-level API.
|
Copyright © 2019 AMIS research group, Faculty of Mathematics and Physics, Charles University in Prague, Czech Republic. All rights reserved.