S
- Type of the space.class InsideFinder<S extends Space>
extends java.lang.Object
Modifier and Type | Field and Description |
---|---|
private boolean |
minusFound
Indicator of inside leaf nodes found on the plus side.
|
private boolean |
plusFound
Indicator of inside leaf nodes found on the plus side.
|
private Region<S> |
region
Region on which to operate.
|
Constructor and Description |
---|
InsideFinder(Region<S> region)
Simple constructor.
|
Modifier and Type | Method and Description |
---|---|
boolean |
minusFound()
Check if inside leaf nodes have been found on the minus side.
|
boolean |
plusFound()
Check if inside leaf nodes have been found on the plus side.
|
void |
recurseSides(BSPTree<S> node,
SubHyperplane<S> sub)
Search recursively for inside leaf nodes on each side of the given hyperplane.
|
private boolean plusFound
private boolean minusFound
public void recurseSides(BSPTree<S> node, SubHyperplane<S> sub)
The algorithm used here is directly derived from the one described in section III (Binary Partitioning of a BSP Tree) of the Bruce Naylor, John Amanatides and William Thibault paper Merging BSP Trees Yields Polyhedral Set Operations Proc. Siggraph '90, Computer Graphics 24(4), August 1990, pp 115-124, published by the Association for Computing Machinery (ACM)..
node
- current BSP tree nodesub
- sub-hyperplanepublic boolean plusFound()
public boolean minusFound()