Skip to main content
SpringerLink
Log in

Control volume meshes using sphere packing

  • Invited Talk
  • Conference paper
  • First Online:
Solving Irregularly Structured Problems in Parallel (IRREGULAR 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1457))

Abstract

We present a sphere-packing technique for Delaunay-based mesh generation, refinement and coarsening. We have previously established that a bounded radius of ratio of circumscribed sphere to smallest tetrahedra edge is sufficient to get optimal rates of convergence for approximate solutions of Poisson's equation constructed using control volume (CVM) techniques. This translates to Delaunay meshes whose dual, the Voronoi cells diagram, is well-shaped. These meshes are easier to generate in 3D than finite element meshes, as they allow for an element called a sliver.

We first support our previous results by providing experimental evidence of the robustness of the CVM over a mesh with slivers. We then outline a simple and efficient sphere packing technique to generate a 3D boundary conforming Delaunay-based mesh. We also apply our sphere-packing technique to the problem of automatic mesh coarsening. As an added benefit, we obtain a simple 2D mesh coarsening algorithm that is optimal for finite element meshes as well.

This is a joint work with Dafna Talmor (CMU), Shang-Hua Teng (UlUC), Noel Walkington (CMU), and Han Wang (CMU).

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chanderjit L. Bajaj and Tamal K. Dey. Convex decomposition of polyhedra and robustness. SIAM J. Comput., 21(2):339–364, April 1992.

    Google Scholar 

  2. M. Bern and D. Eppstein. Mesh generation and optimal triangulation. Tech. Report CSL-92-1, Xerox PARC, Palo Alto, CA, 1992.

    Google Scholar 

  3. M. Bern, S, Mitchell, and J. Ruppert. Linear-size nonobtuse triangulation of polygons. In Proc. 10th Annu. ACM Sympos. Comput. Geom., pages 221–230, 1994.

    Google Scholar 

  4. Marshall Bern, David Eppstein, and John Gilbert. Provably good mesh generation. In FOCS90, pages 231–241, St. Louis, October 1990. IEEE.

    Google Scholar 

  5. A. Brandt. Multi-level adaptive solutions to boundary value problems. Mathematics of Computation, 31:333–390, 1977.

    Google Scholar 

  6. L.P. Chew. Guaranteed-quality triangular meshes. CS 89-983, Cornell, 1989.

    Google Scholar 

  7. Tamal K. Dey, Chanderjit L. Bajaj, and Kokichi Sugihara. On good triangulations in three dimensions. In Proceedings of the ACM symposium on solid modeling and CAD/CAM Applications 1991, pages 431–441. ACM, 1991.

    Google Scholar 

  8. B. Joe. Construction of three-dimensional Delaunay triangulations using local transformations. Comput. Aided Geom. Design, 8(2):123–142, May 1991.

    Google Scholar 

  9. R. H. MacNeal. An asymmetrical finite difference network. Quarterly of Applied Math, 11:295–310, 1953.

    Google Scholar 

  10. G. L. Miller, D. Talmor, S.-H. Teng, and N. Walkington. A Delaunay based numerical method for three dimensions: generation, formulation, and partition. In Proc. 27th Annu. ACM Sympos. Theory Comput., pages 683–692, 1995.

    Google Scholar 

  11. S. A. Mitchell and S. A. Vavasis. Quality mesh generation in three dimensions. In Proceedings of the ACM Computational Geometry Conference, pages 212–221, 1992. Also appeared as Cornell C.S. TR 92-1267.

    Google Scholar 

  12. R. A. Nicolaides. Direct discretization of planar div-curl problems. SIAM J. Numer. Anal., 29(1):32–56, 1992.

    Google Scholar 

  13. Carl F. Ollivier-Gooch. Upwind acceleration of an upwind euler solver on unstructured meshes. AIAA Journal, 33(10):1822–1827, 1995.

    Google Scholar 

  14. V. T. Rajan. Optimality of the Delaunay triangulation in R d. In Proc. 7th Annu. ACM Sympos. Comput. Geom., pages 357–363, 1991.

    Google Scholar 

  15. Jim Ruppert. A new and simple algorithm for quality 2-dimensional mesh generation. In Third Annual ACM-SIAM Symposium on Discrete Algorithms, pages 83–92, 1992.

    Google Scholar 

  16. Kenji Shimada and David C. Gossard. Bubble mesh: Automated triangular meshing of non-manifold geometry by sphere packing. In Proc. 3rd Sympos. on Solid Modeling and Applications., pages 409–419, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Carnegie Mellon University, 15213, Pittsburgh, Pennsylvania

    Gary L. Miller

Authors
  1. Gary L. Miller
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alfonso Ferreira José Rolim Horst Simon Shang-Hua Teng

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Miller, G.L. (1998). Control volume meshes using sphere packing. In: Ferreira, A., Rolim, J., Simon, H., Teng, SH. (eds) Solving Irregularly Structured Problems in Parallel. IRREGULAR 1998. Lecture Notes in Computer Science, vol 1457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018533

Download citation

  • DOI: https://doi.org/10.1007/BFb0018533

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64809-3

  • Online ISBN: 978-3-540-68533-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation