✦ LIBER ✦

2D nearly orthogonal mesh generation

✍ Scribed by Yaoxin Zhang; Yafei Jia; Sam S. Y. Wang

Publisher: John Wiley and Sons
Year: 2004
Tongue: English
Weight: 842 KB
Volume: 46
Category: Article
ISSN: 0271-2091
DOI: 10.1002/fld.770

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

ASPECTS OF 2-D DELAUNAY MESH GENERATION

✍ HOUMAN BOROUCHAKI; PAUL LOUIS GEORGE 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 619 KB

This paper aims to outline the di erent phases necessary to implement a Delaunay-type automatic mesh generator. First, it summarizes this method and then describes a variant which is numerically robust by mentioning at the same time the problems to solve and the di erent solutions possible. The Dela

Nearly Orthogonal Two-Dimensional Grid G

Nearly Orthogonal Two-Dimensional Grid Generation with Aspect Ratio Control

✍ Volkan Akcelik; Branislav Jaramaz; Omar Ghattas 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 391 KB

An improved method for nearly orthogonal grid generation is presented in this study. The generating system is based on solution of a system of partial differential equations with finite difference discretization. To prevent grid lines from collapsing onto each other, the grid cell aspect ratio is co

Generation of orthogonal curvilinear mes

Generation of orthogonal curvilinear meshes in three dimensions

✍ H. Meliani; J.A. Djebbar; D. de Cogan 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 297 KB

## Abstract In this article a method of curvilinear orthogonal mesh generation in three dimensions is described. This technique is based on the solution of elliptic equations in two and three dimensions. Frequently, the generated meshes are not quite orthogonal; hence a modified Davies' algorithm i

A Distributed Formation of Smallest Faul

A Distributed Formation of Smallest Faulty Orthogonal Convex Polygons in 2-D Meshes

✍ Jie Wu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 229 KB

The rectangular faulty block model is the most commonly used fault model for designing fault-tolerant and deadlock-free routing algorithms in meshconnected multicomputers. The convexity of a rectangle facilitates simple and efficient ways to route messages around fault regions using relatively few v

GENERALIZED 3-D PAVING: AN AUTOMATED QUA

GENERALIZED 3-D PAVING: AN AUTOMATED QUADRILATERAL SURFACE MESH GENERATION ALGORITHM

✍ R. J. CASS; S. E. BENZLEY; R. J. MEYERS; T. D. BLACKER 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 747 KB

This paper discusses the extension of the paving algorithm for all quadrilateral mesh generation to arbitrary three-dimensional trimmed surfaces. Methods of calculating angles, projecting elements, and detecting collisions between paving boundaries, for general surfaces are presented. Extensions of

Optimal Orthogonal Tiling of 2-D Iterati

Optimal Orthogonal Tiling of 2-D Iterations

✍ Rumen Andonov; Sanjay Rajopadhye 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 113 KB

Iteration space tiling is a common strategy used by parallelizing compilers and in performance tuning of parallel codes. We address the problem of determining the tile size that minimizes the total execution time. We restrict our attention to uniform dependency computations with two-dimensional, par