The concept of fairing applied to irregular triangular meshes has become more and more important. Previous contributions constructed better fairing operators, and applied them both to multiresolution editing tools and to multiresolution representations of meshes. In this paper, we generalize these powerful techniques to handle non-manifold models. Our framework computes a multilevel fairing of ...

Computational fluid dynamics (CFD) simulations of flow over complex objects have been performed traditionally using fluid-domain meshes that conform to the shape of the object. However, creating shape conforming meshes for complicated geometries like automobiles require extensive geometry preprocessing. This process is usually tedious and requires modifying the geometry, including specialized o...

Weidong Min Abstract. This paper presents an algorithm based on shrunken polyhedron and mapping to mesh a convex polyhedron using mixed elements, with mostly hexahedra, but including some tetrahedra, pyramids, and wedges. It is part of a scheme for automatically meshing an arbitrary 3D geometry. The scheme rst decomposes a 3D geometry into a set of convex polyhedra. Then the boundary quadrilate...

This paper is concerned with the construction of graded meshes for approximating so-called singular solutions of elliptic boundary value problems by means of multipatch discontinuous Galerkin Isogeometric Analysis schemes. Such solutions appear, for instance, in domains with re-entrant corners on the boundary of the computational domain, in problems with changing boundary conditions, in interfa...

We propose a method to generate high-order unstructured curved meshes using the classical Winslow equations. We start with an initial straight-sided mesh in a reference domain, and fix the position of the nodes on the boundary on the true curved geometry. In the interior of the domain, we solve the Winslow equations using a new continuous Galerkin finite element discretization. This formulation...

The present paper describes an unstructured hexahedral mesh generator for viscous flow simulations around complex 3D configurations. The first step of this method is the geometric adaptation of an initial non-body-fitted mesh by grid embedding. The resulting octree mesh is then fitted to the actual boundaries of the domain and its main features, such as sharp edges and corners, are captured. De...

The Galerkin boundary element discretisations of the electric eld integral equation (EFIE) on Lipschitz polyhedral surfaces su er slow convergence rates when the underlying surface meshes are quasi-uniform and shape-regular. This is due to singular behaviour of the solution to this problem in neighbourhoods of vertices and edges of the surface. Aiming to improve convergence rates of the Galerki...

This paper describes an approach to construct unstructured tetrahedral and hexahedral meshes for a domain with multiple materials. We have developed an octree-based isocontouring method to construct unstructured 3D meshes for a single material domain. Based on it, we analyze each material change edge instead of sign change edge to figure out interfaces between two materials, and mesh each mater...

In the applications such as scientific and medical visualization, highly detailed polygonal meshes are needed. Rendering these polygonal meshes usually exceeds the capabilities of graphics hardware. To improve rendering efficiency and maintain proper interactivity, the polygonal mesh simplification technique is commonly used to reduce the number of polygons of the mesh and to construct the mult...

The use of polygonal meshes, especially triangle meshes, is manifold, but a lot of algorithms require the mesh to be structured in a certain way and cannot be applied to an arbitrarily structured mesh. The process of replacing an arbitrarily structured mesh by a structured one is called remeshing and the most important class of structered meshes are triangle meshes with subdivision connectivity...