Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Mesh generation

Known as: Grid generation 
Mesh generation is the practice of generating a polygonal or polyhedral mesh that approximates a geometric domain. The term "grid generation" is… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
We report a general purpose mesh generator for creating finite-element surface or volumetric mesh from 31) binary or gray-scale… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
An essential step in scientific computing is to find a proper discretization of a continuous domain. This is the problem of mesh… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Creating a mesh is the first step in a wide range of applications, including scientific computing and computer graphics. An… Expand
  • figure 3.2
  • figure 4.1
  • figure 5.1
  • figure 6.1
  • figure 7.1
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Delaunay refinement is a technique for generating unstructured meshes of triangles for use in interpolation, the finite element… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
1. Delaunay triangulations 2. Triangle meshes 3. Combinatorial topology 4. Surface simplification 5. Delaunay tetrahedrizations 6… Expand
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Given a complex of vertices, constraining segments, and planar straight-line constraining facets in E3, with no input angle less… Expand
  • figure 1
  • figure 2
  • figure 6
  • figure 7
  • figure 9
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Triangle is a robust implementation of two-dimensional constrained Delaunay triangulation and Ruppert's Delaunay refinement… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1995
Highly Cited
1995
We present a simple new algorithm for triangulating polygons and planar straightline graphs, It provides "shape" and "size… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
For several commonly-used solution techniques for partial differential equations, the first step is to divide the problem region… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1991
Highly Cited
1991
This paper presents a new mesh generation technique, paving, which meshes arbitrary 2-D geometries with an all-quadrilateral mesh… Expand
Is this relevant?