Constantiniu, A., Steinmann, P. , Bobach, T., Farin, G. and Umlauf, G. (2008) The Adaptive Delaunay Tessellation: A neighborhood covering meshing technique. Computational Mechanics, 42(5), pp. 655-669. (doi: 10.1007/s00466-008-0265-3)
Full text not currently available from Enlighten.
Abstract
In this paper we propose an unstructured hybrid tessellation of a scattered point set that minimally covers the proximal space around each point. The mesh is automatically obtained in a bounded period of time by transforming an initial Delaunay tessellation. Novel types of polygonal interpolants are used for interpolation applications and the geometric qualities of the elements make them also useful for discretization schemes. The approach proves to be superior to classical Delaunay one in a finite element context.
Item Type: | Articles |
---|---|
Additional Information: | This work was supported through the DFG Research School “Engineering Materials at Multiple Scales: Experiments, Modelling and Simulation”, DFG International Research Training Group “Visualization of Large and Unstructured Data Sets” and by DFG Mercator Grant “G. Farin”. |
Status: | Published |
Refereed: | Yes |
Glasgow Author(s) Enlighten ID: | Steinmann, Professor Paul |
Authors: | Constantiniu, A., Steinmann, P., Bobach, T., Farin, G., and Umlauf, G. |
College/School: | College of Science and Engineering > School of Engineering > Infrastructure and Environment |
Journal Name: | Computational Mechanics |
Publisher: | Springer |
ISSN: | 0178-7675 |
ISSN (Online): | 1432-0924 |
Published Online: | 15 March 2008 |
University Staff: Request a correction | Enlighten Editors: Update this record