Texonom
Texonom
/
Computing
Computing
/Data/Data Structure/Tree Data/Binary Tree/Search Tree/Binary search tree/
BSP Tree
Search

BSP Tree

Creator
Creator
Seonglae Cho
Created
Created
2021 Jul 24 16:25
Editor
Editor
Seonglae Cho
Edited
Edited
2024 Jul 27 16:24
Refs
Refs

Binary Space Partitioning Tree

3 Dimensional Computer graphics for improving
Rendering
performance
BSP Trees
K-D Tree
BVH
 
 
BSP Tree Notion
Binary Space Partitioning
 
 
 
레이트레이싱의 KD트리와 BVH
DXR(MicrosoftX Raytracing)의 활용이 점점 늘어나고 관심도 늘어가고 있다. DXR 자료는 점점 많아 지고 있는데, 그중에 BVH(Bounding Volume Hierarchy)라는 단어가 흔하게 등장한다. 레이트레이싱 세계에서는 이미 오래전부터 사용되던 구조인데...
레이트레이싱의 KD트리와 BVH
https://blog.hybrid3d.dev/2019-03-22-raytracing-kdtree-bvh
Binary space partitioning
In computer science, binary space partitioning (BSP) is a method for space partitioning which recursively subdivides an Euclidean space into two convex sets by using hyperplanes as partitions. This process of subdividing gives rise to a representation of objects within the space in the form of a tree data structure known as a BSP tree.
Binary space partitioning
https://en.wikipedia.org/wiki/Binary_space_partitioning
Binary space partitioning
 
 

Recommendations

Texonom
Texonom
/
Computing
Computing
/Data/Data Structure/Tree Data/Binary Tree/Search Tree/Binary search tree/
BSP Tree
Copyright Seonglae Cho