Pages that link to "Item:Q4837546"
From MaRDI portal
The following pages link to A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation (Q4837546):
Displaying 50 items.
- Grid refinement in the construction of Lyapunov functions using radial basis functions (Q258399) (← links)
- Distance-sensitive planar point location (Q283883) (← links)
- Multithread parallelization of LEPP-bisection algorithms (Q412318) (← links)
- Modeling wildfire propagation with Delaunay triangulation and shortest path algorithms (Q439586) (← links)
- A model-integrated localized collocation meshless method for large scale three-dimensional heat transfer problems (Q463402) (← links)
- A robust 2-refinement algorithm in octree or rhombic dodecahedral tree based all-hexahedral mesh generation (Q502522) (← links)
- On nondegenerate triangulation with condensation at the boundary of a domain (Q548728) (← links)
- Conforming Delaunay triangulations in 3D (Q598238) (← links)
- Software environment for CAD/CAE integration (Q602914) (← links)
- Nodeless variable finite element method for heat transfer analysis by means of flux-based formulation and mesh adaptation (Q608719) (← links)
- Conservative interpolation between unstructured meshes via supermesh construction (Q653593) (← links)
- Triangulating smooth submanifolds with light scaffolding (Q655155) (← links)
- Transformation invariant local element size specification (Q669673) (← links)
- High-order unstructured curved mesh generation using the Winslow equations (Q729358) (← links)
- Delaunay refinement for piecewise smooth complexes (Q848856) (← links)
- Compatible connectivity augmentation of planar disconnected graphs (Q894688) (← links)
- Combining improvement and refinement techniques: 2D Delaunay mesh adaptation under domain changes (Q945282) (← links)
- The mixed-cell-complex partition-of-unity method (Q1008925) (← links)
- A sampling theory for compact sets in Euclidean space (Q1014336) (← links)
- Lepp-bisection algorithms, applications and mathematical properties (Q1030788) (← links)
- A subdomain collocation method based on Voronoi domain partition and reproducing kernel approximation (Q1033556) (← links)
- Provably good mesh generation (Q1329150) (← links)
- Delaunay triangulation and 3D adaptive mesh generation (Q1392183) (← links)
- An improved procedure for 2D unstructured Delaunay mesh generation (Q1400213) (← links)
- Generating well-shaped \(d\)-dimensional Delaunay meshes. (Q1401265) (← links)
- Quality-improved local refinement of tetrahedral mesh based on element-wise refinement switching. (Q1418654) (← links)
- Delaunay refinement algorithms for triangular mesh generation (Q1602942) (← links)
- Thread-parallel mesh improvement using face and edge swapping and vertex insertion (Q1615639) (← links)
- Delaunay meshing of piecewise smooth complexes without expensive predicates (Q1662514) (← links)
- A novel model of conforming Delaunay triangulation for sensor network configuration (Q1669119) (← links)
- On the convergence of iterative solvers for polygonal discontinuous Galerkin discretizations (Q1746923) (← links)
- Local polyhedra and geometric graphs (Q1775780) (← links)
- An automatic adaptive meshing technique for Delaunay triangulations (Q1808057) (← links)
- Approximating uniform triangular meshes in polygons. (Q1853569) (← links)
- Grid generation and optimization based on centroidal Voronoi tessellations (Q1855906) (← links)
- Triangulation on reconfigurable meshes: A natural decomposition approach (Q1900321) (← links)
- Dynamic well-spaced point sets (Q1947994) (← links)
- Angle-bounded 2D mesh simplification (Q2139713) (← links)
- Hybrid Voronoi mesh generation: algorithms and unsolved problems (Q2206383) (← links)
- Numerical solution of a two dimensional tumour growth model with moving boundary (Q2210651) (← links)
- There are simple and robust refinements (almost) as good as Delaunay (Q2229908) (← links)
- A 2D advancing-front Delaunay mesh refinement algorithm (Q2230400) (← links)
- Reprint of: Delaunay refinement algorithms for triangular mesh generation (Q2249046) (← links)
- Optimization for first order Delaunay triangulations (Q2269140) (← links)
- Shape aware quadratures (Q2312178) (← links)
- A generic software design for Delaunay refinement meshing (Q2371339) (← links)
- Computing Teichmüller maps between polygons (Q2397748) (← links)
- Triangulating a convex polygon with fewer number of non-standard bars (Q2465634) (← links)
- On the sizes of Delaunay meshes (Q2489538) (← links)
- A parallel solver for adaptive finite element discretizations (Q2583225) (← links)