Live briefing
Everything about Octree
Data structure in computer science
An octree is a tree data structure in which each internal node has exactly eight children. Octrees are most often used to partition a three-dimensional space by recursively subdividing it into eight octants. Octrees are the three-dimensional analog of quadtrees. The word is derived from oct + tree. Octrees are often used in 3D graphics and 3D game engines. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: OctreeA 5-minute orientation
- Skim a recent paper: Octree-GS: Towards Consistent Real-time Rendering with LOD-Structured 3D GaussiansInfluential work since 2022
- Pick up a classic book: Computational Visual MediaThe most-reprinted book on the subject
- Read the landmark paper: Geometric modeling using octree encodingCited 1,047 times
- Go sideways: QuadtreeA closely related topic
- Go sideways: Z-order curveA closely related topic
📖 Definitions
Noun A treelike data structure each of whose nodes has up to eight children, most often used to partition a three-dimensional space by recursively subdividing it.
🏆 Landmark papers (most cited)
Geometric modeling using octree encoding
Octree-based region growing for point cloud segmentation
Automatic three‐dimensional mesh generation by the modified‐octree technique
Automatic three‐dimensional mesh generation by the finite octree technique
Simulating water and smoke with an octree data structure
Rapid Octree Construction from Image Sequences
Simulation of primary atomization with an octree adaptive mesh refinement and VOF method
OctAttention: Octree-Based Large-Scale Contexts Model for Point Cloud Compression
🆕 Influential since 2022
Octree-GS: Towards Consistent Real-time Rendering with LOD-Structured 3D Gaussians
OctFormer: Octree-based Transformers for 3D Point Clouds
Dual octree graph networks for learning adaptive volumetric shape representations
Semantic OcTree Mapping and Shannon Mutual Information Computation for Robot Exploration
Improved lazy theta∗ algorithm based on octree map for path planning of UAV
📚 Books worth reading
Computational Visual MediaShi-Min Hu · 2012
Grid Generation and Adaptive AlgorithmsMarshall W. Bern · 1999- 📕Octree construction for imagingRichard J. Millar · 1989
- 📕An Octree Solution to Conservation-laws over Arbitrary Regions (oscar) with applications to aircraft aerodynamicsEric F. Charlton · 1997
Practical global illumination with irradiance cachingJaroslav Křivánek · 2009
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Quadtree A quadtree is a tree data structure in which each internal node has exactly four children. Quadtrees are the two-dimensional analog of octrees and are…
- Z-order curve In mathematical analysis and computer science, functions which are Z-order, Lebesgue curve, Morton space-filling curve, Morton order or Morton code map…
- Color quantization In computer graphics, color quantization or color image quantization is quantization applied to color spaces; it is a process that reduces the number of…
- Scene graph A scene graph is a hierarchical data structure commonly used by vector-based graphics editing applications and modern computer games, which cascades the…
- PH-tree The PH-tree is a tree data structure used for spatial indexing of multi-dimensional data (keys) such as geographical coordinates, points, feature vectors…
- Color depth In computer graphics, color depth, also known as bit depth, is the number of bits used to express the color of either a single pixel, or a single color…
- 3D lookup table In the film and graphics industries, 3D lookup tables (3D LUTs) are used for color grading and for mapping one color space to another. They are commonly…
- Color histogram In image processing and photography, a color histogram is a representation of the distribution of colors in an image. For digital images, a color histogram…