Provably good mesh generation
From MaRDI portal
It is shown how to triangulate a planar point set with (a) triangles of bounded aspect ratio, (b) triangles having no obtuse angles, (c) how to triangulate a point set of arbitrary dimension with simplices of bounded aspect ratio, and (d) how to produce a linear-size Delaunay triangulation of a multidimensional point set by adding a linear number of extra points. All the triangulations have optimal size within a constant factor and run in optimal time.
Recommendations
Cites work
- A brief review of techniques for generating irregular computational grids
- Condition of finite element matrices generated from nonuniform meshes.
- Constrained Delaunay triangulations
- Generalized Delaunay triangulation for planar graphs
- Generalized Nested Dissection
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3438337 (Why is no real title available?)
- scientific article; zbMATH DE number 742947 (Why is no real title available?)
- Nonobtuse triangulation of polygons
- On Optimal Interpolation Triangle Incidences
- On the Angle Condition in the Finite Element Method
- POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS
- Triangulating a nonconvex polytope
Cited in
(69)- Bounded flatness in Q-triangulated regular n-simplexes
- Relationship between tetrahedron shape measures
- Superior mesh quality with automatic node mergers
- Layer based solutions for constrained space-time meshing.
- Tiling space and slabs with acute tetrahedra.
- Delaunay refinement algorithms for triangular mesh generation
- Amortized analysis of smooth quadtrees in all dimensions
- High-quality 2D mesh generation without obtuse and small angles
- Approximating uniform triangular meshes in polygons.
- Quadtree, ray shooting and approximate minimum weight Steiner triangulation
- Linear-size nonobtuse triangulation of polygons
- Algorithms for proximity problems in higher dimensions
- Error reduction of the adaptive conforming and nonconforming finite element methods with red-green refinement
- Dynamic well-spaced point sets
- Angle-bounded 2D mesh simplification
- There are simple and robust refinements (almost) as good as Delaunay
- Reprint of: Delaunay refinement algorithms for triangular mesh generation
- Isogeometric triangular Bernstein-Bézier discretizations: automatic mesh generation and geometrically exact finite element analysis
- Triangulating a convex polygon with fewer number of non-standard bars
- Strategies for polyhedral surface decomposition: an experimental study.
- 3D finite element meshing from imaging data
- 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001)
- Distance-sensitive planar point location
- Parameterization of planar curves immersed in triangulations with application to finite elements
- Universal meshes: a method for triangulating planar curved domains immersed in nonconforming meshes
- Simulating curvilinear crack propagation in two dimensions with universal meshes
- High‐order methods for low Reynolds number flows around moving obstacles based on universal meshes
- Gabriel triangulations and angle-monotone graphs: local routing and recognition
- PITCHING TENTS IN SPACE-TIME: MESH GENERATION FOR DISCONTINUOUS GALERKIN METHOD
- Nonobtuse triangulations of PSLGs
- A new fast hybrid adaptive grid generation technique for arbitrary two-dimensional domains
- A simple quality triangulation algorithm for complex geometries
- Delaunay Triangulation of Imprecise Points Simplified and Extended
- Convergence analysis of a locally stabilized collocated finite volume scheme for incompressible flows
- On a stabilized colocated Finite Volume scheme for the Stokes problem
- PARALLEL DELAUNAY REFINEMENT: ALGORITHMS AND ANALYSES
- POINTERLESS IMPLEMENTATION OF HIERARCHICAL SIMPLICIAL MESHES AND EFFICIENT NEIGHBOR FINDING IN ARBITRARY DIMENSIONS
- ON GOOD TRIANGULATIONS IN THREE DIMENSIONS
- Geometric Separators for Finite-Element Meshes
- Hexahedral meshing of non-linear volumes using Voronoi faces and edges
- On the growth of Lebesgue constants for convex polyhedra
- PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS
- DATA GENERATION FOR GEOMETRIC ALGORITHMS ON NON-UNIFORM DISTRIBUTIONS
- Quality Mesh Generation in Higher Dimensions
- Dynamic smooth compressed quadtrees
- Universal meshes for smooth surfaces with no boundary in three dimensions
- Construction and Local Routing for Angle-Monotone Graphs
- Minimum weight convex Steiner partitions
- QUALITY MESHING OF POLYHEDRA WITH SMALL ANGLES
- Isotopic implicit surface meshing
- Uniformly acute triangulations of polygons
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended
- A shape optimization approach for simulating contact of elastic membranes with rigid obstacles
- Skeleton based tetrahedralization of surface meshes
- Dual complexes of cubical subdivisions of \({\mathbb{R}}^{n}\)
- An upper bound for conforming Delaunay triangulations
- Sign-preserving of principal eigenfunctions in P1 finite element approximation of eigenvalue problems of second-order elliptic operators
- Sparse Voronoi refinement
- A study on Delaunay terminal edge method
- A study on size-optimal longest edge refinement algorithms
- Diamond-kite meshes: adaptive quadrilateral meshing and orthogonal circle packing
- Quadrilateral meshes with bounded minimum angle
- Mesh smoothing algorithms for complex geometric domains
- An analysis of Shewchuk's Delaunay refinement algorithm
- Hexagonal Delaunay triangulation
- Optimal triangulation of polygons
- Spectral partitioning works: planar graphs and finite element meshes
- Near-linear-time deterministic plane Steiner spanners for well-spaced point sets
- Off-centers: A new type of Steiner points for computing size-optimal quality-guaranteed Delaunay triangulations
This page was built for publication: Provably good mesh generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1329150)
