Sign inSign in

Orthogonal range searching

A computational problem of finding all points within a given multi-dimensional axis-aligned bounding box or range.
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Data structure1Multidimensional data structures1Range trees1Searching1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1
  • Erik Demaine

    MIT · Undergraduate

    • 17:55Geometric Structures I

Lectures that assume it

1

Connections

8

The lectures that define it or assume it, and the concepts next to it.

Concepts5

Lectures3

1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.