A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation

DOI10.1006/JAGM.1995.1021zbMATH Open0828.68122OpenAlexW1967337063WikidataQ60264964 ScholiaQ60264964MaRDI QIDQ4837546FDOQ4837546

Authors: Jim Ruppert 

Publication date: 3 July 1995

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/10b5091c6772f9ffb93bc6ee625eb799b6e9da75

Recommendations

• A 2D advancing-front Delaunay mesh refinement algorithm
• Generalized two-dimensional Delaunay mesh refinement
• ASPECTS OF 2-D DELAUNAY MESH GENERATION
• An improved procedure for 2D unstructured Delaunay mesh generation
• scientific article; zbMATH DE number 437532
• Delaunay refinement algorithms for triangular mesh generation
• Interleaving Delaunay refinement and optimization for 2D triangle mesh generation
• Fully Generalized Two-Dimensional Constrained Delaunay Mesh Refinement
• Reprint of: Delaunay refinement algorithms for triangular mesh generation

zbMATH Keywords

Delaunay triangulation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Cited In (98)

• Algorithm 995: An efficient parallel anisotropic Delaunay mesh generator for two-dimensional finite element analysis
• A generic software design for Delaunay refinement meshing
• Escher-like tilings with weights
• Grid refinement in the construction of Lyapunov functions using radial basis functions
• Multithread parallelization of LEPP-bisection algorithms
• QUALITY MESHING OF POLYHEDRA WITH SMALL ANGLES
• On nondegenerate triangulation with condensation at the boundary of a domain
• Thread-parallel mesh improvement using face and edge swapping and vertex insertion
• COMPACT REPRESENTATIONS OF SIMPLICIAL MESHES IN TWO AND THREE DIMENSIONS
• CGALmesh: a generic framework for Delaunay mesh generation
• Title not available (Why is that?)
• Lepp-bisection algorithms, applications and mathematical properties
• Delaunay refinement for piecewise smooth complexes
• A time efficient Delaunay refinement algorithm
• Compatible connectivity augmentation of planar disconnected graphs
• A POINT-PLACEMENT STRATEGY FOR CONFORMING DELAUNAY TETRAHEDRALIZATION
• Distance-sensitive planar point location
• Quality-improved local refinement of tetrahedral mesh based on element-wise refinement switching.
• Conservative interpolation between unstructured meshes via supermesh construction
• Combining improvement and refinement techniques: 2D Delaunay mesh adaptation under domain changes
• Isotopic implicit surface meshing
• An improved procedure for 2D unstructured Delaunay mesh generation
• Reprint of: Delaunay refinement algorithms for triangular mesh generation
• A 2D advancing-front Delaunay mesh refinement algorithm
• Title not available (Why is that?)
• Modeling wildfire propagation with Delaunay triangulation and shortest path algorithms
• Adaptive tetrahedral mesh generation by constrained Delaunay refinement
• Conforming Delaunay triangulations in 3D
• Delaunay Triangular Meshes in Convex Polygons
• The mixed-cell-complex partition-of-unity method
• Provably good mesh generation
• Software environment for CAD/CAE integration
• Nodeless variable finite element method for heat transfer analysis by means of flux-based formulation and mesh adaptation
• Quality Mesh Generation in Higher Dimensions
• LATIN 2004: Theoretical Informatics
• Local polyhedra and geometric graphs
• SINK INSERTION FOR MESH IMPROVEMENT
• UNSTRUCTURED MESH GENERATION: THEORY, PRACTICE, AND PERSPECTIVES
• A model-integrated localized collocation meshless method for large scale three-dimensional heat transfer problems
• Delaunay meshing of piecewise smooth complexes without expensive predicates
• Hybrid Voronoi mesh generation: algorithms and unsolved problems
• A novel model of conforming Delaunay triangulation for sensor network configuration
• Optimization for first order Delaunay triangulations
• A subdomain collocation method based on Voronoi domain partition and reproducing kernel approximation
• ON GOOD TRIANGULATIONS IN THREE DIMENSIONS
• Delaunay refinement algorithms for triangular mesh generation
• Grid generation and optimization based on centroidal Voronoi tessellations
• A parallel solver for adaptive finite element discretizations
• A generic Delaunay triangulation algorithm for finite element meshes
• ?Ultimate? robustness in meshing an arbitrary polyhedron
• High-order unstructured curved mesh generation using the Winslow equations
• Numerical analysis of a synthetic jet using an automated adaptive method
• Interleaving Delaunay refinement and optimization for 2D triangle mesh generation
• Numerical simulation of the slider air bearing problem of hard disk drives by two multidimensional upwind residual distribution schemes over unstructured triangular meshes
• A sampling theory for compact sets in Euclidean space
• A robust 2-refinement algorithm in octree or rhombic dodecahedral tree based all-hexahedral mesh generation
• Triangulating smooth submanifolds with light scaffolding
• A time-optimal delaunay refinement algorithm in two dimensions
• SVR: Practical engineering of a fast 3D meshing algorithm
• Approximating uniform triangular meshes in polygons.
• 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001)
• TetGen, a Delaunay-based quality tetrahedral mesh generator
• Transformation invariant local element size specification
• A fast mesh generation algorithm with point-by-point Delaunay insertion
• Generating well-shaped \(d\)-dimensional Delaunay meshes.
• CONSTRAINED QUADRILATERAL MESHES OF BOUNDED SIZE
• Numerical solution of a two dimensional tumour growth model with moving boundary
• DELAUNAY REFINEMENT ALGORITHMS FOR ESTIMATING LOCAL FEATURE SIZE IN 2D AND 3D
• Skeleton based tetrahedralization of surface meshes
• Active flux schemes on moving meshes with applications to geometric optics
• Size Competitive Meshing Without Large Angles
• There are simple and robust refinements (almost) as good as Delaunay
• A simple quality triangulation algorithm for complex geometries
• Angle-bounded 2D mesh simplification
• On the convergence of iterative solvers for polygonal discontinuous Galerkin discretizations
• Meshes preserving minimum feature size
• Triangulating a convex polygon with fewer number of non-standard bars
• Triangulation on reconfigurable meshes: A natural decomposition approach
• Global Polynomial Level Sets for Numerical Differential Geometry of Smooth Closed Surfaces
• 3D boundary recovery by constrained Delaunay tetrahedralization
• On the sizes of Delaunay meshes
• DATA GENERATION FOR GEOMETRIC ALGORITHMS ON NON-UNIFORM DISTRIBUTIONS
• Adaptive multi‐resolution triangulations based on physical compression
• Generalised Voronoi tessellation for generating microstructural finite element models with controllable grain-size distributions and grain aspect ratios
• A new fast hybrid adaptive grid generation technique for arbitrary two-dimensional domains
• Guaranteed-quality triangular mesh generation for domains with curved boundaries
• Global balancing of a triangular mesh
• Construction of sparse well-spaced point sets for quality tetrahedralizations
• Computing Teichmüller maps between polygons
• Dynamic well-spaced point sets
• A note on the rate of convergence of integration schemes for closed surfaces
• Algorithm for generating a conformal quasi-hierarchical triangular mesh that weakly \(\delta\)-approximates given polygonal lines
• Title not available (Why is that?)
• Shape aware quadratures
• A new point creation scheme for uniform Delaunay triangulation
• Tuned terminal triangles centroid Delaunay algorithm for quality triangulation
• SLIVER REMOVAL BY LATTICE REFINEMENT
• Approximate shape quality mesh generation

This page was built for publication: A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4837546)