Cost Minimizing Local Anisotropic Quad Mesh Refinement

Dynamic Mesh Refinement with Quad Trees and Off-Centers

Many algorithms exist for producing quality meshes when the input point cloud is known a priori. However, modern finite element simulations and graphics applications need to change the input set during the simulation dynamically. In this paper, we show a dynamic algorithm for building and maintaining a quadtree under insertions into and deletions from an input point set in any fixed dimension. ...

CSALF-Q: A Bricolage Algorithm for Anisotropic Quad Mesh Generation

“Bricolage”, a multidisciplinary term used extensively in visual arts, anthropology and cultural studies, refers to a creation that borrows elements from a diverse range of existing designs. The term is applied here to describe CSALF-Q, a new automatic 2D quad meshing algorithm that combines the strengths of recursive subdivision, loop-paving and transfinite interpolation to generate surface me...

Domain Decomposition with Local Mesh Refinement

Local Adaptive Mesh Refinement for Shock Hydrodynamics

The aim of this work is the development of an automatic, adaptive mesh refinement strategy for solving hyperbolic conservation laws in two dimensions. There are two main difficulties in doing this. The first problem is due to the presence of discontinuities in the solution and the effect on them of discontinuities in the mesh. The second problem is how to organize the algorithm to minimize memo...

Local Mesh Refinement with the PCD Method

We propose some numerical tests for local mesh refinement using the PCD (piecewise constant distributions) method. The PCDmethod is a new discretization technique of boundary value problems. It represents the unknown distribution as well as its derivatives by piecewise constant distributions but on distinct meshes. With the PCDmethod, we can introduce a local mesh refinement without the use of ...