- Algorithms
- >
- Combinatorial algorithms
- >
- Geometric algorithms
- >
- Mesh generation

- Applied mathematics
- >
- Algorithms
- >
- Numerical analysis
- >
- Mesh generation

- Applied mathematics
- >
- Computational mathematics
- >
- Numerical analysis
- >
- Mesh generation

- Combinatorics
- >
- Combinatorial algorithms
- >
- Geometric algorithms
- >
- Mesh generation

- Computational mathematics
- >
- Combinatorial algorithms
- >
- Geometric algorithms
- >
- Mesh generation

- Computational mathematics
- >
- Computational geometry
- >
- Geometric algorithms
- >
- Mesh generation

- Convex geometry
- >
- Polyhedra
- >
- Tessellation
- >
- Mesh generation

- Convex geometry
- >
- Polytopes
- >
- Tessellation
- >
- Mesh generation

- Differential equations
- >
- Numerical differential equations
- >
- Finite element method
- >
- Mesh generation

- Discrete mathematics
- >
- Discrete geometry
- >
- Tessellation
- >
- Mesh generation

- Elementary geometry
- >
- Euclidean plane geometry
- >
- Tessellation
- >
- Mesh generation

- Equivalence (mathematics)
- >
- Approximations
- >
- Numerical analysis
- >
- Mesh generation

- Euclidean geometry
- >
- Euclidean plane geometry
- >
- Tessellation
- >
- Mesh generation

- Euclidean solid geometry
- >
- Polyhedra
- >
- Tessellation
- >
- Mesh generation

- Fields of geometry
- >
- Computational geometry
- >
- Geometric algorithms
- >
- Mesh generation

- Fields of geometry
- >
- Discrete geometry
- >
- Tessellation
- >
- Mesh generation

- Fields of mathematics
- >
- Computational mathematics
- >
- Numerical analysis
- >
- Mesh generation

- Geometric shapes
- >
- Polytopes
- >
- Tessellation
- >
- Mesh generation

- Geometry
- >
- Symmetry
- >
- Tessellation
- >
- Mesh generation

- Linear programming
- >
- Polyhedra
- >
- Tessellation
- >
- Mesh generation

- Mathematical analysis
- >
- Fields of mathematical analysis
- >
- Numerical analysis
- >
- Mesh generation

- Mathematical logic
- >
- Algorithms
- >
- Numerical analysis
- >
- Mesh generation

- Mathematical relations
- >
- Approximations
- >
- Numerical analysis
- >
- Mesh generation

- Mathematics
- >
- Mathematics and art
- >
- Tessellation
- >
- Mesh generation

- Multi-dimensional geometry
- >
- Polytopes
- >
- Tessellation
- >
- Mesh generation

- Numerical analysis
- >
- Numerical differential equations
- >
- Finite element method
- >
- Mesh generation

- Numerical analysis
- >
- Structural analysis
- >
- Finite element method
- >
- Mesh generation

- Polytopes
- >
- Polyhedra
- >
- Tessellation
- >
- Mesh generation

- Theoretical computer science
- >
- Algorithms
- >
- Numerical analysis
- >
- Mesh generation

- Theoretical computer science
- >
- Mathematics of computing
- >
- Numerical analysis
- >
- Mesh generation

- Topological spaces
- >
- Polytopes
- >
- Tessellation
- >
- Mesh generation

Polygon mesh

In 3D computer graphics and solid modeling, a polygon mesh is a collection of vertices, edges and faces that defines the shape of a polyhedral object. The faces usually consist of triangles (triangle

Regular grid

A regular grid is a tessellation of n-dimensional Euclidean space by congruent parallelotopes (e.g. bricks). Its opposite is irregular grid. Grids of this type appear on graph paper and may be used in

Mesh generation

Mesh generation is the practice of creating a mesh, a subdivision of a continuous geometric space into discrete geometric and topological cells.Often these cells form a simplicial complex.Usually the

Delaunay refinement

In mesh generation, Delaunay refinement are algorithms for mesh generation based on the principle of adding Steiner points to the geometry of an input to be meshed, in a way that causes the Delaunay t

Parallel mesh generation

Parallel mesh generation in numerical analysis is a new research area between the boundaries of two scientific computing disciplines: computational geometry and parallel computing. Parallel mesh gener

Unstructured grid

An unstructured grid or irregular grid is a tessellation of a part of the Euclidean plane or Euclidean space by simple shapes, such as triangles or tetrahedra, in an irregular pattern. Grids of this t

Marching tetrahedra

Marching tetrahedra is an algorithm in the field of computer graphics to render implicit surfaces. It clarifies a minor ambiguity problem of the marching cubes algorithm with some cube configurations.

Principles of grid generation

No description available.

Laplacian smoothing

Laplacian smoothing is an algorithm to smooth a polygonal mesh. For each vertex in a mesh, a new position is chosen based on local information (such as the position of neighbours) and the vertex is mo

Image-based meshing

Image-based meshing is the automated process of creating computer models for computational fluid dynamics (CFD) and finite element analysis (FEA) from 3D image data (such as magnetic resonance imaging

Tessellation (computer graphics)

In computer graphics, tessellation refers to the dividing of datasets of polygons (sometimes called vertex sets) presenting objects in a scene into suitable structures for rendering. Especially for re

Marching cubes

Marching cubes is a computer graphics algorithm, published in the 1987 SIGGRAPH proceedings by Lorensen and Cline, for extracting a polygonal mesh of an isosurface from a three-dimensional discrete sc

Stretched grid method

The stretched grid method (SGM) is a numerical technique for finding approximate solutions of various mathematical and engineering problems that can be related to an elastic grid behavior.In particula

Types of mesh

A mesh is a representation of a larger geometric domain by smaller discrete cells. Meshes are commonly used to compute solutions of partial differential equations and render computer graphics, and to

Volume mesh

In 3D computer graphics and modeling, volumetric meshes are a polygonal representation of the interior volume of an object. Unlike polygon meshes, which represent only the surface as polygons, volumet

Triangle mesh

In computer graphics, a triangle mesh is a type of polygon mesh. It comprises a set of triangles (typically in three dimensions) that are connected by their common edges or vertices. Many graphics sof

© 2023 Useful Links.