Forum archive

OctTree

Return to forum index

• Sebastian at 2008-11-23 04:35
  Hi Ken and others
  
  I have an algorithmic question to you: I have a octree datastructure that holds a voxel model. So basically a root bounding box, then divided into (max) 8 subcubes and so on until no further division is possible.
  
  Question: if I intersect 2 octrees like this how big is the runtime ( O Notation). Im not sure about this.
  
  regards
  Sebastian
  
• Spacerat at 2008-11-25 16:57

  Re: OctTree

  You can render one octree in the other to get the intersecting voxels.
  Rendering one Octree takes about O(8^levels_octree1), seeking an element in the other takes O(levels_octree2).
  Rendering one in the other should be O( (8^levels_octree1) * levels_octree2 ).