Related papers: Multi-resolution unstructured grid-generation for …
An algorithm for the generation of non-uniform, locally-orthogonal staggered unstructured spheroidal grids is described. This technique is designed to generate very high-quality staggered Voronoi/Delaunay meshes appropriate for general…
A Frontal-Delaunay refinement algorithm for mesh generation in piecewise smooth domains is described. Built using a restricted Delaunay framework, this new algorithm combines a number of novel features, including: (i) an unweighted,…
The variational grid generation method is a powerful tool for generating structured convex grids on irregular simply connected domains whose boundary is a polygonal Jordan curve. Several examples that show the accuracy of a difference…
The generation of high-quality staggered unstructured grids is considered, leading to the development of a new optimisation-based strategy designed to construct weighted `Regular-Power' tessellations appropriate for co-volume type numerical…
An extension of the restricted Delaunay-refinement algorithm for surface mesh generation is described, where a new point-placement scheme is introduced to improve element quality in the presence of mesh size constraints. Specifically, it is…
Despite the rapidly evolving field of computational electromagnetics, few open-source tools have managed to tackle the problem of automatic mesh generation for properly discretizing the problem of interest into a finite set of elements…
The use of multigrid and related preconditioners with the finite element method is often limited by the difficulty of applying the algorithm effectively to a problem, especially when the domain has a complex shape or adaptive refinement. We…
The theory and application of numerical methods for unstructured meshes have been improved significantly in recent years. Because the grids can be place arbitrarily in space, unstructured meshes can provide much higher spatial resolution…
This paper presents a fast an robust mesh generation procedure that is able to generate meshes of the earth system (ocean and continent) in matters of seconds. Our algorithm takes as input a standard shape-file i.e. geospatial vector data…
In this paper, we develop a multigrid method on unstructured shape-regular grids. For a general shape-regular unstructured grid of ${\cal O}(N)$ elements, we present a construction of an auxiliary coarse grid hierarchy on which a geometric…
This work concerns with the following problem. Given a two-dimensional domain whose boundary is a closed polygonal line with internal boundaries defined also by polygonal lines, it is required to generate a grid consisting only of…
We present an algorithm for producing Delaunay triangulations of manifolds. The algorithm can accommodate abstract manifolds that are not presented as submanifolds of Euclidean space. Given a set of sample points and an atlas on a compact…
Triangle meshes remain the most popular data representation for surface geometry. This ubiquitous representation is essentially a hybrid one that decouples continuous vertex locations from the discrete topological triangulation.…
We develop a computational framework that leverages the features of sophisticated software tools and numerics to tackle some of the pressing issues in the realm of earth sciences. The algorithms to handle the physics of multiphase flow,…
A new grid system on a sphere is proposed that allows for straight-forward implementation of both spherical-harmonics-based spectral methods and gridpoint-based multigrid methods. The latitudinal gridpoints in the new grid are equidistant…
In modern computer vision, images are typically represented as a fixed uniform grid with some stride and processed via a deep convolutional neural network. We argue that deforming the grid to better align with the high-frequency image…
Given a designer created free-form surface in 3d space, our method computes a grid composed of elastic elements which are completely planar and straight. Only by fixing the ends of the planar elements to appropriate locations, the 2d grid…
Intrinsic Delaunay triangulation (IDT) is a fundamental data structure in computational geometry and computer graphics. However, except for some theoretical results, such as existence and uniqueness, little progress has been made towards…
We introduce TetWeave, a novel isosurface representation for gradient-based mesh optimization that jointly optimizes the placement of a tetrahedral grid used for Marching Tetrahedra and a novel directional signed distance at each point.…
This work develops a nonlinear multigrid method for diffusion problems discretized by cell-centered finite volume methods on general unstructured grids. The multigrid hierarchy is constructed algebraically using aggregation of degrees of…