I present a real-time rendering method for converting directed acyclic graphs to polygonal meshes directly on the GPU. The method is composed of two steps. First a graph, where each node has information about its direction, radius and length, is used to construct a nonintersecting, provided well-defined input, topologically correct, closed polygon mesh. This produces a coarse mesh in real-time ...

In this paper, we present a novel process of creating hexahedral meshes for the turbomachinery secondary air system. The meshing process is automated from the geometry import to the mesh setup and requires minimum human interventions. The core of the process is a hexahedral meshing algorithm with a boundary layer mesh automatically created. The hex meshing algorithm combines the pave-sweep, gen...

This paper presents a two-step approach to generating comprehensive abstractive overviews for biomedical topics. It starts with a sensitivity-maximizing search of MEDLINE/PubMed and MeSH-based filtering of the results that are then processed using NLP methods to extract relations between entities of interest. We evaluate this approach in a case study based on the IOM report on the role of vitam...

This paper studies the difference in computational power between the mesh-connected parallel computers equipped with dynamically reconfigurable bus systems and those with static ones. The mesh with separable buses (MSB) is the mesh-connected computer with dynamically reconfigurable row/column buses. The broadcasting buses of the MSB can be dynamically sectioned into smaller bus segments by prog...

Application of variable time-step and unstructured adaptive mesh refinement in parallel three-dimensional Direct Simulation Monte Carlo (DSMC) method is presented. A variable time-step method using the particle fluxes conservation (mass, momentum and energy) across the cell interface is implemented to reduce the number of simulated particles and the number of iterations of transient period towa...

In this paper, we propose an adaptive polygonal mesh coarsening algorithm. This approach is based on the clustering of the input mesh triangles, driven by a discretized variationnal definition of centroidal tesselations. It is able to simplify meshes with high complexity i.e. meshes with a large number of vertices and high genus. We demonstrate the ability our scheme to simplify meshes accordin...

numerical solutions obtained by the meshless local petrov–galerkin (mlpg) method are presented for two-dimensional steady-state heat conduction problems. the mlpg method is a truly meshless approach, and neither the nodal connectivity nor the background mesh is required for solving the initial-boundary-value problem. the penalty method is adopted to efficiently enforce the essential boundary co...

Mesh generation is a critical step in high fidelity computational simulations. High quality and high density meshes are required to accurately capture the complex physical phenomena. A parallel framework has been developed to generate large-scale meshes in a short period of time. A coarse volume mesh is generated first to provide the basis of block interfaces and partitioned into a number of su...

This paper demonstrates the capabilities of Adaptive Mesh Refinement Techniques (AMR) on 2D hybrid unstructured meshes, for high order finite volume WENO methods. The AMR technique developed is a conformal adapting unstructured hybrid quadrilaterals and triangles (quads & tris) technique for resolving sharp flow features in accurate manner for steady-state and time dependent flow problems. In t...