Skip to main content
Log in

Fast and dynamic generation of linear octrees for geological bodies under hardware acceleration

  • Research Paper
  • Published:
Science in China Series D: Earth Sciences Aims and scope Submit manuscript

Abstract

In the application of 3D Geoscience Modeling, we often need to generate the volumetric representations of geological bodies from their surface representations. Linear octree, as an efficient and easily operated volumetric model, is widely used in 3D Geoscience Modeling. This paper proposes an algorithm for fast and dynamic generation of linear octrees of geological bodies from their surface models under hardware acceleration. The Z-buffers are used to determine the attributes of octants and voxels in a fast way, and a divide-and-conquer strategy is adopted. A stack structure is exploited to record the subdivision, which allows generating linear octrees dynamically. The algorithm avoids large-scale sorting process and bypasses the compression in linear octrees generation. Experimental results indicate its high efficiency in generating linear octrees for large-scale geologic bodies.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Fang S, Chen H. Hardware accelerated voxelization. Comp Grap, 2000, 24: 433–442

    Article  Google Scholar 

  2. Dong Z, Chen W, Bao H, et al. Real-time voxelization for complex polygonal models. In: Proceedings of 12th Pacific Conference on Computer Graphics and Applications. IEEE Comp Soc, 2004. 43–50

  3. Gargantini I. Linear octtrees for fast processing of three dimensional objects. Comp Grap Image Proc, 1982, 20: 365–374

    Article  Google Scholar 

  4. Jiang Y D. Set operations between linear octrees. Comp Geosci, 1996, 22: 509–516

    Article  Google Scholar 

  5. Boyse J W. Interference detection among solids and surfaces. Communication ACM, 1979, 22: 3–9

    Article  Google Scholar 

  6. Chazelle B M. Convex partitions of polyhedra: A lower bound and worst-case optimal algorithm. SIAM J Comp, 1984, 13: 488–507

    Article  Google Scholar 

  7. Chazelle B M. Strategies for polyhedral surface decomposition: An experimental study. Comp Geom Theory Appl, 1997, 7:327–342

    Google Scholar 

  8. Jiang Y D. Block model conversion using binary space partitioning trees. Comp Geosci, 1996, 22: 409–417

    Article  Google Scholar 

  9. Tamminen M. Efficient octree conversion by connectivity labeling. Comp Grap, 1984, 18: 43–51

    Article  Google Scholar 

  10. Hecquard J. Connected component labeling with linear octree. Pattern Recog, 1991, 24: 515–531

    Article  Google Scholar 

  11. Atkinson H H, Gargantini I, Walsh T R S. Filling by quadrants or octants. Comp Vision Grap Image Proc, 1986, 33: 138–155

    Article  Google Scholar 

  12. Yang S, Lin T. A new linear octree construction by filling algorithms. In: Proceedings of 10th Annual International Phoenix Conference on Computer and Communications. Piscataway: IEEE, 1991. 740–746

    Chapter  Google Scholar 

  13. Mark D, Abel D. Linear quadtree storage from vector presentation of polygons. IEEE Trans Pattern Analysis and Machine Intelligence, 1985, 7: 344–349

    Article  Google Scholar 

  14. Dunstan S P, Mill A J B. Spatial indexing of geologic models using linear octrees. Comp Geosci, 1989, 15: 1291–1301

    Article  Google Scholar 

  15. Cao T, Liu Z. Quick encoding compression algorithm of octree for modeling three dimensional GIS (in Chinese). J Image Grap, 2002, 7: 50–54

    Google Scholar 

  16. Zhou D, Yang R. An optimal construction algorithm for linear octrees (in Chinese). Chinese J Comp, 1993, 16: 281–286

    Google Scholar 

  17. Wang C, Wang H, Zhou D. An optimal construction algorithm for linear octree. In: Proceedings of the International Conference on Imaging Science, Systems and Technology, CISST’04. Las Vegas: CSREA Press, 2004. 330–335

    Google Scholar 

  18. Shaffer C A, Samet H. Optimal quadtree construction Algorithms. Comp Vision Grap Image Proc, 1987, 37: 402–419

    Article  Google Scholar 

  19. Foley D J, Van Dam A, Feiner S K, et al. Computer Graphics: Principles and Practice. 2nd ed. Reading, MA: Addison-Wesley, 1992. 668–672

    Google Scholar 

  20. Karabassi E, Papaioannou G, Theoharis T. A fast depth-buffer-based voxelization algorithm. ACM J Grap Tools, 1999, 4: 5–10

    Google Scholar 

  21. Orenstein J A. Spatial query processing in an objectoriented database system. In: Proceedings of ACM SIGMOD. New York: ACM, 1986. 326–336

    Google Scholar 

  22. Passalis G, Kakadiaris I A, Theoharis T. Efficient hardware voxelization. In: Proceedings of the Computer Graphics International, CGI’04. IEEE Comp Soc, 2004. 374–377

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to LiQiang Zhang.

Additional information

This study was supported by National Natural Science Foundation of China (Grant No. 60502008), Hi-tech Research and Development Program of China (Grant Nos. 2006AA12Z220 and 2007AA12Z226), and Program for New Century Excellent Talents in University (Grant No. NCET-07-0099).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Deng, H., Zhang, L., Mao, X. et al. Fast and dynamic generation of linear octrees for geological bodies under hardware acceleration. Sci. China Ser. D-Earth Sci. 53, 113–119 (2010). https://doi.org/10.1007/s11430-009-0202-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11430-009-0202-0

Keywords

Navigation