Name
Abstract | ||
|---|---|---|
Summary. This paper presents an adaptiv ea pproac ht o sweeping one-to-on ea nd many-to-one geometry .T he automatic decomposition of many-to-one geometry into one-to-one "blocks" an dt he selection of an appropriate node projection scheme are vital steps in the efficien tg eneration of high-qualit ys wept meshes. This paper iden- tifies two node projection schemes whic ha re used in tandem to robustly sweep eac h block of ao ne-to-one geometry .M ethods are also presented for the characterization of one-to-one geometry and the automatic assignmen to ft he most appropriate node projection scheme. These capabilities allow the sweeper to adapt to the requirements of the sweep block being processed. The identification of the two node projection schemes wa sm ade after an extensive analysi so fe xisting schemes wa sc ompleted. One of the node projection schemes implemented in thi sw ork, BoundaryError, wa s selected from traditional node placemen ta lgorithms. Th es econd node projection scheme, SmartAffine, is an extension of simpl ea ffine transformations and is capable of efficiently sweeping geometry with source and/or target curvature whil ea pprox- imating the speed of as imple transform. Thes et wo schemes, when used in thi s adaptiv es etting, optimize mesh quality and the speed that swept meshes can be generated while minimizing required user interaction. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/3-540-29090-7_25 | IMR |
Keywords | DocType | Volume |
smooth- ing,mesh generation,hexahedra,decomposition,sweeping,automatic,node projection | Conference | 26 |
Issue | ISSN | Citations |
3 | 1435-5663 | 8 |
PageRank | References | Authors |
0.91 | 4 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| michael a scott | 1 | 61 | 4.69 |
| matthew n earp | 2 | 15 | 1.70 |
| steven e benzley | 3 | 107 | 12.72 |
| Michael Stephenson | 4 | 8 | 0.91 |