The following pages link to Provably good mesh generation (Q1329150):
Displaying 50 items.
- Distance-sensitive planar point location (Q283883) (← links)
- Nonobtuse triangulations of PSLGs (Q306497) (← links)
- Minimum weight convex Steiner partitions (Q548652) (← links)
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended (Q644800) (← links)
- Dual complexes of cubical subdivisions of \({\mathbb{R}}^{n}\) (Q664353) (← links)
- An upper bound for conforming Delaunay triangulations (Q685182) (← links)
- Sign-preserving of principal eigenfunctions in P1 finite element approximation of eigenvalue problems of second-order elliptic operators (Q728659) (← links)
- Spectral partitioning works: planar graphs and finite element meshes (Q869898) (← links)
- Near-linear-time deterministic plane Steiner spanners for well-spaced point sets (Q906836) (← links)
- Off-centers: A new type of Steiner points for computing size-optimal quality-guaranteed Delaunay triangulations (Q955223) (← links)
- Bounded flatness in \(Q\)-triangulated regular \(n\)-simplexes (Q1126674) (← links)
- Relationship between tetrahedron shape measures (Q1335000) (← links)
- Layer based solutions for constrained space-time meshing. (Q1405147) (← links)
- Tiling space and slabs with acute tetrahedra. (Q1428462) (← links)
- Delaunay refinement algorithms for triangular mesh generation (Q1602942) (← links)
- Amortized analysis of smooth quadtrees in all dimensions (Q1616240) (← links)
- Approximating uniform triangular meshes in polygons. (Q1853569) (← links)
- Quadtree, ray shooting and approximate minimum weight Steiner triangulation (Q1862115) (← links)
- Linear-size nonobtuse triangulation of polygons (Q1906045) (← links)
- Algorithms for proximity problems in higher dimensions (Q1917037) (← links)
- Error reduction of the adaptive conforming and nonconforming finite element methods with red-green refinement (Q1939653) (← links)
- Dynamic well-spaced point sets (Q1947994) (← links)
- Angle-bounded 2D mesh simplification (Q2139713) (← links)
- There are simple and robust refinements (almost) as good as Delaunay (Q2229908) (← links)
- Reprint of: Delaunay refinement algorithms for triangular mesh generation (Q2249046) (← links)
- Isogeometric triangular Bernstein-Bézier discretizations: automatic mesh generation and geometrically exact finite element analysis (Q2417717) (← links)
- Triangulating a convex polygon with fewer number of non-standard bars (Q2465634) (← links)
- Strategies for polyhedral surface decomposition: an experimental study. (Q2482891) (← links)
- 3D finite element meshing from imaging data (Q2495798) (← links)
- 2D and 3D finite element meshing and remeshing (Q2777710) (← links)
- Parameterization of planar curves immersed in triangulations with application to finite elements (Q2894829) (← links)
- Universal meshes: A method for triangulating planar curved domains immersed in nonconforming meshes (Q2952458) (← links)
- Simulating curvilinear crack propagation in two dimensions with universal meshes (Q2952692) (← links)
- High‐order methods for low Reynolds number flows around moving obstacles based on universal meshes (Q2952833) (← links)
- Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition (Q2961543) (← links)
- PITCHING TENTS IN SPACE-TIME: MESH GENERATION FOR DISCONTINUOUS GALERKIN METHOD (Q3021947) (← links)
- A new fast hybrid adaptive grid generation technique for arbitrary two-dimensional domains (Q3065650) (← links)
- A simple quality triangulation algorithm for complex geometries (Q3087037) (← links)
- Delaunay Triangulation of Imprecise Points Simplified and Extended (Q3183447) (← links)
- Convergence analysis of a locally stabilized collocated finite volume scheme for incompressible flows (Q3398596) (← links)
- On a stabilized colocated Finite Volume scheme for the Stokes problem (Q3419746) (← links)
- PARALLEL DELAUNAY REFINEMENT: ALGORITHMS AND ANALYSES (Q3430330) (← links)
- POINTERLESS IMPLEMENTATION OF HIERARCHICAL SIMPLICIAL MESHES AND EFFICIENT NEIGHBOR FINDING IN ARBITRARY DIMENSIONS (Q3503108) (← links)
- Geometric Separators for Finite-Element Meshes (Q4389247) (← links)
- Hexahedral meshing of non-linear volumes using Voronoi faces and edges (Q4508080) (← links)
- On the growth of Lebesgue constants for convex polyhedra (Q4580345) (← links)
- PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS (Q4682197) (← links)
- Dynamic smooth compressed quadtrees (Q5115813) (← links)
- Universal meshes for smooth surfaces with no boundary in three dimensions (Q5273340) (← links)
- Construction and Local Routing for Angle-Monotone Graphs (Q5377357) (← links)
