Quadtrees (Pt II), K-D Trees, BSP Trees, AABBs vs OBBs
Автор: Bill Kerney
Загружено: 2022-04-26
Просмотров: 446
Описание:
You can skip forward if you want to pass over some debugging, but it's kind of an interesting exercise debugging a data structure, so it might be worth watching.
The second half of class we talk about two refinements of quadtrees, the k-d tree and the binary space partition.
Review of AABBs (axis-aligned bounding boxes) and OBBs (oriented bounding boxes).
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке: