| Package | Description |
|---|---|
| math.bsp | |
| math.bsp.algorithm | |
| math.bsp.algorithm.raycast | |
| math.bsp.node | |
| math.bsp.strat |
| Class and Description |
|---|
| BspOccupation
Binary space partition occupation
Enumeration that tells what part of space divided by a boundary an entity occupies
|
| BspTree
Binary space partitioning tree
This is a generic implementation supporting both 2D and 3D spaces (or any other space, even non-euclidean).
|
| IBspStrategy
Binary space partitioning strategy
Strategy tells
BspTree how to partition space/data. |
| IConstBspTree
Constant interface to
BspTree |
| SplitData
Data spit into positive and negative parts
Immutable.
|
| Class and Description |
|---|
| BspOccupation
Binary space partition occupation
Enumeration that tells what part of space divided by a boundary an entity occupies
|
| IConstBspTree
Constant interface to
BspTree |
| Class and Description |
|---|
| IConstBspTree
Constant interface to
BspTree |
| Class and Description |
|---|
| BspOccupation
Binary space partition occupation
Enumeration that tells what part of space divided by a boundary an entity occupies
|
| BspTree
Binary space partitioning tree
This is a generic implementation supporting both 2D and 3D spaces (or any other space, even non-euclidean).
|
| IConstBspTree
Constant interface to
BspTree |
| Class and Description |
|---|
| BspOccupation
Binary space partition occupation
Enumeration that tells what part of space divided by a boundary an entity occupies
|
| SplitData
Data spit into positive and negative parts
Immutable.
|
Copyright © 2019 AMIS research group, Faculty of Mathematics and Physics, Charles University in Prague, Czech Republic. All rights reserved.