Name
Abstract | ||
|---|---|---|
. An algorithm for constructing almost regular triangulations (ARTs) for three-dimensional polygonaldomains is described. Ideally such triangulations consist entirely of congruent tetrahedra with nearly equal edges.The new feature of this method is that the position of the vertices is adjusted, before any connecting edges areassigned. This leads to grids with very few irregular vertices, i.e. most interior vertices are shared by 24 tetrahedraas for regular tessellations of R 3with... |
Year | Venue | Keywords |
|---|---|---|
1998 | IMR | grid generation,three dimensional |
Field | DocType | Citations |
Topology,Computer science,Tetrahedron,Mesh generation,Delaunay triangulation | Conference | 11 |
PageRank | References | Authors |
1.01 | 1 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexander Fuchs | 1 | 11 | 1.35 |