Related papers: An algorithm for two-dimensional mesh generation b…
Second order accurate Cartesian grid methods have been well developed for interface problems in the literature. However, it is challenging to develop third or higher order accurate methods for problems with curved interfaces and internal…
We present a novel coarse-to-fine framework that derives a semi-regular multiscale mesh representation of an original input mesh via remeshing. Our approach differs from the conventional mesh wavelet transform strategy in two ways. First,…
Thinning is the removal of contour pixels/points of connected components in an image to produce their skeleton with retained connectivity and structural properties. The output requirements of a thinning procedure often vary with…
For explicit interface tracking in three dimensions, we propose a linear MARS method that (a) represents the interface by a partially ordered set of glued surfaces and approximates each glued surface with a triangular mesh, (b) maintains an…
One approach to achieving correct finite element assembly is to ensure that the local orientation of facets relative to each cell in the mesh is consistent with the global orientation of that facet. Rognes et al. have shown how to achieve…
In this paper, based on the idea of self-adjusting steepness based schemes[5], a two-dimensional calculation method of steepness parameter is proposed, and thus a two-dimensional self-adjusting steepness based limiter is constructed. With…
We propose an end-to-end pipeline to robustly generate high-quality, high-order and coarse quadrilateral meshes on CAD models. This kind of mesh enables the use of high-order analysis techniques such as high-order finite element methods or…
This paper presents an enhanced direct-method-based approach for the real-time solution of optimal control problems to handle path constraints, such as obstacles. The principal contributions of this work are twofold: first, the existing…
For triangulations generated by the adaptive bisection algorithm by Maubach and Traxler we prove existence of a regularized mesh function with grading two. This sharpens previous results in two dimensions for the newest vertex bisection and…
In this work, we propose an automatic mesh generation algorithm, FlowMesher, which can be used to generate unstructured meshes for mesh domains in any shape with minimum (or even no) user intervention. The approach can generate high-quality…
Reducing the triangle count in complex 3D models is a basic geometry preprocessing step in graphics pipelines such as efficient rendering and interactive editing. However, most existing mesh simplification methods exhibit a few issues.…
Meshes are widely used in 3D computer vision and graphics, but their irregular topology poses challenges in applying them to existing neural network architectures. Recent advances in mesh neural networks turn to remeshing and push the…
We present a geometric Particle-in-Cell (PIC) algorithm on two-dimensional (2D) unstructured meshes for studying electrostatic perturbations in magnetized plasmas. In this method, ions are treated as fully kinetic particles, and electrons…
Numerous methods have been proposed for probabilistic generative modelling of 3D objects. However, none of these is able to produce textured objects, which renders them of limited use for practical tasks. In this work, we present the first…
We explain the relation between certain random tiling models and interacting particle systems belonging to the anisotropic KPZ (Kardar-Parisi-Zhang) universality class in 2+1-dimensions. The link between these two \emph{a priori} disjoint…
A virtual element method (VEM) with the first order optimal convergence order is developed for solving two-dimensional Maxwell interface problems on a special class of polygonal meshes that are cut by the interface from a background…
This tutorial describes the geometry and algorithms for generating line drawings from 3D models, focusing on occluding contours. The geometry of occluding contours on meshes and on smooth surfaces is described in detail, together with…
The presented article contains a 2D mesh generation routine optimized with the Metropolis algorithm. The procedure enables to produce meshes with a prescribed size h of elements. These finite element meshes can serve as standard discrete…
The objective is to find a Cellular Automata rule that can form a 2D point pattern with a maximum number of points (1-cells). Points are not allowed to touch each other, they have to be separated by 0-cells, and every 0-cell can find at…
This work proposes a novel metric based algorithm for quadrilateral mesh generating. Each quad-mesh induces a Riemannian metric satisfying special conditions: the metric is a flat metric with cone signualrites conformal to the original…