Содержание
- 2. Pointer-based Representation
- 3. Linear Octree Assign a unique key (locational code) to each node Represent an octree as a
- 4. Locational code The code for each node is of the same length (zero-padded) Level of the
- 5. Octree and Linear Octree Base-4 codes
- 6. Observation When we sort the leaf nodes according to their locational codes (as binary scalars), the
- 7. Simple and Efficient Traversal Methods for Quadtrees and Octrees Frisken and Perry 2002 (MERL) Usually locational
- 8. Representation Depth of tree: N_LEVELS Level of root: N_LEVELS-1 Level of smallest possible cell: 0 Locational
- 9. Point Location 0.55 Binary(trunc(0.55*32)) =binary(17) = 010001
- 10. Region Location (1) Code(0.31)=001001 Code(0.65)=010101 Xor =011100 [0.31, 0.65)
- 11. Region Location (2) Code(0.31)=001001 Code(0.36)=001010 Xor =000011
- 13. Скачать презентацию