Computing multidimensional Delaunay tessellations

DOI10.1016/0167-8655(83)90069-7zbMath0514.68064OpenAlexW2073046705MaRDI QIDQ3660935

Michel M. Dekesel, Pierre A. Devijver

Publication date: 1983

Published in: Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8655(83)90069-7

zbMATH Keywords

tessellationcomputational geometryVoronoiDelaunay

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Discrete mathematics in relation to computer science (68R99)

Related Items (2)

Smoothed finite element methods (S-FEMs) with polynomial pressure projection (P3) for incompressible solids ⋮ A COMPARATIVE STUDY OF EXPLICIT DIFFERENTIAL OPERATORS ON ARBITRARY GRIDS

This page was built for publication: Computing multidimensional Delaunay tessellations