Research graph
References from Several aspects of three-dimensional Delaunay triangulation. Local targets link to admitted publications; unresolved targets remain external evidence.
Computing Dirichlet tessellations
10.1093/comjnl/24.2.162 · 1981 · External reference
Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes
10.1093/comjnl/24.2.167 · 1981 · External reference
An approach to automatic three-dimensional finite element mesh generation
10.1002/nme.1620210210 · 1985 · External reference
Unresolved reference
1988 · External reference
Delaunay's mesh of a convex polyhedron in dimension d. Application to arbitrary polyhedra
10.1002/nme.1620330507 · 1992 · External reference
The integrity of geometrical boundaries in two-dimensional Delaunay triangulation
10.1002/cnm.1630060206 · 1990 · External reference
A new method for generating inner points of triangulations in two dimensions
10.1016/0045-7825(93)90207-e · 1993 · External reference
Fully automatic mesh generator for 3-D domains of any shape
10.1016/0899-8248(90)90012-y · 1990 · External reference
Automatic mesh generator with specified boundary
10.1016/0045-7825(91)90017-z · 1991 · External reference
Efficient three-dimensional grid generation using the Delaunay triangulation
1992 · External reference
A normal offsetting technique for automatic mesh generation in three dimensions
10.1002/nme.1620361007 · 1993 · External reference
Unresolved reference
1992 · External reference
Unresolved reference
1985 · External reference
Several aspects of the three-dimensional triangulation of Delaunay
1994 · External reference
Efficient refinement/derefinement algorithm of nested meshes to solve evolution problems
10.1002/cnm.1640100506 · 1994 · External reference
