Related papers: High quality mesh generation using cross and aster…

We present CrossLift, a technique for computing cross fields on meshes guided by visual features in images. We leverage powerful text-to-image priors that are capable of synthesizing images of feature-aligned quad meshes in 2D. We extract…

Information transfer between triangle meshes is of great importance in computer graphics and geometry processing. To facilitate this process, a smooth and accurate map is typically required between the two meshes. While such maps can…

We present a method for the digital fabrication of surfaces whose appearance varies based on viewing direction. The surfaces are constructed from a mesh of bars arranged in a self-occluding colored heightfield that creates the desired…

The creation of a volumetric mesh representing the interior of an input polygonal mesh is a common requirement in graphics and computational mechanics applications. Most mesh creation techniques assume that the input surface is not…

Clustering and visualizing high-dimensional (HD) data are important tasks in a variety of fields. For example, in bioinformatics, they are crucial for analyses of single-cell data such as mass cytometry (CyTOF) data. Some of the most…

We propose a two-stage algorithm for generating Delaunay triangulations in 2D and Delaunay tetrahedra in 3D that employs near maximal Poisson-disk sampling. The method generates a variable resolution mesh in 2- and 3-dimensions in linear…

Robust and scalable function evaluation at any arbitrary point in the finite/spectral element mesh is required for querying the partial differential equation solution at points of interest, comparison of solution between different meshes,…

Lattice structures have been widely used in applications due to their superior mechanical properties. To fabricate such structures, a geometric processing step called triangulation is often employed to transform them into the STL format…

Articulated 3D object generation is fundamental for creating realistic, functional, and interactable virtual assets which are not simply static. We introduce MeshArt, a hierarchical transformer-based approach to generate articulated 3D…

This short contribution presents a method for generating $N$-point spherical configurations with low mesh ratios. The method extends Caspar-Klug icosahedral point-grids to non-icosahedral nets through the use of planar barycentric…

We use a time-relaxed linear grid generator of Winslow type to propose a new deterministic-stochastic domain decomposition approach to the generation of adaptive moving meshes. The method uses the probabilistic form of the exact solution of…

We present an extension of the tensor grid method for stray field computation on rectangular domains that incorporates higher-order basis functions. Both the magnetization and the resulting magnetic field are represented using higher-order…

We present Advancing Front Mapping (AFM), a provably robust algorithm for the computation of surface mappings to simple base domains. Given an input mesh and a convex or star-shaped target domain, AFM installs a (possibly refined) version…

We introduce a novel representation and optimization framework for discrete geodesics on triangle meshes that reduces artifacts of linear methods on uneven and coarse discretizations. Our method computes squared geodesic distances from…

Existing auto-regressive mesh generation approaches suffer from ineffective topology preservation, which is crucial for practical applications. This limitation stems from previous mesh tokenization methods treating meshes as simple…

This paper describes a method for fast simplification of surface meshes. Whereas past methods focus on visual appearance, our goal is to solve equations on the surface. Hence, rather than approximate the extrinsic geometry, we construct a…

Mesh adaption procedures for finite element approximation allows one to adapt the resolution, by local refinement in the regions of strong variation of the function of interest. This procedure plays a key role in numerous applications of…

This paper introduces a method to synthesize a 3D tensor field within a constrained geometric domain represented as a tetrahedral mesh. Whereas previous techniques optimize for isotropic fields, we focus on anisotropic tensor fields that…

The efficient generation of meshes is an important component in the numerical solution of problems in physics and engineering. Of interest are situations where global mesh quality and a tight coupling to the solution of the physical partial…

We propose a two dimensional (2D) adaptive nodes technique for irregular regions. The method is based on equi-distribution principal and dimension reduction. The mesh generation is carried out by first producing some adaptive nodes in a…