| 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 final Region | region
Region on which to operate. |
| Access | Constructor and Description |
|---|---|
| pack-priv |
| Modifier and Type | Method and Description |
|---|---|
| public boolean | Returns: true if inside leaf nodes have been found on the minus sideCheck if inside leaf nodes have been found on the minus side. |
| public boolean | Returns: true if inside leaf nodes have been found on the plus sideCheck if inside leaf nodes have been found on the plus side. |
| public void | recurseSides(final BSPTree<S>
current BSP tree node node, final SubHyperplane<S> sub-hyperplane sub)Search recursively for inside leaf nodes on each side of the given hyperplane. |
| minusFound | back to summary |
|---|---|
| private boolean minusFound Indicator of inside leaf nodes found on the plus side. | |
| plusFound | back to summary |
|---|---|
| private boolean plusFound Indicator of inside leaf nodes found on the plus side. | |
| region | back to summary |
|---|---|
| private final Region<S> region Region on which to operate. | |
| InsideFinder | back to summary |
|---|---|
| pack-priv InsideFinder(final Region<S> region) Simple constructor.
| |
| minusFound | back to summary |
|---|---|
| public boolean minusFound() Check if inside leaf nodes have been found on the minus side.
| |
| plusFound | back to summary |
|---|---|
| public boolean plusFound() Check if inside leaf nodes have been found on the plus side.
| |
| recurseSides | back to summary |
|---|---|
| public void recurseSides(final BSPTree<S> node, final SubHyperplane<S> sub) Search recursively for inside leaf nodes on each side of the given hyperplane. 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)..
| |