arXiv research

The paper explores the topology of polygonal meshes and their properties.

PolyGen models 3D meshes directly, predicting vertices and faces sequentially.

AQFC method estimates mesh curvatures using quadratic surfaces.

Polygonal meshes provide an efficient representation for 3D shapes. They explicitly capture both shape surface and topology, and leverage non-uniformity to represent large flat regions as well as sharp, intricate features. This non-uniformity and irregularity, however, inhibits mesh analysis efforts using neural networ…

We show that the driving force behind the regularizing effect of Laplacian smoothing on surface elements is the popular mean ratio quality measure. We use these insights to provide natural generalizations to polygons and polyhedra. The corresponding functions measuring the quality of meshes are easily seen to be convex…

Differentiable voxelization for 3D meshes with GPU acceleration.

In this paper we study geometric, algebraic, and computational aspects of flexibility and infinitesimal flexibility of Kokotsakis meshes. A Kokotsakis mesh is a mesh that consists of a face in the middle and a certain band of faces attached to the middle face by its perimeter. In particular any 3x3-mesh made of quadran…

We create a smooth manifold of triangular meshes with a geodesically complete metric.

Generalized meshes for non-regular geometries, including fractures.

New method improves human mesh recovery for obese people.

Extends geometric decompositions to arbitrary meshes and forms.

Proposes a new CNN for meshes that can handle orientation.

Approximates smooth surfaces using Laguerre geometry meshes.

New findings on mesh group-planes validate Signature-inverse Theorem under specific conditions.

We construct a three-point compact finite difference scheme on a non-uniform mesh for the time-fractional Black-Scholes equation. We show that for special graded meshes used in finance, the Tavella-Randall and the quadratic meshes the numerical solution has a fourth-order accuracy in space. Numerical experiments are di…

The spectral geometry of mesh matrices of graphs is explored, leading to new formulas and eigenvalue estimates.

Batch-splitting (data-parallelism) is the dominant distributed Deep Neural Network (DNN) training strategy, due to its universal applicability and its amenability to Single-Program-Multiple-Data (SPMD) programming. However, batch-splitting suffers from problems including the inability to train very large models (due to…

Some methods based on simple regularizing geometric element transformations have heuristically been shown to give runtime efficient and quality effective smoothing algorithms for meshes. We describe the mathematical framework and a systematic approach to global optimization-based versions of such methods for mixed volu…

Eliciting semantic similarity between concepts in the biomedical domain remains a challenging task. Recent approaches founded on embedding vectors have gained in popularity as they risen to efficiently capture semantic relationships The underlying idea is that two words that have close meaning gather similar contexts. …

We study the problem of approximating a surface $F$ in $R^3$ by a high quality mesh, a piecewise-flat triangulated surface whose triangles are as close as possible to equilateral. The MidNormal algorithm generates a triangular mesh that is guaranteed to have angles in the interval $[49.1^o, 81.8^o]$. As the mesh size $…

A relatively recent advance in cognitive neuroscience has been multi-voxel pattern analysis (MVPA), which enables researchers to decode brain states and/or the type of information represented in the brain during a cognitive operation. MVPA methods utilize machine learning algorithms to distinguish among types of inform…

Approximates surfaces using Laguerre geometry with spherical faces.

New method for mesh denoising using TGV of normal vector field.

In this paper, the author considers the numerical computation of CVA for large systems by Mote Carlo methods. He introduces two types of stochastic mesh methods for the computations of CVA. In the first method, stochastic mesh method is used to obtain the future value of the derivative contracts. In the second method, …

New methods classify convex lattice polygons for affine dimers.

New mesh network preserves symmetries in deep learning.

Paper proves discrete uniformizations converge to continuous for surfaces of genus ≥1.

The pentagram map's limit point is related to infinitesimal perturbations of polygons.

This work develops discrete Gaussian models for vector-valued data on triangular meshes.

General area-preserving motion of polygonal curves is formulated as a system of ODEs. Solution polygonal curves belong to a prescribed polygonal class, which is similar to the admissible class used in the crystalline curvature flow. The ODEs are discretized implicitly in time keeping a given constant area speed while s…

Study finds finitely many non-congruent polygonal domains with same Steklov spectrum.

Unified framework designs LK structures using integer twists on non-manifold meshes.

New property: polygons have a fixed dimension regardless of ambient space dimensions.

The paper classifies vertices in planar polygons formed by convex domains.

In this paper, we discuss centroaffine geometry of polygons in $3$-space. For a polygon $X$ that is locally convex with respect to an origin together with a transversal vector field $U$, we define the centroaffine dual pair $(Y,V)$ similarly to [6]. We prove that vertices of $(X,U)$ correspond to flattening points for …

We establish a fundamental connection between smooth and polygonal knot energies, showing that the Minimum Distance Energy for polygons inscribed in a smooth knot converges to the Moebius Energy of the smooth knot as the polygons converge to the smooth knot. However, the polygons must converge in a ``nice'' way, and th…

The pentagram map takes a planar polygon $P$ to a polygon $P'$ whose vertices are the intersection points of consecutive shortest diagonals of $P$. This map is known to interact nicely with Poncelet polygons, i.e. polygons which are simultaneously inscribed in a conic and circumscribed about a conic. A theorem of R. Sc…

Simple rectilinear polygons (i.e. rectilinear polygons without holes or cutpoints) can be regarded as finite rectangular cell complexes coordinatized by two finite dendrons. The intrinsic $l_1$-metric is thus inherited from the product of the two finite dendrons via an isometric embedding. The rectangular cell complexe…

Optimal Reeb graphs identified for polygon decomposition.

Study on Poncelet polygons' centers and circumcenters in various geometries.

The study proves analogues of the discrete isoperimetric inequality in hyperbolic geometry.

New formula for spherical polygon area via prequantization.

The map S transforms polygon sides, and almost no convex polygons remain convex.

In this article we investigate a family of nonlinear evolutions of polygons in the plane called the $β$-polygon flow and obtain some results analogous to results for the smooth curve shortening flow: (1) any planar polygon shrinks to a point and (2) a regular polygon with five or more vertices is asymptotically stable …

The study proves a discrete Blaschke theorem for convex polygons in 2-dimensional space forms.

Unsupervised mesh disentanglement separates identity and pose.

We study polygon spaces arising from planar configurations of necklaces with some of the beads fixed and some of the beads sliding freely. These spaces include configuration spaces of flexible polygons and some other natural polygon spaces. We characterise critical points of the oriented area function in geometric term…

To realize efficient computational fluid dynamics (CFD) prediction of two-phase flow, a multi-scale framework was proposed in this paper by applying a physics-guided data-driven approach. Instrumental to this framework, Feature Similarity Measurement (FSM) technique was developed for error estimation in two-phase flow …