Name
Abstract | ||
|---|---|---|
This paper presents an algorithm for imprinting and merging adjacent parts. Imprint and merge is often used to facilitate generation of conformal meshes between adjacent parts. The algorithm tolerantly intersects the discretized boundary edges of adjacent faces to calculate the imprint Boolean. An i nput tolerance is used during the process to minimize the effect imprinting has on the meshing process. The topology changes from the imprint are generated using virtual geometry so that tolerant topology can be used. Several examples demonstrate how the present approach may be utilized to improve the mesh quality of conformal meshes over multiple parts. The approach is shown to work robustly with misaligned and poorly defined parts. |
Year | Venue | Keywords |
|---|---|---|
2002 | IMR | r-tree,tolerant intersections,imprint,merge,conformal meshing,assembly clean up |
Field | DocType | Citations |
Discretization,Topology,Polygon mesh,Computer science,Conformal map,Merge (version control) | Conference | 5 |
PageRank | References | Authors |
0.65 | 9 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David R. White | 1 | 631 | 41.35 |
| Sunil Saigal | 2 | 59 | 10.91 |