A cell by cell anisotropic adaptive mesh technique is combined with a staggered mesh Lagrange plus remap finite element ALE code for the solution of the Euler equations. The quadrilateral finite elements may be subdivided isotropically or anisotropically in a cell by cell manner. An efficient computational method is proposed, which only solves on the finest level of resolution that exists for e...

Abstract. Two dynamic mesh methods— Radial Basis Function (RBF) method and Delaunay method which have been used widely in fluid-structure interaction recently were compared. Primarily, the basic theory of these two methods and the dynamic mesh process were presented. Furthermore, using the variable bandwidth sparse matrix storage technique, the computational efficiency of the RBF method can be ...

In this paper, we propose a Multiple Description Coding (MDC) method for reliable transmission of compressed time consistent 3D dynamic meshes. It trades off reconstruction quality for error resilience to provide the best expected reconstruction of 3D mesh sequence at the decoder side. The method is based on partitioning the mesh frames into two sets by temporal subsampling and encoding each se...

Accurate localization and tracking of facial features are crucial for developing high-quality model-based coding systems. In this paper we describe the integration of simple heuristics which are e!ective in improving the results of well-known facial feature detection with robust techniques for adapting a dynamic mesh for animation. A new method of generating a self-adaptive mesh using an extend...

Interconnection networks play a crucial role in the performance of massively parallel computer systems. Hierarchical interconnection networks provide high performance at low cost by exploring the locality that exists in the communication patterns of massively parallel computer systems. The Tori-connected mESH (TESH) Network is a 2D-torus network of multiple basic modules, in which the basic mod...

Dynamic simulation meshes are successfully used in many scientific and engineering fields. We present simple and efficient algorithm for a fast extraction of the iso-surfaces from the data sets with dynamic mesh. Simulation mesh at each time step is preprocessed into a list of diamonds composed of the original mesh cells. The min / max values of all diamonds are stored in a Time-space Partition...

This paper discusses the implementation of a distributed geometry for parallel mesh generation, involving dynamic load-balancing and hence dynamic re-partitioning of the geometry. A novel approach is described for improving the efficiency of the distributed geometry interface when dealing with irregular shaped mesh partitions.

This paper proposes a DC-mesh network that allows requesting nodes to be put into clusters while the requests are sent to a target node, as well as is easy to layout on an LSI chip. To organize the DCmesh, we use the partitioning in the word space based on the Hamming code [1]. We introduce an index scheme, (parity-value,information-value), in the word space, and map it onto a 4-D (dimensional)...

The problem of dynamic router node placement (dynRNP) in wireless mesh networks (WMNs) is concerned with determining a dynamic geographical placement of mesh routers to serve mobile mesh clients at different times, so that both network connectivity (i.e., the greatest topology subgraph component size) and client coverage (i.e., the number of the served mesh clients) are maximized. Mesh clients ...