Understanding the oct-tree (Using vtkOctreePointLocator as an example)

preview_player
Показать описание
This video presents the basic idea of the oct-tree and how it is implemented in VTK.

Basic ideas: 00:15
Example based on Paraview: 03:20
VTK implementation: 16:05
  1. 5MinsSCTalk
Рекомендации по теме
Understanding the oct-tree 0:21:03

Understanding the oct-tree (Using vtkOctreePointLocator as an example)

Octree algorithm visualization 0:06:35

Octree algorithm visualization & explanation

octree test1 0:00:11

octree test1

UFO-CFD (octree) VTK 0:06:52

UFO-CFD (octree) VTK solution restart

Spatial Data Structure 0:03:00

Spatial Data Structure - Quadtree

Octree Raycasting Demo 0:06:01

Octree Raycasting Demo

Dividing 3D Space 0:09:59

Dividing 3D Space into an Octree

Data Structure 2 0:04:36

Data Structure 2 || Presentation 1 || Octrees

Represent an octree 0:01:56

Represent an octree as a binary tree of thrice the depth?

ICRA2021 NDT-Transformer: Large-Scale 0:06:36

ICRA2021 NDT-Transformer: Large-Scale 3D Point Cloud Localisation using the NDT Representation

Quadtree Neighbours 0:02:34

Quadtree Neighbours

Galaxy generation and 0:11:08

Galaxy generation and Octrees

Jay Karhade - 0:32:50

Jay Karhade - Deep Compression for Dense Point Cloud Maps (PRS 1.2)

computer graphics - 0:35:44

computer graphics - spatial structures

Unit 8-2 - 0:16:42

Unit 8-2 - Visibility: Object Space Methods - Part 2

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

how are we going to index the octree or cube at 15:56 if there are more levels ore subdivision in current level
for ex we have like 64 divisions or level 3 of octree (so we just divided each cube one more time )
then how are we going to index those 64 division

kunalgupta
join shbcf.ru