Related papers: An Improved Physically-Based Surface Triangulation…
In this paper, we analyze the complexity of natural parallelizations of Delaunay refinement methods for mesh generation. The parallelizations employ a simple strategy: at each iteration, they choose a set of ``independent'' points to insert…
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…
In this work we introduce a triangular Delaunay mesh generator that can be trained using reinforcement learning to maximize a given mesh quality metric. Our mesh generator consists of a graph neural network that distributes and modifies…
Modeling arbitrarily large deformations of surfaces smoothly embedded in three-dimensional space is challenging. The difficulties come from two aspects: the existing geometry processing or forward simulation methods penalize the difference…
Triangular meshes are a widely used representation in the field of 3D modeling. In this paper, we present a novel approach for edge length-based linear subdivision on triangular meshes, along with two auxiliary techniques. We conduct a…
We introduce radiance meshes, a technique for representing radiance fields with constant density tetrahedral cells produced with a Delaunay tetrahedralization. Unlike a Voronoi diagram, a Delaunay tetrahedralization yields simple triangles…
We introduce an algorithm to remesh triangle meshes representing developable surfaces to planar quad dominant meshes. The output of our algorithm consists of planar quadrilateral (PQ) strips that are aligned to principal curvature…
The typical goal of surface remeshing consists in finding a mesh that is (1) geometrically faithful to the original geometry, (2) as coarse as possible to obtain a low-complexity representation and (3) free of bad elements that would hamper…
This paper presents a GPU parallel algorithm to generate a new kind of polygonal meshes obtained from Delaunay triangulations. To generate the polygonal mesh, the algorithm first uses a classification system to label each edge of an input…
Harmonic decomposition of surfaces, such as spherical and spheroidal harmonics, is used to analyze morphology, reconstruct, and generate surface inclusions of particulate microstructures. However, obtaining high-quality meshes of…
In the given paper the algorithm describing original and universal principles of a triangulation of a smooth molecular surface: solvent excluding solvent (SES), received by primary and secondary rolling, and solvent accessible surface (SAS)…
CVT (Centroidal Voronoi Tessellation)-based remeshing optimizes mesh quality by leveraging the Voronoi-Delaunay framework to optimize vertex distribution and produce uniformly distributed vertices with regular triangles. Current CVT-based…
<incorrect proofs; does not consider an important case because of which the proofs are wrong. The paper was withdrawn from submission> One of the objectives of a Delaunay mesh refinement algorithm is to produce meshes with tetrahedral…
Recent advancements in Radiance Fields have significantly improved novel-view synthesis. However, in many real-world applications, the more advanced challenge lies in inverse rendering, which seeks to derive the physical properties of a…
We present and analyze a new finite element method for solving interface problems on a triangular grid. The method locally modifies a given triangulation such that the interfaces are accurately resolved and the maximal angle condition…
We present a novel approach named TBase for smoothing planar and surface quadrilateral meshes. Our motivation is that the best shape of quadrilateral element (square) can be virtually divided into a pair of equilateral right triangles by…
The notions of discrete conformality on triangle meshes have rich mathematical theories and wide applications. The related notions of discrete uniformizations on triangle meshes, suggest efficient methods for computing the uniformizations…
In this paper, we propose a new variational framework for 3D surface denoising over triangulated meshes, which is inspired by the success of semi-sparse regularization in image processing. Differing from the uniformly sampled image data,…
I present a 3D advancing-front mesh refinement algorithm that generates a constrained Delaunay mesh for any piecewise linear complex (PLC) and extend this algorithm to produce truly Delaunay meshes for any PLC. First, as in my recently…
Brownian dynamics of colloidal particles on complex surfaces has found important applications in diverse physical, chemical and biological processes. However, current Brownian dynamics simulation algorithms mostly work for relatively simple…