Unstructured grid techniques
DJ Mavriplis - Annual Review of Fluid Mechanics, 1997 - annualreviews.org
▪ Abstract An overview of the current state of the art in unstructured mesh techniques for
computational fluid dynamics is given. The topics of mesh generation and adaptation, spatial …
computational fluid dynamics is given. The topics of mesh generation and adaptation, spatial …
[图书][B] Triangulations: structures for algorithms and applications
Triangulations presents the first comprehensive treatment of the theory of secondary
polytopes and related topics. The text discusses the geometric structure behind the …
polytopes and related topics. The text discusses the geometric structure behind the …
Voronoi Diagrams.
F Aurenhammer, R Klein - Handbook of computational geometry, 2000 - books.google.com
The topic of this chapter, Voronoi diagrams, differs from other areas of computational
geometry, in that its origin dates back to the 17th century. In his book on the principles of …
geometry, in that its origin dates back to the 17th century. In his book on the principles of …
[PDF][PDF] What is a good linear finite element? interpolation, conditioning, anisotropy, and quality measures (preprint)
J Shewchuk - University of California at Berkeley, 2002 - people.eecs.berkeley.edu
When a mesh of simplicial elements (triangles or tetrahedra) is used to form a piecewise
linear approximation of a function, the accuracy of the approximation depends on the sizes …
linear approximation of a function, the accuracy of the approximation depends on the sizes …
Multi-resolution 3D approximations for rendering complex scenes
J Rossignac, P Borrel - Modeling in computer graphics: methods and …, 1993 - Springer
We present a simple, effective, and efficient technique for approximating arbitrary polyhedra.
It is based on triangulation and vertex-clustering, and produces a series of 3D …
It is based on triangulation and vertex-clustering, and produces a series of 3D …
[图书][B] Handbook of approximation algorithms and metaheuristics
TF Gonzalez - 2007 - taylorfrancis.com
Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …
Mesh generation and optimal triangulation
M Bern, D Eppstein - Computing in Euclidean geometry, 1995 - World Scientific
We survey the computational geometry relevant to finite element mesh generation. We
especially focus on optimal triangulations of geometric domains in two-and three …
especially focus on optimal triangulations of geometric domains in two-and three …
Aspects of unstructured grids and finite-volume solvers for the Euler and Navier-Stokes equations
TJ Barth - AGARD, special course on unstructured grid methods …, 1992 - ntrs.nasa.gov
One of the major achievements in engineering science has been the development of
computer algorithms for solving nonlinear differential equations such as the Navier-Stokes …
computer algorithms for solving nonlinear differential equations such as the Navier-Stokes …
Provably good mesh generation
We study several versions of the problem of generating triangular meshes for finite element
methods. We show how to triangulate a planar point set or polygonally bounded domain …
methods. We show how to triangulate a planar point set or polygonally bounded domain …
Mesh Generation.
MW Bern, PE Plassmann - Handbook of computational geometry, 2000 - books.google.com
A mesh is a discretization of a geometric domain into small simple shapes, such as triangles
or quadrilaterals in two dimensions and tetrahedra or hexahedra in three. Meshes find use …
or quadrilaterals in two dimensions and tetrahedra or hexahedra in three. Meshes find use …