Octrees from range data

• [Pulli et al. ’97] Project cubes to depth map

  • All points in hex. behind far cube vtx => empty
  • If points in hexagon in front => cube inside obj
  • Else, cube is boundary (subdivide)
  • Can accelerate using 2D min/max quadtrees.
  • Hint for voxel grid resolution

Previous slide

Next slide

Back to first slide

View graphic version