|
A d-dimensional segment tree can be used to solve the following problems:
- Determine all d-dimensional intervals that contain a d-dimensional point (inverse range query).
- Determine all d-dimensional intervals that enclose a given d-dimensional interval (enclosing_query).
- Determine all d-dimensional intervals that partially overlap or are contained in a given d-dimensional interval (window_query).
| Functionality: | static |
| Robustness: | industry strong |
| License: | QPL, commercial |
| Developed by: | ETHZ |
|