Publications

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

We present Mark-It, a marking user interface that reduced the time to decompose a set of CAD models exhibiting a range of decomposition problems by as much as fifty percent. Instead of performing about 50 mesh decomposition operations using a conventional UI, Mark-It allows users to perform the same operations by drawing 2D marks in the context of the 3D model. The motivation for this study was to test the potential of a marking user interface for the decomposition aspect of the meshing process. To evaluate Mark-It, we designed a user study that consisted of a brief tutorial of both the non-marking and marking UIs, performing the steps to decompose four models contributed to us by experienced meshers at Sandia National Laboratories, and a post-study debriefing to rate the speed, preference, and overall learnability of the two interfaces. Our primary contributions are a practical user interface design for speeding-up mesh decomposition and an evaluation that helps characterize the pros and cons of the new user interface.

Sweeping has become the workhorse algorithm for creating conforming hexahedral meshes of complex models. This paper describes progress on the automatic, robust generation of MultiSwept meshes in CUBIT. MultiSweeping extends the class of volumes that may be swept to include those with multiple source and multiple target surfaces. While not yet perfect, CUBIT's MultiSweeping has recently become more reliable, and been extended to assemblies of volumes. Sweep Forging automates the process of making a volume (multi) sweepable: Sweep Verification takes the given source and target surfaces, and automatically classifies curve and vertex types so that sweep layers are well formed and progress from sources to targets.

Sweeping algorithms have become very mature and can create a semi-structured mesh on a large set of solids. However, these algorithms require that all linking surfaces be mappable or submappable. This restriction excludes solids with imprints or protrusions on the linking surfaces. The grafting algorithm allows these solids to be swept. It then locally modifies the position and connectivity of the nodes on the linking surfaces to align with the graft surfaces. Once a high-quality surface mesh is formed on the graft surface, it is swept along the branch creating a 2 3/4-D mesh.

This paper presents a new technique for automatically detecting interval constraints for swept volumes with holes. The technique finds true volume constraints that are not necessarily imposed by the surfaces of the volume. A graphing algorithm finds independent, parallel paths of edges from source surfaces to target surfaces. The number of intervals on two paths between a given source and target surface must be equal; in general, the collection of paths determine a set of linear constraints. Linear programming techniques solve the interval assignment problem for the surface and volume constraints simultaneously.