Premium
Delaunay's mesh of a convex polyhedron in dimension d. application to arbitrary polyhedra
Author(s) -
George P. L.,
Hermeline F.
Publication year - 1992
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.1620330507
Subject(s) - polyhedron , delaunay triangulation , regular polygon , dimension (graph theory) , convex polytope , constrained delaunay triangulation , mathematics , bowyer–watson algorithm , triangulation , computation , minimum weight triangulation , simple (philosophy) , pitteway triangulation , combinatorics , convex set , geometry , algorithm , convex optimization , philosophy , epistemology
This paper presents a method for creating a Delaunay triangulation connected to a set of specified points. The theoretical aspect is recalled for an arbitrary dimension and the method is discussed in order to derive a practical approach, valid for dimensions 2 and 3, which is simple, robust and well adapted to computation. Convex polyhedral and arbitrary polyhedral situations are introduced.