concept hyper - rectangle in category algorithms

This is an excerpt from Manning's book Algorithms and Data Structures in Action MEAP V14. Login to get full access to this book.

Retrieving all the points in the container within a range (all points lying inside a hyper-rectangle, or a semi-hyperspace).

Figure 10.19 Deleting a point. This example shows, in order, cases 2.c, 2.b and 1 described in this section.