Abstract
J.M. Escobar, R. Montenegro
Abstract
Authors
Institutions
No ROR-resolved institution is linked to this work yet.
Provenance
crossref
Confidence 100%
unpaywall
Confidence 95%
datacite
Confidence 0%
No local reference links have been materialized yet.
No local citing links have been materialized yet.
Computing Dirichlet tessellations
10.1093/comjnl/24.2.162 · 1981
Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes
10.1093/comjnl/24.2.167 · 1981
An approach to automatic three-dimensional finite element mesh generation
10.1002/nme.1620210210 · 1985
Unresolved referenced work
1988
Delaunay's mesh of a convex polyhedron in dimension d. Application to arbitrary polyhedra
10.1002/nme.1620330507 · 1992
The integrity of geometrical boundaries in two-dimensional Delaunay triangulation
10.1002/cnm.1630060206 · 1990
A new method for generating inner points of triangulations in two dimensions
10.1016/0045-7825(93)90207-e · 1993
Fully automatic mesh generator for 3-D domains of any shape
10.1016/0899-8248(90)90012-y · 1990
Automatic mesh generator with specified boundary
10.1016/0045-7825(91)90017-z · 1991
Efficient three-dimensional grid generation using the Delaunay triangulation
1992
A normal offsetting technique for automatic mesh generation in three dimensions
10.1002/nme.1620361007 · 1993
Unresolved referenced work
1992
Unresolved referenced work
1985
Several aspects of the three-dimensional triangulation of Delaunay
1994
Efficient refinement/derefinement algorithm of nested meshes to solve evolution problems
10.1002/cnm.1640100506 · 1994
No additional external references are available.