A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
From MaRDI portal
Publication:4837546
DOI10.1006/jagm.1995.1021zbMath0828.68122OpenAlexW1967337063WikidataQ60264964 ScholiaQ60264964MaRDI QIDQ4837546
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
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)
Related Items
Thread-parallel mesh improvement using face and edge swapping and vertex insertion, Numerical analysis of a synthetic jet using an automated adaptive method, Distance-sensitive planar point location, A new point creation scheme for uniform Delaunay triangulation, A generic software design for Delaunay refinement meshing, Angle-bounded 2D mesh simplification, Delaunay refinement for piecewise smooth complexes, Algorithm 995, Computing Teichmüller maps between polygons, Delaunay meshing of piecewise smooth complexes without expensive predicates, Conforming Delaunay triangulations in 3D, A novel model of conforming Delaunay triangulation for sensor network configuration, Software environment for CAD/CAE integration, Nodeless variable finite element method for heat transfer analysis by means of flux-based formulation and mesh adaptation, Generalised Voronoi tessellation for generating microstructural finite element models with controllable grain-size distributions and grain aspect ratios, Compatible connectivity augmentation of planar disconnected graphs, Multithread parallelization of LEPP-bisection algorithms, Escher-like Tilings with Weights, Active flux schemes on moving meshes with applications to geometric optics, Global Polynomial Level Sets for Numerical Differential Geometry of Smooth Closed Surfaces, Dynamic well-spaced point sets, Hybrid Voronoi mesh generation: algorithms and unsolved problems, Modeling wildfire propagation with Delaunay triangulation and shortest path algorithms, Numerical solution of a two dimensional tumour growth model with moving boundary, Quality-improved local refinement of tetrahedral mesh based on element-wise refinement switching., A model-integrated localized collocation meshless method for large scale three-dimensional heat transfer problems, Conservative interpolation between unstructured meshes via supermesh construction, Triangulating smooth submanifolds with light scaffolding, QUALITY MESHING OF POLYHEDRA WITH SMALL ANGLES, DELAUNAY REFINEMENT ALGORITHMS FOR ESTIMATING LOCAL FEATURE SIZE IN 2D AND 3D, Tuned Terminal Triangles Centroid Delaunay Algorithm for Quality Triangulation, There are simple and robust refinements (almost) as good as Delaunay, A 2D advancing-front Delaunay mesh refinement algorithm, Transformation invariant local element size specification, Adaptive multi‐resolution triangulations based on physical compression, Combining improvement and refinement techniques: 2D Delaunay mesh adaptation under domain changes, Triangulating a convex polygon with fewer number of non-standard bars, CGALmesh, On the convergence of iterative solvers for polygonal discontinuous Galerkin discretizations, 3D boundary recovery by constrained Delaunay tetrahedralization, Reprint of: Delaunay refinement algorithms for triangular mesh generation, SINK INSERTION FOR MESH IMPROVEMENT, On nondegenerate triangulation with condensation at the boundary of a domain, On the sizes of Delaunay meshes, Adaptive tetrahedral mesh generation by constrained Delaunay refinement, 2D and 3D finite element meshing and remeshing, Optimization for first order Delaunay triangulations, COMPACT REPRESENTATIONS OF SIMPLICIAL MESHES IN TWO AND THREE DIMENSIONS, CONSTRAINED QUADRILATERAL MESHES OF BOUNDED SIZE, Local polyhedra and geometric graphs, Numerical simulation of the slider air bearing problem of hard disk drives by two multidimensional upwind residual distribution schemes over unstructured triangular meshes, A POINT-PLACEMENT STRATEGY FOR CONFORMING DELAUNAY TETRAHEDRALIZATION, UNSTRUCTURED MESH GENERATION: THEORY, PRACTICE, AND PERSPECTIVES, SLIVER REMOVAL BY LATTICE REFINEMENT, A new fast hybrid adaptive grid generation technique for arbitrary two-dimensional domains, High-order unstructured curved mesh generation using the Winslow equations, The mixed-cell-complex partition-of-unity method, A sampling theory for compact sets in Euclidean space, A simple quality triangulation algorithm for complex geometries, Isotopic implicit surface meshing, Shape aware quadratures, Lepp-bisection algorithms, applications and mathematical properties, A subdomain collocation method based on Voronoi domain partition and reproducing kernel approximation, Unnamed Item, Approximating uniform triangular meshes in polygons., Grid generation and optimization based on centroidal Voronoi tessellations, A parallel solver for adaptive finite element discretizations, Delaunay refinement algorithms for triangular mesh generation, TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator, Grid refinement in the construction of Lyapunov functions using radial basis functions
