Skip to main content
SpringerLink
Log in

Truncated octree and its applications

  • Original article
  • Published:
The Visual Computer Aims and scope Submit manuscript

Abstract

Octree is a hierarchical data structure with many applications, especially in encoding unstructured point clouds. The depth of an octree is dependent of the scale of the input data and the desired resolution of the smallest voxels in the leaf nodes as well. Thus, it often requires a deep octree to maintain low level of geometric errors for large-scale sparse point clouds, which leads to high memory requirement and low access speed. This paper presents a new structure called truncated octree or T-Octree that truncates the octree by adaptively pruning the top hierarchy and represents the deep octree by a set of shallow sub-octrees. The structure is further extended to support random access of nodes and out-of-core streaming of large data sets. We also propose a variable length addressing scheme to adaptively choose the length of an octree’s node address based on the truncation level. As a result, T-Octree provides highly efficient query performance and can save storage without losing the original structure for sparse or clustered models and scenes. We demonstrate the efficacy and efficiency of the new structure on point cloud compression and scene query tasks for sparse or clustered data.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. Meagher, D.: Geometric modeling using octree encoding. Comput. Graph. Image Process. 19(2), 129–147 (1982)

    Article  Google Scholar 

  2. Porwal, S.: Quad tree-based level-of-details representation of digital globe. Def. Sci. J. 63(1), 89 (2013)

    Article  MathSciNet  Google Scholar 

  3. Zhang, Y.: The d-fcm partitioned d-bsp tree for massive point cloud data access and rendering. ISPRS J. Photogrammet. Remote Sens. 120, 25–36 (2016)

    Article  Google Scholar 

  4. Schauer, J., Nüchter, A.: Collision detection between point clouds using an efficient kd tree implementation. Adv. Eng. Inf. 29(3), 440–458 (2015)

    Article  Google Scholar 

  5. Kazhdan, M., Hoppe, H.: Screened poisson surface reconstruction. ACM Trans. Graph. (ToG) 32(3), 1–13 (2013)

    Article  Google Scholar 

  6. Yin, H., Berger, C.: Mastering data complexity for autonomous driving with adaptive point clouds for urban environments. In 2017 IEEE Intelligent Vehicles Symposium (IV), pages 1364–1371, (2017)

  7. Hackel, T., Savinov, N., Ladicky, L., Wegner, J. D., Schindler, K., Pollefeys, M .: Semantic3d. net: A new large-scale point cloud classification benchmark. arXiv preprintarXiv:1704.03847, (2017)

  8. Artale, A.M., Pedrosa, S.E., Trayford, J.W., Theuns, T., Farrow, D.J., Norberg, P., Zehavi, I., Bower, R.G., Schaller, M.: Small-scale galaxy clustering in the eagle simulation. Mon. Not. Royal Astronom. Soc. 470(2), 1771–1787 (2017)

    Article  Google Scholar 

  9. Koh, N., Jayaraman, P.K., Zheng, J.: Parallel point cloud compression using truncated octree. In 2020 International Conference on Cyberworlds (CW), pages 1–8. IEEE, (2020)

  10. Yuan, Y.W., Quan, J.C., Wu, C., et al.: Ray tracing acceleration structure based on octree adaptive volume merging. ACTA Opt. Sin. 37(1), 251–260 (2017)

    Google Scholar 

  11. Chang, J.-W., Wang, W., Kim, M.-S.: Efficient collision detection using a dual obb-sphere bounding volume hierarchy. Comput.-Aided Design 42(1), 50–57 (2010)

  12. Segura, C., Stine, Taylor., Yang, J.,: Constructive solid geometry using bsp tree. Comput.-Aided Design, pages 24–681, (2013)

  13. Chen, Y., Zhou, L., Tang, Y., Singh, J.P., Bouguila, N., Wang, C., Wang, H.: Du J?: Fast neighbor search by using revised kd tree. Inf. Sci. 472, 145–162 (2019)

    Article  Google Scholar 

  14. Ströter, D., Mueller-Roemer, J.S., Stork, A., Fellner, D.W.: Olbvh: octree linear bounding volume hierarchy for volumetric meshes. vis. comput. 36(10), 2327–2340 (2020)

  15. Wang, M., Chen, S., Yang, Q.: Design and application of bounding volume hierarchy collision detection algorithm based on virtual sphere. J. Mech. Med. Biol. 19(07), 1940044 (2019)

    Article  Google Scholar 

  16. Patel, J.M., DeWitt, D.J.: Partition based spatial-merge join. ACM Sigmod Record 25, 259–270 (1996)

    Article  Google Scholar 

  17. Tim, G., Reinhard K.,: Real-time point cloud compression. In 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pages 5087–5092. IEEE, (2015)

  18. Bruce, M., Patrick, M., James, G.,: Compression of dense and regular point clouds. In Proceedings of the 4th International Conference on Computer Graphics, Virtual Reality, Visualisation and Interaction in Africa, AFRIGRAPH ’06, pages 15–20. ACM, (2006)

  19. Huang, Y., Peng, J., Kuo, C.J., Gopi, M.: A generic scheme for progressive point cloud coding. IEEE Trans. Vis. Comput. Graph. 14(2), 440–453 (2008)

    Article  Google Scholar 

  20. Lindstrom, P.: Fixed-rate compressed floating-point arrays. IEEE Trans. vis. comput. graph. 20(12), 2674–2683 (2014)

  21. Hornung, A., Wurm, K.M., Bennewitz, M., Stachniss, C., Burgard, W.: Octomap: An efficient probabilistic 3d mapping framework based on octrees. Auton. robot. 34(3), 189–206 (2013)

    Article  Google Scholar 

  22. Sundar, H., Sampath, R.S., Biros, G.: Bottom-up construction and 2: 1 balance refinement of linear octrees in parallel. SIAM J. Sci. Comput. 30(5), 2675–2708 (2008)

    Article  MathSciNet  Google Scholar 

  23. Stocco, L., Schrack, G.: Integer dilation and contraction for quadtrees and octrees. In IEEE Pacific Rim Conference on Communications, Computers, and Signal Processing. Proceedings, pages 426–428. IEEE, (1995)

  24. Willhalm, T., Popovici, N.: Putting intel® threading building blocks to work. In Proceedings of the 1st international workshop on Multicore software engineering, pages 3–4, (2008)

  25. Hackel, T., Wegner, J.D., Savinov, N., Ladicky, L., Schindler, K., Pollefeys, M.: Large-scale supervised learning for 3d point cloud labeling: Semantic3d. net. Photogramm. Eng. Remote Sens. 84(5), 297–308 (2018)

  26. Girardeau-Montaut, D.: CloudCompare. Retrieved from CloudCompare: https://www.danielgm.net/cc. (2016)

  27. Yin, H., Berger, C.: Mastering data complexity for autonomous driving with adaptive point clouds for urban environments. In 2017 IEEE Intelligent Vehicles Symposium (IV), pages 1364–1371. IEEE, (2017)

  28. Aulinas, J., Petillot, Y.R., Salvi, J., Lladó, X.: The slam problem: a survey. CCIA 184(1), 363–371 (2008)

    Google Scholar 

  29. Taketomi, T., Uchiyama, H., Ikeda, S.: Visual slam algorithms: a survey from 2010 to 2016. IPSJ Trans. Comput. Vis. Appl. 9(1), 16 (2017)

    Article  Google Scholar 

  30. Schrack, G.: Finding neighbors of equal size in linear quadtrees and octrees in constant time. CVGIP: Image underst. 55(3), 221–230 (1992)

  31. Maderia, D., Montenegro, A., Clua, E., Lewiner, T.,: Gpu octrees and optimized search. In Proceedings of VIII Brazilian Symposium on Games and Digital Entertainment, pages 73–76, (2009)

  32. Vinkler M., Havran V., Bittner, J.,: Bounding volume hierarchies versus kd-trees on contemporary many-core architectures. In Proceedings of the 30th Spring Conference on Computer Graphics, pages 29–36, (2014)

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, Nanyang Technological University, Singapore, Singapore

    Naimin Koh, Pradeep Kumar Jayaraman & Jianmin Zheng

  2. Autodesk Inc., Singapore, Singapore

    Naimin Koh

  3. Autodesk Inc., Toronto, Canada

    Pradeep Kumar Jayaraman

Authors
  1. Naimin Koh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pradeep Kumar Jayaraman
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jianmin Zheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jianmin Zheng.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This work was supported by National Research Foundation (NRF) Singapore, under its Virtual Singapore (VSG) Programme (Award No. NRF2015VSG-AA3DCM001-018), and by the Ministry of Education, Singapore, under its MoE Tier-2 Grant (MoE 2017-T2-1-076).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Koh, N., Jayaraman, P.K. & Zheng, J. Truncated octree and its applications. Vis Comput 38, 1167–1179 (2022). https://doi.org/10.1007/s00371-021-02130-5

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00371-021-02130-5

Keywords

Search

Navigation