A generic Delaunay triangulation algorithm for finite element meshes
\(k\)-dimensional manifoldsalgorithmconnected polygonsDelaunay trianglesgeneric Delaunay triangulation algorithminsertion patchesplanar meshrandom pointssolid meshspheresurface mesh
Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
- Automatic triangular mesh generation of trimmed parametric surfaces for finite element analysis
- Delaunay triangulation of arbitrarily shaped planar domains
- Delaunay refinement algorithms for triangular mesh generation
- Curvilinear mesh adaptation using radial basis function interpolation and smoothing
- A generic software design for Delaunay refinement meshing
- A simple algorithm for higher-order Delaunay mosaics and alpha shapes
- Automatic generation of transitional meshes.
- Generalized insertion region guides for Delaunay mesh refinement
- Three-Dimensional Delaunay Triangulations for Finite Element Approximations to a Second-Order Diffusion Operator
- A generalized Delaunay triangulation algorithm with adaptive grid size control
- Delaunay triangulations of point sets in closed Euclidean d-manifolds
- scientific article; zbMATH DE number 5239201 (Why is no real title available?)
- scientific article; zbMATH DE number 5239226 (Why is no real title available?)
- Properties of n-dimensional triangulations
- The legacy of automatic mesh generation from solid modeling
This page was built for publication: A generic Delaunay triangulation algorithm for finite element meshes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4006201)