The adaptive Delaunay tessellation: A neighborhood covering meshing technique

DOI10.1007/s00466-008-0265-3zbMath1167.65338MaRDI QIDQ1026474

Paul Steinmann, Gerald Farin, Alexandru Constantiniu, Tom Bobach, Georg Umlauf

Publication date: 25 June 2009

Published in: Computational Mechanics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00466-008-0265-3

zbMATH Keywords

polygonal finite elements; generalized barycentric coordinates; scattered data interpolation; adaptive Delaunay tessellation; polygonal interpolation

Mathematics Subject Classification ID

65N30: Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs

65D18: Numerical aspects of computer graphics, image analysis, and computational geometry

65D05: Numerical interpolation

65N50: Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs

Related Items

Geometric Properties of the Adaptive Delaunay Tessellation, Locking-free numerical methods for nearly incompressible elasticity and incompressible flow on moving domains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The non-Sibsonian interpolation: A new method of interpolation of the value of a function on an arbitrary set of points
• Mean value coordinates
• Barycentric coordinates for convex sets
• Preferred directions for resolving the non-uniqueness of Delaunay triangulations
• Recent advances in the construction of polygonal finite element interpolants
• Smooth interpolation of large sets of scattered data
• The extended Delaunay tessellation
• Conforming polygonal finite elements