Computing multidimensional Delaunay tessellations

DOI10.1016/0167-8655(83)90069-7MaRDI QIDQ3660935zbMATH OpenOpenAlexFDO

Authors 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

computational geometryDelaunaytessellationVoronoi

Mathematics Subject Classification ID

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

Cited in

(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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3660935)