Orthogonal Range Queries: Range Trees and Kd-Trees (6/6) | Computational Geometry - Lecture 05

preview_player
Показать описание
Computational Geometry
Lecture 05: Orthogonal Range Queries: Range Trees and Kd-Trees
Part VI: Fractional Cascading
Philipp Kindermann

  1. Philipp Kindermann
Рекомендации по теме
Orthogonal Range Queries: 0:12:04

Orthogonal Range Queries: Range Trees and Kd-Trees (1/6) | Computational Geometry - Lecture 05

Orthogonal Range Queries: 0:05:18

Orthogonal Range Queries: Range Trees and Kd-Trees (2/6) | Computational Geometry - Lecture 05

Orthogonal Range Queries: 0:09:18

Orthogonal Range Queries: Range Trees and Kd-Trees (6/6) | Computational Geometry - Lecture 05

Orthogonal Range Queries: 0:05:44

Orthogonal Range Queries: Range Trees and Kd-Trees (4/6) | Computational Geometry - Lecture 05

Orthogonal Range Queries: 0:08:50

Orthogonal Range Queries: Range Trees and Kd-Trees (5/6) | Computational Geometry - Lecture 05

Live Coding: Orthogonal 0:14:20

Live Coding: Orthogonal Range Search

Orthogonal Range Queries: 0:10:12

Orthogonal Range Queries: Range Trees and Kd-Trees (3/6) | Computational Geometry - Lecture 05

12: Orthogonal range 1:23:38

12: Orthogonal range searching, Übung

KD-Trees and Range 0:04:20

KD-Trees and Range search

9. Augmentation: Range 1:24:34

9. Augmentation: Range Trees

Orthogonal range search 0:05:24

Orthogonal range search and K d trees

Range Searching (KD 1:01:13

Range Searching (KD Tree)

Live coding kd-trees 0:25:43

Live coding kd-trees

Simplex Range Searching 0:06:53

Simplex Range Searching (1/5) | Computational Geometry - Lecture 11

Simplex Range Searching 0:11:26

Simplex Range Searching (2/5) | Computational Geometry - Lecture 11

KD-Tree Nearest Neighbor 0:06:39

KD-Tree Nearest Neighbor Data Structure

Simplex Range Searching 0:07:40

Simplex Range Searching (5/5) | Computational Geometry - Lecture 11

Orthogonal 2D Range 0:10:11

Orthogonal 2D Range Tree

Code Review: Orthogonal 0:02:42

Code Review: Orthogonal range search for a static kd tree

Simplex Range Searching 0:03:49

Simplex Range Searching (3/5) | Computational Geometry - Lecture 11

Computational geometry - 0:28:51

Computational geometry - Orthogonal range searching - Building Kd-tree algorithm

ESA.8.2 Fast Preprocessing 0:23:48

ESA.8.2 Fast Preprocessing for Optimal Orthogonal Range Reporting and Range Successor with Applicati

K-D tree Algorithms 0:15:57

K-D tree Algorithms for Search, Insert and Find Minimum

Space Efficient Two-Dimensional 0:20:01

Space Efficient Two-Dimensional Orthogonal Colored Range Counting

Комментарии
Автор

That's some absolute wizardry right there! Layered range trees :O

codyheiner
Автор

awesome video, woul've loved some more words on n-dimensional range queries, but still very helpful

rzdexyz
Автор

I guess the lesson is: see if you repeat certin calculations unnecessarily.
if so, maybe you should do some preprocessing in advance and store the answere.

IsraelJacobowich
Автор

what would be the space requirement for this for the 2d range tree?

jeremyculkin