𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the discrete core of quadrilateral mesh refinement

✍ Scribed by Matthias Müller-Hannemann; Karsten Weihe

Publisher
John Wiley and Sons
Year
1999
Tongue
English
Weight
789 KB
Volume
46
Category
Article
ISSN
0029-5981

No coin nor oath required. For personal study only.

✦ Synopsis

We present a new approach to quadrilateral mesh reÿnement, which reduces the problem to its structural core.

The resulting problem formulation belongs to a class of discrete problems, network-ow problems, which has been thoroughly investigated and is well understood. The network-ow model is exible enough to allow the simultaneous incorporation of various aspects such as the control of angles and aspect ratios, local density control, and templates (meshing primitives) for the internal reÿnement of mesh elements. We show that many di erent variants of the general quadrilateral mesh-reÿnement problem are covered. In particular, we present a novel strategy, which provably ÿnds a conformal reÿnement unless there is none.

📜 SIMILAR VOLUMES

Applications of mesh smoothing: copy, mo
Applications of mesh smoothing: copy, morph, and sweep on unstructured quadrilateral meshes
✍ Patrick M. Knupp 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB

Mesh smoothing is demonstrated to be an e ective means of copying, morphing, and sweeping unstructured quadrilateral surface meshes from a source surface to a target surface. Construction of the smoother in a particular way guarantees that the target mesh will be a 'copy' of the source mesh, provide

A Refinement of the Discrete Wirtinger I
A Refinement of the Discrete Wirtinger Inequality
✍ Xin-Min Zhang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 136 KB

In this paper, we obtain an improved discrete Wirtinger inequality associated with a nonlinear second order differential equation. We apply this result to prove a Bonnesen-style isoperimetric inequality for plane polygons and reinterpret the main theorem as a weighted exponential inequality.

The fractal behaviour of triangular refi
The fractal behaviour of triangular refined/derefined meshes
✍ de la Hoz, A. Plaza 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 424 KB

In the paper the author presents a novel point of view for the refinement and derefinement algorithms of triangular nested meshes using fractal concepts and iterated function systems (IFS). The fractal behaviour can be understood in the sense that these meshes feature a remarkable amplifying invaria

On the implicit time integration of semi
On the implicit time integration of semi-discrete viscous fluxes on unstructured dynamic meshes
✍ Bruno Koobus; Charbel Farhat 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 353 KB

Numerical simulations of viscous flow problems with complex moving and/or deforming boundaries commonly require the solution of the corresponding fluid equations of motion on unstructured dynamic meshes. In this paper, a systematic investigation of the importance of the choice of the mesh configurat

An adaptive mesh refinement method for s
An adaptive mesh refinement method for solution of the transported PDF equation
✍ D. A. Olivieri; M. Fairweather; S. A. E. G. Falle 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 445 KB

## Abstract This paper presents the results of an investigation into a possible alternative to Monte Carlo methods for solving the transported probability density function (__PDF__) equation for scalars (compositions). The method uses a finite‐volume approach combined with adaptive mesh refinement

On the Number of Edges of Quadrilateral-
On the Number of Edges of Quadrilateral-Free Graphs
✍ Zoltán Füredi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 247 KB

If a graph has q 2 +q+1 vertices (q>13), e edges and no 4-cycles then e 1 2 q(q+1) 2 . Equality holds for graphs obtained from finite projective planes with polarities. This partly answers a question of Erdo s from the 1930's. 1996 Academic Press, Inc. ## 1. Results Let f (n) denote the maximum n