Skip to main content
SpringerLink
Log in

An octree-based dual contouring method for triangular and tetrahedral mesh generation with guaranteed angle range

  • Original Article
  • Published:
Engineering with Computers Aims and scope Submit manuscript

Abstract

This paper presents a novel octree-based dual contouring (DC) algorithm for adaptive triangular or tetrahedral mesh generation with guaranteed angle range. First, an adaptive octree is constructed based on the input geometry. Then the octree grid points are adjusted such that we can maintain a minimum distance from the grid points to the input boundary. Finally, an improved DC method is applied to generate triangular and tetrahedral meshes. It is proved that we can guarantee the obtained triangle mesh has an angle range of (19.47°, 141.06°) for any closed smooth curve, and the tetrahedral mesh has a dihedral angle range of (12.04°, 129.25°) for any closed smooth surface. In practice, since the straight line/planar cutting plane assumption inside each octree leaf is not always satisfied, there is a small perturbation for the lower and upper bounds of the proved angle range.

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
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21

Similar content being viewed by others

References

  1. Amdahl GM (1967) Validity of the single processor approach to achieving large-scale computing capabilities. In: AFIPS Conference Proceedings, pp 483–485

  2. Borouchaki H, Hecht F, Saltel E, George PL (1995) Reasonably efficient Delaunay based mesh generator in 3 dimensions. In: 4th International meshing roundtable, pp 3–14

  3. George PL, Borouchaki H (1998) Delaunay triangulation and meshing, applications to finite elements. Hermes, Paris

    Google Scholar 

  4. Ju T, Losaasso F, Schaefer S, Warren J (2002) Dual contouring of Hermite data. ACM Trans Graph 21:339–346

    Article  Google Scholar 

  5. Labelle F, Shewchuk JR (2007) Isosurface stuffing: fast tetrahedral meshes with good dihedral angles. ACM Trans Graph 26(3):57.1–57.10

    Article  Google Scholar 

  6. Liang X, Ebeida M, Zhang Y (2009) Guaranteed-quality all-quadrilateral mesh generation with feature preservation. In: 18th International meshing roundtable, pp 45–63

  7. Liang X, Ebeida M, Zhang Y (2010) Guaranteed-quality all-quadrilateral mesh generation with feature preservation. Comput Method Appl Mech Eng 199(29–32):2072–2083

    Article  MATH  Google Scholar 

  8. Liang X, Zhang Y (2011) Hexagon-based all-quadrilateral mesh generation with guaranteed angle bounds. Comput Method Appl Mech Eng 200(23–24):2005–2020

    Article  MATH  MathSciNet  Google Scholar 

  9. Lo SH (1991) Volume discretization into tetrahedra-I. Verification and orientation of boundary surfaces. Comput Struct 39(5):493–500

    Article  MATH  Google Scholar 

  10. Lo SH (1991) Volume discretization into tetrahedra-II. 3D triangulation by advancing front approach. Comput Struct 39(5):501–511

    Article  MATH  Google Scholar 

  11. Lohner R (1996) Extensions and improvements of the advancing front grid generation technique. Commun Numer Method Eng 12:683–702

    Article  MathSciNet  Google Scholar 

  12. Lohner R, Parikh P, Gumbert C (1988) Interactive generation of unstructured grid for three dimensional problems. In: Numerical grid generation in computational fluid mechanics 88, pp 687–697

  13. Lopes A, Brodlie K (2003) Improving the robustness and accuracy of the marching cubes algorithm for isosurfacing. IEEE Trans Vis Comput Graph 9:16–29

    Article  Google Scholar 

  14. Lorensen W, Cline H (1987) Marching cubes: a high resolution 3D surface construction algorithm. In: SIGGRAPH87, vol 21. pp 163–169

  15. Pirzadeh S (1993) Unstructured viscous grid generation by advancing-layers method. AIAA-93-3453-CP AIAA pp 420–434

  16. Ruppert J (1995) A Delaunay refinement algorithm for quality 2-dimensional mesh generation. J Algorithm 18(3):548–585

    Article  MATH  MathSciNet  Google Scholar 

  17. Shephard MS, Georges MK (1991) Three-dimensional mesh generation by finite octree technique. Int J Numer Methods Eng 32:709–749

    Article  MATH  Google Scholar 

  18. Shewchuk JR (1996) Triangle: engineering a 2D quality mesh generator and Delaunay triangulator. http://www.cs.cmu.edu/quake/triangle.html

  19. Shewchuk JR (1998) Tetrahedral mesh generation by Delaunay refinement. In: SCG’98 Proceedings of the fourteenth annual symposium on Computational geometry, pp 86–95

  20. Wang J, Yu Z (2012) Feature-sensitive tetrahedral mesh generation with guaranteed quality. Comput Aided Des 44(5):400–412

    Article  Google Scholar 

  21. Westermann JR, Kobbelt L, Ertl T (1999) Real-time exploration of regular volume data by adaptive reconstruction of isosurfaces. Visual Comput 15:100–111

    Article  Google Scholar 

  22. Yerry MA, Shephard MS (1984) Three-dimensional mesh generation by modified octree technique. Int J Numer Methods Eng 20:1965–1990

    Article  MATH  Google Scholar 

  23. Zhang Y, Bajaj C (2006) Adaptive and quality quadrilateral/hexahedral meshing from volumetric Data. Comput Method Appl Mech Eng 195(9–12):942–960

    Article  MATH  MathSciNet  Google Scholar 

  24. Zhang Y, Bajaj C, Sohn B-S (2005) 3D finite element meshing from imaging data. Comput Method Appl Mech Eng 194(48–49):5083–5106

    Article  MATH  Google Scholar 

  25. Zhang Y, Hughes T, Bajaj C (2010) An automatic 3D mesh generation method for domains with multiple materials. Comput Method Appl Mech Eng 199(5–8):405–415

    Article  MATH  Google Scholar 

  26. Zhang Y, Qian J (2012) Dual contouring for domains with topology ambiguity. Comput Method Appl Mech Eng 217–220:34–45

    Google Scholar 

Download references

Acknowledgments

This research was supported in part by Y. Zhang’s NSF CAREER Award OCI-1149591, ONR-YIP award N00014-10-1-0698, ONR Grant N00014-08-1-0653, and AFOSR Grant FA9550-11-1-0346, which are gratefully acknowledged.

Author information

Authors and Affiliations

  1. Department of Mechanical Engineering, Carnegie Mellon University, Pittsburgh, PA, 15213, USA

    Xinghua Liang & Yongjie Zhang

Authors
  1. Xinghua Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yongjie Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yongjie Zhang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liang, X., Zhang, Y. An octree-based dual contouring method for triangular and tetrahedral mesh generation with guaranteed angle range. Engineering with Computers 30, 211–222 (2014). https://doi.org/10.1007/s00366-013-0328-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00366-013-0328-8

Keywords

Search

Navigation