scientific article; zbMATH DE number 437532
From MaRDI portal
Publication:3140404
Recommendations
- A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
- A simple coordinate determination scheme for two-dimensional mesh generation
- An improved procedure for 2D unstructured Delaunay mesh generation
- A simple, adaptable 2D mesh generation package
- A new mesh generation scheme for arbitrary planar domains
- A new concept in two‐dimensional auto‐adaptative mesh generation
- A two-dimensional adaptive mesh generation method
- ASPECTS OF 2-D DELAUNAY MESH GENERATION
- On 2D structured mesh generation by using mappings
Cited in
(61)- Delaunay triangulation of arbitrarily shaped planar domains
- Provably good mesh generation
- Combinatorial aspects of geometric graphs
- An improved procedure for 2D unstructured Delaunay mesh generation
- Generating well-shaped \(d\)-dimensional Delaunay meshes.
- Delaunay refinement algorithms for triangular mesh generation
- Thread-parallel mesh improvement using face and edge swapping and vertex insertion
- Amortized analysis of smooth quadtrees in all dimensions
- High-quality 2D mesh generation without obtuse and small angles
- An automatic adaptive meshing technique for Delaunay triangulations
- Triangulation on reconfigurable meshes: A natural decomposition approach
- Linear-size nonobtuse triangulation of polygons
- An optimal bound for high-quality conforming triangulations
- An isotropic unstructured mesh generation method based on a fluid relaxation analogy
- A 2D advancing-front Delaunay mesh refinement algorithm
- Reprint of: Delaunay refinement algorithms for triangular mesh generation
- Shape matching and modeling using skeletal context
- New longest-edge algorithms for the refinement and/or improvement of unstructured triangulations
- Continuous amortization and extensions: with applications to bisection-based root isolation
- Tetrahedral mesh generation using Delaunay refinement with non-standard quality measures
- Ear-slicing and quality triangulation
- Nonobtuse triangulations of PSLGs
- Well-centered triangulation
- A simple quality triangulation algorithm for complex geometries
- Tuned terminal triangles centroid Delaunay algorithm for quality triangulation
- Algorithm for generating a conformal quasi-hierarchical triangular mesh that weakly -approximates given polygonal lines
- Triangular meshes for regions of complicated shape
- Delaunay Triangular Meshes in Convex Polygons
- Laplacian smoothing and Delaunay triangulations
- A generic Delaunay triangulation algorithm for finite element meshes
- GEOMPACK — a software package for the generation of meshes using geometric algorithms
- scientific article; zbMATH DE number 177387 (Why is no real title available?)
- Reliable Delaunay‐based mesh generation and mesh improvement
- Geometric Separators for Finite-Element Meshes
- scientific article; zbMATH DE number 1798163 (Why is no real title available?)
- Global balancing of a triangular mesh
- Control volume approximation of degenerate two-phase porous flows
- WHEN AND WHY DELAUNAY REFINEMENT ALGORITHMS WORK
- A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
- Meshes preserving minimum feature size
- Quality Mesh Generation in Higher Dimensions
- Fast and efficient computation of additively weighted Voronoi cells for applications in molecular biology
- Parallel construction of quadtrees and quality triangulations
- An Algorithm for Two‐Dimensional Mesh Generation Based on the Pinwheel Tiling
- Size Competitive Meshing Without Large Angles
- SVR: Practical engineering of a fast 3D meshing algorithm
- Interleaving Delaunay refinement and optimization for 2D triangle mesh generation
- Lagrangian and moving mesh methods for the convection diffusion equation
- A time efficient Delaunay refinement algorithm
- Guaranteed-quality simplical mesh generation with cell size and grading control
- Approximate shape quality mesh generation
- Uniformly acute triangulations of polygons
- An inequality on the edge lengths of triangular meshes
- High-order arbitrary-Lagrangian-Eulerian schemes on \textit{crazy} moving Voronoi meshes
- Adaptive approximation of persistent homology
- Approximating the maxmin-angle covering triangulation
- A data modeling abstraction for describing triangular mesh algorithms
- Hexagonal Delaunay triangulation
- Optimal triangulation of polygons
- 2D nearly orthogonal mesh generation with controls on distortion function
- Off-centers: A new type of Steiner points for computing size-optimal quality-guaranteed Delaunay triangulations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3140404)
