The Adaptive Delaunay Tessellation: A neighborhood covering meshing technique

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

Research output: Contribution to journalArticlepeer-review

12 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)655-669
Number of pages15
JournalComputational Mechanics
Issue number5
StatePublished - Oct 2008


  • Adaptive Delaunay Tessellation
  • Generalized barycentric coordinates
  • Polygonal finite elements
  • Polygonal interpolation
  • Scattered data interpolation

ASJC Scopus subject areas

  • Computational Mechanics
  • Ocean Engineering
  • Mechanical Engineering
  • Computational Theory and Mathematics
  • Computational Mathematics
  • Applied Mathematics


Dive into the research topics of 'The Adaptive Delaunay Tessellation: A neighborhood covering meshing technique'. Together they form a unique fingerprint.

Cite this