Provably good mesh generation
From MaRDI portal
Publication:1329150
DOI10.1016/S0022-0000(05)80059-5zbMath0799.65119OpenAlexW2120018535MaRDI QIDQ1329150
David Eppstein, Marshall W. Bern, John R. Gilbert
Publication date: 1 November 1994
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-0000(05)80059-5
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
Related Items
Amortized analysis of smooth quadtrees in all dimensions, Relationship between tetrahedron shape measures, Distance-sensitive planar point location, Parameterization of planar curves immersed in triangulations with application to finite elements, Angle-bounded 2D mesh simplification, Nonobtuse triangulations of PSLGs, Delaunay Triangulation of Imprecise Points Simplified and Extended, Linear-size nonobtuse triangulation of polygons, Spectral partitioning works: planar graphs and finite element meshes, Algorithms for proximity problems in higher dimensions, Bounded flatness in \(Q\)-triangulated regular \(n\)-simplexes, On the growth of Lebesgue constants for convex polyhedra, Isogeometric triangular Bernstein-Bézier discretizations: automatic mesh generation and geometrically exact finite element analysis, Universal meshes: A method for triangulating planar curved domains immersed in nonconforming meshes, Simulating curvilinear crack propagation in two dimensions with universal meshes, High‐order methods for low Reynolds number flows around moving obstacles based on universal meshes, POINTERLESS IMPLEMENTATION OF HIERARCHICAL SIMPLICIAL MESHES AND EFFICIENT NEIGHBOR FINDING IN ARBITRARY DIMENSIONS, Error reduction of the adaptive conforming and nonconforming finite element methods with red-green refinement, Uniformly acute triangulations of polygons, Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition, Layer based solutions for constrained space-time meshing., Near-linear-time deterministic plane Steiner spanners for well-spaced point sets, Dynamic well-spaced point sets, Preprocessing imprecise points for Delaunay triangulation: simplified and extended, Construction and Local Routing for Angle-Monotone Graphs, Tiling space and slabs with acute tetrahedra., QUALITY MESHING OF POLYHEDRA WITH SMALL ANGLES, Dual complexes of cubical subdivisions of \({\mathbb{R}}^{n}\), There are simple and robust refinements (almost) as good as Delaunay, Triangulating a convex polygon with fewer number of non-standard bars, Off-centers: A new type of Steiner points for computing size-optimal quality-guaranteed Delaunay triangulations, An upper bound for conforming Delaunay triangulations, Reprint of: Delaunay refinement algorithms for triangular mesh generation, PITCHING TENTS IN SPACE-TIME: MESH GENERATION FOR DISCONTINUOUS GALERKIN METHOD, Geometric Separators for Finite-Element Meshes, Strategies for polyhedral surface decomposition: an experimental study., Hexahedral meshing of non-linear volumes using Voronoi faces and edges, Minimum weight convex Steiner partitions, 2D and 3D finite element meshing and remeshing, 3D finite element meshing from imaging data, PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS, Sign-preserving of principal eigenfunctions in P1 finite element approximation of eigenvalue problems of second-order elliptic operators, A new fast hybrid adaptive grid generation technique for arbitrary two-dimensional domains, A simple quality triangulation algorithm for complex geometries, Isotopic implicit surface meshing, Convergence analysis of a locally stabilized collocated finite volume scheme for incompressible flows, On a stabilized colocated Finite Volume scheme for the Stokes problem, Dynamic smooth compressed quadtrees, PARALLEL DELAUNAY REFINEMENT: ALGORITHMS AND ANALYSES, Approximating uniform triangular meshes in polygons., Quadtree, ray shooting and approximate minimum weight Steiner triangulation, Delaunay refinement algorithms for triangular mesh generation, Universal meshes for smooth surfaces with no boundary in three dimensions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Triangulating a nonconvex polytope
- Generalized Delaunay triangulation for planar graphs
- Nonobtuse triangulation of polygons
- Constrained Delaunay triangulations
- On Optimal Interpolation Triangle Incidences
- Generalized Nested Dissection
- A brief review of techniques for generating irregular computational grids
- POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS
- On the Angle Condition in the Finite Element Method
- Condition of finite element matrices generated from nonuniform meshes.
