Provably good mesh generation
From MaRDI portal
Publication:1329150
DOI10.1016/S0022-0000(05)80059-5zbMATH Open0799.65119OpenAlexW2120018535MaRDI QIDQ1329150FDOQ1329150
Authors: David Eppstein, M. W. Bern, J. 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
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
Cites Work
- Generalized Nested Dissection
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Angle Condition in the Finite Element Method
- Nonobtuse triangulation of polygons
- POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS
- Triangulating a nonconvex polytope
- Condition of finite element matrices generated from nonuniform meshes.
- On Optimal Interpolation Triangle Incidences
- Generalized Delaunay triangulation for planar graphs
- Constrained Delaunay triangulations
- A brief review of techniques for generating irregular computational grids
- Title not available (Why is that?)
Cited In (60)
- A shape optimization approach for simulating contact of elastic membranes with rigid obstacles
- Skeleton based tetrahedralization of surface meshes
- Uniformly acute triangulations of polygons
- Universal meshes for smooth surfaces with no boundary in three dimensions
- Off-centers: A new type of Steiner points for computing size-optimal quality-guaranteed Delaunay triangulations
- Universal meshes: a method for triangulating planar curved domains immersed in nonconforming meshes
- Simulating curvilinear crack propagation in two dimensions with universal meshes
- Quadtree, ray shooting and approximate minimum weight Steiner triangulation
- 3D finite element meshing from imaging data
- Amortized analysis of smooth quadtrees in all dimensions
- QUALITY MESHING OF POLYHEDRA WITH SMALL ANGLES
- High‐order methods for low Reynolds number flows around moving obstacles based on universal meshes
- Minimum weight convex Steiner partitions
- Bounded flatness in \(Q\)-triangulated regular \(n\)-simplexes
- Layer based solutions for constrained space-time meshing.
- There are simple and robust refinements (almost) as good as Delaunay
- A simple quality triangulation algorithm for complex geometries
- Distance-sensitive planar point location
- Angle-bounded 2D mesh simplification
- Gabriel triangulations and angle-monotone graphs: local routing and recognition
- Isotopic implicit surface meshing
- Reprint of: Delaunay refinement algorithms for triangular mesh generation
- Parameterization of planar curves immersed in triangulations with application to finite elements
- Hexahedral meshing of non-linear volumes using Voronoi faces and edges
- Delaunay Triangulation of Imprecise Points Simplified and Extended
- Triangulating a convex polygon with fewer number of non-standard bars
- Nonobtuse triangulations of PSLGs
- Geometric Separators for Finite-Element Meshes
- Quality Mesh Generation in Higher Dimensions
- An upper bound for conforming Delaunay triangulations
- Dynamic smooth compressed quadtrees
- High-quality 2D mesh generation without obtuse and small angles
- Tiling space and slabs with acute tetrahedra.
- POINTERLESS IMPLEMENTATION OF HIERARCHICAL SIMPLICIAL MESHES AND EFFICIENT NEIGHBOR FINDING IN ARBITRARY DIMENSIONS
- DATA GENERATION FOR GEOMETRIC ALGORITHMS ON NON-UNIFORM DISTRIBUTIONS
- PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS
- Linear-size nonobtuse triangulation of polygons
- Algorithms for proximity problems in higher dimensions
- Strategies for polyhedral surface decomposition: an experimental study.
- Spectral partitioning works: planar graphs and finite element meshes
- A new fast hybrid adaptive grid generation technique for arbitrary two-dimensional domains
- Near-linear-time deterministic plane Steiner spanners for well-spaced point sets
- ON GOOD TRIANGULATIONS IN THREE DIMENSIONS
- Delaunay refinement algorithms for triangular mesh generation
- Error reduction of the adaptive conforming and nonconforming finite element methods with red-green refinement
- On the growth of Lebesgue constants for convex polyhedra
- Dynamic well-spaced point sets
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended
- Superior mesh quality with automatic node mergers
- Relationship between tetrahedron shape measures
- Approximating uniform triangular meshes in polygons.
- 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001)
- Isogeometric triangular Bernstein-Bézier discretizations: automatic mesh generation and geometrically exact finite element analysis
- Construction and Local Routing for Angle-Monotone Graphs
- Dual complexes of cubical subdivisions of \({\mathbb{R}}^{n}\)
- Sign-preserving of principal eigenfunctions in P1 finite element approximation of eigenvalue problems of second-order elliptic operators
- Convergence analysis of a locally stabilized collocated finite volume scheme for incompressible flows
- PITCHING TENTS IN SPACE-TIME: MESH GENERATION FOR DISCONTINUOUS GALERKIN METHOD
- PARALLEL DELAUNAY REFINEMENT: ALGORITHMS AND ANALYSES
- On a stabilized colocated Finite Volume scheme for the Stokes problem
This page was built for publication: Provably good mesh generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1329150)
