Name
Abstract | ||
|---|---|---|
In this paper we summarize our experiences with constrained Delaunay triangulation algorithms for industrial applications. In addition, we report a robust implementat ion process for constructing con- strained triangulations from initial unconstrained triangulations, based on a minimalist approach, in which we minimize the use of geometrical operations such as intersections. This is achieved by inserting Steiner points on missing constraining edges and faces in the initial unconstrai ned triangulations. This approach allowed the generation of tetrahedral meshes for arbitrarily complex domains. |
Year | Venue | Keywords |
|---|---|---|
1999 | IMR | computat ional geometry.,three-dimensional mesh generation,constrained triangulations,delaunay triangulation,industrial strength triangulations,tetrahedralization,mesh generation,three dimensional,constrained delaunay triangulation |
Field | DocType | Citations |
Chew's second algorithm,Minimum-weight triangulation,Bowyer–Watson algorithm,Computer science,Algorithm,Surface triangulation,Constrained Delaunay triangulation,Pitteway triangulation,Delaunay triangulation,Ruppert's algorithm | Conference | 10 |
PageRank | References | Authors |
1.13 | 8 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Paulo Roma Cavalcanti | 1 | 75 | 10.18 |
| Ulisses T. Mello | 2 | 23 | 3.36 |