this paper introduces a mesh generating algorithm for solving the traffic flow equation as a conservation law equation. the idea behind the new method is to use the characteristic curves and moving non-oscillatory finite volume method. in addition, when characteristic curves intersect, the proposed scheme uses shock speed equation in order to improve computational efficiency. we also compare...

An algorithm to generate volume meshes by extrusion from surface meshes of arbitrary topology is presented. The algorithm utilizes a three-step, advancing layer scheme to extrude a smooth volume mesh starting from an initial surface mesh. First, a locally orthogonal reference mesh is algebraically generated for the layer. The reference mesh is then smoothed using a locally three-dimensional Poi...

A novel algorithm to extrude smooth, near-body volume meshes from surface meshes of arbitrary topology is presented. These meshes are classified as generalized meshes because multiple element topologies may be present within the same mesh. The algorithm utilizes a three-step, parabolic scheme based on the Poisson equation used in structured grid generation to extrude the volume mesh. Several pr...

The solution of partial differential equations (PDEs) with disparate space and time scales often benefit from the use of nonuniform meshes and adaptivity to successfully track local solution features. In this paper we consider the problem of grid generation using the so– called equidistribution principle (EP) [3] and domain decomposition (DD) strategies. In the time dependent case, the EP is us...

The sweeping algorithm is a classical algorithm that can generate high quality hexahedral meshes for swept volumes. However, the traditional sweeping algorithm can only generate single axis swept meshes. In order to expand the scope of the model that sweeping algorithms are applicable to, this paper proposes a global multi-axis swept mesh generation approach, which can robustly generate hexahed...

Abstract Optical mesh networks using intelligent optical cross-connects are the choice for the next generation optical core. Mesh networks can be designed for fast and guaranteed recovery from single failures and can be designed to protect traffic more efficiently via shared mesh restoration. In this paper, we present a mesh restoration architecture for the optical core. The architecture provid...

This paper introduces a new automatic tetrahedral mesh generator on the adaptive finite element ALBERTA code. The procedure can be applied to 3D domains with boundary surfaces which are projectable on faces of a cube. The generalization of the mesh generator for complex domains which can be split into cubes or hexahedra is straightforward. The domain surfaces must be given as analytical or disc...

Engineering analysis often involves the accurate numerical solution of boundary value problems in discrete form. Hierarchical quadtree (or octree) grid generation offers an efficient method for the spatial discretisation of arbitrary-shaped two- (or three-) dimensional domains. It consists of recursive algebraic splitting of sub-domains into quadrants (or cubes), leading to an ordered hierarchi...

In this paper, we present a new approach for the parallel generation and partitioning of unstructured 3D meshes. The new approach couples the mesh generation and partitioning problems into a single optimization problem. Traditionally, these two problems are solved separately, rst generating the mesh (usually sequentially) and then partitioning the mesh either sequentially or in parallel. In the...