Name
Abstract | ||
|---|---|---|
Sweeping algorithms provide the ability to generate all hexahedral meshes on a wide variety of three-d imensional bodies. The work presented here provides a method to refine the se meshes by first defining a path through either t he source or the target mesh and next by locating the sweeping layer to initiate the refinement. A major contribution of this work is the ability to automatically find a minimal distance path through the target or source mesh. The refinement is accom plished by using the pillowing procedure as proposed by Mitchell. (1) |
Year | Venue | Keywords |
|---|---|---|
2000 | IMR | refinement,mesh generation,sweeping,2 ω -d,hexahedral meshing |
Field | DocType | Citations |
Hexahedron,Polygon mesh,Cleave,Computer science,Volume mesh,Algorithm | Conference | 6 |
PageRank | References | Authors |
0.86 | 3 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael J. Borden | 1 | 44 | 4.17 |
| steven e benzley | 2 | 107 | 12.72 |
| Scott A. Mitchell | 3 | 461 | 77.77 |
| David R. White | 4 | 631 | 41.35 |
| Ray J. Meyers | 5 | 121 | 22.11 |