Research Article

Isotropic conforming refinement of quadrilateral and hexahedral meshes using two-refinement templates

  1. Mohamed S. Ebeida1,*,
  2. Anjul Patney2,
  3. John D. Owens2,
  4. Eric Mestreau3,†

Article first published online: 3 MAY 2011

DOI: 10.1002/nme.3207

Issue

International Journal for Numerical Methods in Engineering

International Journal for Numerical Methods in Engineering

Volume 88, Issue 10, pages 974–985, 9 December 2011

Additional Information

How to Cite

Ebeida, M. S., Patney, A., Owens, J. D. and Mestreau, E. (2011), Isotropic conforming refinement of quadrilateral and hexahedral meshes using two-refinement templates. Int. J. Numer. Meth. Engng., 88: 974–985. doi: 10.1002/nme.3207

Author Information

  1. 1

    Sandia National Laboratories, P.O. Box 5800, Albuquerque, NM 87185, U.S.A.

  2. 2

    Department of Electrical and Computer Engineering, University of California Davis, One Shields Avenue, Davis, CA 95616, U.S.A.

  3. 3

    Naval Research Laboratory, Physical Acoustics Branch, Code 7130, U.S.A.

  1. †

    On contract from Global Strategies Group, North America, Washington, DC 20375, U.S.A.

*Sandia National Laboratories, P.O. Box 5800, Albuquerque, NM 87185, U.S.A.

  1. †

    On contract from Global Strategies Group, North America, Washington, DC 20375, U.S.A.

Publication History

  1. Issue published online: 7 NOV 2011
  2. Article first published online: 3 MAY 2011
  3. Manuscript Accepted: 10 MAR 2011
  4. Manuscript Revised: 7 JUL 2010
  5. Manuscript Received: 16 OCT 2009

SEARCH

SEARCH BY CITATION

ARTICLE TOOLS

View Full Article (HTML) Get PDF (619K)

Keywords:

  • conforming refinement;
  • adaptive refinement;
  • two-refinement templates;
  • fast dynamic remeshing;
  • CFD;
  • GPGPU

Abstract

This paper presents three automated algorithms for isotropic, conforming refinement of all-quadrilateral and all-hexahedral meshes. These algorithms are based on the two-refinement templates introduced by Schneiders. However, we introduce a novel technique to choose the appropriate refinement template locally. This enables efficient implementation of the proposed algorithms, even in parallel. The proposed algorithms can handle refined regions of complicated geometry and do not suffer from concavity restrictions associated with the three-refinement methods currently dominating the literature. Several application examples show the strength of these new algorithms in problems that require fast dynamic remeshing such as computational fluid dynamics and computer graphics. Copyright © 2011 John Wiley & Sons, Ltd.

View Full Article (HTML) Get PDF (619K)