Abstract:
Creation durations of a traditional octree, a hash-based octree, and our optimized hash-based octree are compared. Tree traversal and surface reconstruction times of our optimized hash-based octree approach are also compared with the pointer-based one in off-line and real-time while sculpting a 3D model. It is shown that the memory requirement and durations of our optimized approach are the lowest.