in this paper, an adaptive physics-based method is developed for solving wave motion problems in one dimension (i.e., wave propagation in strings, rods and beams). the solution of the problem includes two main parts. in the first part, after discretization of the domain, a physics-based method is developed considering the conservation of mass and the balance of momentum. in the second part, ada...

We introduce a new method to mesh a physical domain in parallel. Given a domain deened by a set of boundary facets, we construct a separator of it. As a result, we obtain several subdomains, each of them being deened by a set of boundary facets. Naturally, the separation step can be applied recursively to increase the number of subdomains, or to reduce the size of one subdomain. Then, a classic...

Creating an interpolating mesh from an unorganized set of oriented points is a difficult problem which is often overlooked. Most methods focus indeed on building a watertight smoothed mesh by defining some function whose zero level set is the surface of the object. However in some cases it is crucial to build a mesh that interpolates the points and does not fill the acquisition holes: either be...

An adaptive mesh strategy for the numerical simulation of incompressible transient flows with heat transfer and mass transport is presented in this work. The Finite Element technique, with unstructured meshes formed by tetrahedral elements, and the two-step Taylor-Galerkin method are used. The velocity field is obtained by an explicit scheme, while pressure field is computed by an implicit sche...

Simulation and predictions of material processes at multi-length scales require a detailed understanding of microstructures. While a meaningful study requires large data sets, the size of data sets has been limited due to the lack of automated image processing and mesh generation algorithms. We obtained as images a relatively large population of data from 19 samples of Aluminum foils by Electro...

RECONFIGURABLE HARDWARE IMPLEMENTATION AND ANALYSIS OF MESH ROUTING FOR THE MATRIX STEP OF NUMBER FIELD SIEVE FACTORIZATION Sashisu M. Bajracharya, M.S. George Mason University, 2004 Thesis Director: Dr. Kris Gaj Factorization of large numbers has been a constant source of interest as it is the basis of security for the well-known RSA cryptosystem. The fastest known algorithm for factoring larg...

Generally, decomposition is a leverage to obtain the componential representation from a whole. After the decomposition step is executed, the decomposed components can be individually selected, grouped, and analyzed based on the properties of interest. According to Hoffman and Singh’s theory [1], there are at least three factors that determine the salience of a part: the protrusion, the boundary...

This paper presents an automated tool for local, conformal refinement of all-hexahedral meshes based on the insertion of multidirectional twist planes into the spatial twist continuum. The refinement process is divided into independent refinement steps. In each step, an inserted twist plane modifies a single sheet or two parallel hex sheets. Six basic templates, chosen and oriented based on the...

Semantic mesh segmentation and labeling is a fundamental problem in graphics. Conventional data-driven approaches usually employ a tedious offline pre-training process. Moreover, the number and especially the quality of the manually labeled examples challenge such strategies. In this paper, we develop a low-rank representation model with structure guiding to address these problems. The pre-trai...

A method for adaptive construction of nearly optimal nite element meshes is presented. The method is based on the notion of mesh density. For parametrized problems optimal meshes for new parameter values can be predicted from previous meshes. The method is of the one shot type, normally giving a suuciently good approiximation to the optimal mesh in the rst attempt , but when the rst shot is uns...