An Advancing Front Delaunay Triangulation Algorithm Designed for Robustness

Abstract

A new algorithm is described for generating an unstructured mesh about an arbitrary two-dimensional configuration. Mesh points are generated automatically by the algorithm in a manner which ensures a smooth variation of elements, and the resulting triangulation constitutes the Delaunay triangulation of these points. The algorithm combines the mathematical elegance and efficiency of Delaunay triangulation algorithms with the desirable point placement features, boundary integrity, and robustness traditionally associated with advancing-front-type mesh generation strategies. The method offers increased robustness over previous algorithms in that it cannot fail regardless of the initial boundary point distribution and the prescribed cell size distribution throughout the flow-field. Triangulation; unstructured meshes.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1992
Accession Number
ADA257277

Entities

People

  • D. J. Mavriplis

Tags

Communities of Interest

  • Air Platforms
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Boundaries
  • Cell Size
  • Computational Fluid Dynamics
  • Demographic Cohorts
  • Efficiency
  • Engineering
  • Equations
  • Flow
  • Flow Fields
  • Fluid Dynamics
  • Geometry
  • Physics
  • Poisson Equation
  • Three Dimensional
  • Trees (Data Structures)
  • Triangulation
  • Two Dimensional

Readers

  • Approximation Theory.
  • Computational Fluid Dynamics (CFD)