AQFC method estimates mesh curvatures using quadratic surfaces.
problem Estimating curvatures for irregular polygonal meshes.
method Local approximation of vertices and normals by quadratic surfaces, computed as implicit surfaces.
result AQFC provides robust curvature estimation for irregular meshes.
Two algorithms create high-quality triangular meshes for surfaces with guaranteed angles.
problem Creating high-quality triangular meshes for surfaces with controlled angles.
method MidNormal and GradNormal algorithms generate meshes with specified angle constraints.
result Meshes converge to surfaces as mesh size decreases, maintaining specified angles.
Approximates smooth surfaces using Laguerre geometry meshes.
problem Approximating smooth surfaces in Laguerre geometry.
method Using Laguerre meshes composed of quadrilaterals, cones, and spherical faces.
result Laguerre conjugate nets and directions for surface approximation.
Physics-based method approximates mean curvature on surface meshes.
problem Estimating mean curvature on triangulated surfaces.
method Derives approximation from Young-Laplace equation and force balance.
result Approximation equivalent to discrete Laplace-Beltrami operator.
Paper proves discrete uniformizations converge to continuous for surfaces of genus ≥1.
problem Computing uniformizations for surfaces of genus >1.
method Discrete conformality and uniformization on triangle meshes.
result Discrete uniformizations approximate continuous uniformization for closed surfaces of genus ≥1.
Approximates surfaces using Laguerre geometry with spherical faces.
problem Approximating smooth surfaces using Laguerre geometry.
method Using Laguerre conjugate nets and spherical faces to approximate surfaces.
result Laguerre conjugate nets provide a method for surface approximation.
Paper studies superconvergence on surface meshes using gradient recovery.
problem Proving superconvergence on deviated surfaces.
method Introduces geometric supercloseness and an algorithmic framework for gradient recovery.
result Validates theoretical results with numerical examples.
PolyGen models 3D meshes directly, predicting vertices and faces sequentially.
problem Efficiently modeling 3D geometry for computer graphics, robotics, and games.
method Transformer-based autoregressive model for predicting mesh vertices and faces.
result PolyGen produces high-quality, usable 3D meshes and competitive conditional performance.
Unified framework designs LK structures using integer twists on non-manifold meshes.
problem Binary twisting limits topological possibilities and structural behaviors.
method Generalizes twist formulation to arbitrary integer labels for non-manifold meshes.
result Integer twists enable full connectivity and dynamic folding/articulation.
Paper generalizes discrete uniformization for genus-zero surfaces.
problem Discrete uniformization for surfaces of genus zero.
method Reduction to planar cases via stereographic projections.
result Generalization of discrete uniformization to genus-zero surfaces.
Generative model creates high-quality meshes from point clouds.
problem Creating accurate meshes from point cloud data.
method Modeling point cloud generation as sphere deformation through deep neural networks.
result The model efficiently generates high-quality meshes from point clouds.
Two Morse theory algorithms segment surface meshes into pants.
problem Segmenting surface meshes into pants.
method Two Morse theory algorithms: one using handles, the other using Reeb graph.
result Reeb graph based algorithm runs faster and achieves best time efficiency.
In this paper we are interested in defining affine structures on discrete quadrangular surfaces of the affine three-space. We introduce, in a constructive way, two classes of such surfaces, called respectively indefinite and definite surfaces. The underlying meshes for indefinite surfaces are asymptotic nets satisfying…
MeshCNN analyzes 3D shapes using edges, overcoming irregularities.
problem Irregularities in mesh representations hinder neural network analysis.
method MeshCNN uses specialized convolution and pooling layers on mesh edges, collapsing them to focus on important features.
result MeshCNN effectively analyzes 3D shapes, learning which edges to collapse.
We found a class of triangulated surfaces in Euclidean space which have similar properties as isothermic surfaces in Differential Geometry. We call a surface isothermic if it admits an infinitesimal isometric deformation preserving the mean curvature integrand locally. We show that this class is Möbius invariant. Isoth…
Surface Networks enhance GNNs with extrinsic geometry for 3D mesh modeling.
problem Lack of isometry invariance in GNNs for 3D mesh modeling.
method Propose Surface Networks using the Dirac operator to detect principal curvature directions.
result Surface Networks improve stability and versatility in 3D mesh modeling tasks.
New method for surface analysis using restricted deformation bases.
problem Surface registration and comparison without pre-registered data.
method Elastic Riemannian metrics with basis-restricted transformations.
result Effective implementation on human body and face scans.
STM maps improve terrain perception for autonomous robots.
problem Perception of terrain for autonomous robots in general environments.
method Stochastic triangular mesh (STM) technique for 2.5-D surface mapping.
result STM maps are more accurate than standard elevation maps.
A conservative discretization of incompressible Navier-Stokes equations is developed based on discrete exterior calculus (DEC). A distinguishing feature of our method is the use of an algebraic discretization of the interior product operator and a combinatorial discretization of the wedge product. The governing equatio…
New method avoids surface self-collision in geometric optimization.
problem Avoiding self-collision in surface optimization.
method Developed a numerical framework using tangent-point energy and fractional Sobolev inner product.
result Successfully accelerated collision avoidance scheme for triangle meshes.
Point cloud is the most fundamental representation of 3D geometric objects. Analyzing and processing point cloud surfaces is important in computer graphics and computer vision. However, most of the existing algorithms for surface analysis require connectivity information. Therefore, it is desirable to develop a mesh st…
Optimally estimate distances on surfaces using reconstructed meshes.
problem Estimating intrinsic distances on smooth submanifolds.
method Reconstruction of the surface using a tangential Delaunay complex, and Isomap variant.
result Minimax optimality achieved for distance estimation.
Paper presents a tensor-based method for denoising meshes, improving sharp features and smoothness.
problem Improving mesh denoising by retaining sharp features and producing smoother surfaces.
method Two-step tensor multiplication and binary optimization approach.
result Better retains sharp features and produces smoother surfaces compared to state-of-the-art methods.
Parallel algorithm for conformal parameterization of 3D surfaces.
problem Computational difficulties with high-resolution 3D surface meshes.
method Partitioning surfaces into subdomains, parallel local parameterization, partial welding for boundary integration, solving Laplace equation.
result Significant improvement in computational time and accuracy compared to existing methods.
Unsupervised mesh disentanglement separates identity and pose.
problem Geometric disentanglement for 3D deformable models.
method CFAN-VAE architecture using conformal factor and normal features.
result CFAN-VAE achieves state-of-the-art performance on unsupervised geometric disentanglement.
A neural atlas simplifies 3D geometry simulation by avoiding meshing.
problem Simulation of complex 3D geometries with thin features or non-trivial topology.
method Learned geometric representation of overlapping volumetric coordinate charts, trained from point-cloud or level-set data.
result The learned atlas enables different solvers without re-meshing or re-parametrization.
Paper proposes meshAdv to generate adversarial 3D meshes for visual recognition.
problem Vulnerability of deep neural networks to adversarial examples.
method Differentiable renderer to manipulate shape and texture of 3D meshes.
result 3D meshes effectively attack classifiers and object detectors.
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.
problem Efficient and accurate voxelization of 3D meshes.
method Differentiable voxelization using winding number and solid angles, with GPU acceleration and neural network deformation.
result State-of-the-art performance in accuracy and efficiency on the ShapeNet dataset.
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.
problem Representing and manipulating 2D shapes as triangular meshes.
method Developed a geodesically complete Riemannian metric for triangular meshes.
result The metric preserves mesh connectivity and avoids mesh degradation.
Generalized meshes for non-regular geometries, including fractures.
problem Discretization of partial differential equations in non-regular geometries.
method Introduces generalized meshes with overlapping elements and flexible adjacency relations.
result Discrete differential forms on virtually inflated meshes characterize the trace space of forms in surrounding volumes.
The article discusses how to create a special type of triangle mesh for surfaces in 3D space.
problem Creating a special type of triangle mesh for surfaces in 3D space.
method Using sufficient conditions and the diagonal switch algorithm to find an embedded Delaunay triangulation.
result The diagonal switch algorithm can find an embedded Delaunay triangulation for a point cloud on an embedded surface in R3. New method improves human mesh recovery for obese people.
problem Improving mesh recovery for obese people.
method Generative optimization of mesh parameters from 2D keypoints.
result Significant improvement in mesh recovery performance on obese person images.
Paper presents a consistent discretization for Hodge decomposition on volumetric meshes.
problem Discretization of Hodge decomposition for vector fields on volumetric meshes.
method Edge-based Nedelec elements and face-based Crouzeix-Raviart elements interplay.
result Stable and efficient method for large-sized models with good performance.
Extends geometric decompositions to arbitrary meshes and forms.
problem Constructing local bases for finite element spaces on arbitrary meshes.
method Generalizes extension operators to arbitrary meshes and forms, showing they yield geometric decompositions.
result Extension operators yield geometric decompositions for arbitrary meshes and forms.
The paper explores the topology of polygonal meshes and their properties.
problem Understanding the topological properties of polygonal meshes.
method Overview of topological concepts, definitions of intrinsic and extrinsic topology, proofs of Euler and Euler-Poincaré formulas, and discussion on cutting meshes.
result Detailed understanding and definitions of polygonal mesh topology, including intrinsic and extrinsic properties.
Proposes a new CNN for meshes that can handle orientation.
problem Isotropic kernels in graph convolutions are insensitive to mesh geometry.
method Introduces gauge equivariant kernels and geometric message passing.
result Significantly improved expressivity over conventional GCNs.
Paper introduces stochastic mesh methods for efficient CVA computation.
problem Efficient computation of CVA for large systems using Monte Carlo methods.
method Introduces two stochastic mesh methods for CVA computation.
result Demonstrates the rate of convergence of the methods to real CVA values.
Mesh-TensorFlow enables efficient deep learning on large clusters.
problem Memory constraints and inefficiency in batch-splitting for large models.
method Introduces Mesh-TensorFlow for specifying general tensor computations across a multi-dimensional mesh of processors.
result Trains Transformer models with up to 5 billion parameters on TPU meshes of up to 512 cores.
New findings on mesh group-planes validate Signature-inverse Theorem under specific conditions.
problem Invalidity of existing inverse theorems for mesh group-planes.
method Classification of three and five point meshes, analysis of joint invariant signatures.
result Valid conditions for the Signature-inverse Theorem in mesh group-planes.
A new neural network model extends word embedding vectors with MeSH concepts for biomedical semantic similarity.
problem Eliciting semantic similarity between biomedical concepts remains challenging.
method Proposes a MeSH-gram neural network model that extends skip-gram by using MeSH descriptors.
result MeSH-gram outperforms skip-gram and is comparable to best methods but requires more computation and external resources.
The spectral geometry of mesh matrices of graphs is explored, leading to new formulas and eigenvalue estimates.
problem Understanding the spectral properties of mesh matrices of graphs.
method Definition and study of mesh matrices, introduction of mesh Laplacian, derivation of characteristic polynomial formulas.
result Mesh Laplacian eigenvalues are all real and greater than or equal to 1, with a smallest positive eigenvalue estimated.
We consider a general theory of curvatures of discrete surfaces equipped with edgewise parallel Gauss images, and where mean and Gaussian curvatures of faces are derived from the faces' areas and mixed areas. Remarkably these notions are capable of unifying notable previously defined classes of surfaces, such as discre…
A new numerical framework simplifies elastic surface matching and comparison.
problem Challenging problem in surface comparison and matching in computer vision.
method Relaxing the geodesic boundary constraint using a varifold fidelity metric.
result Flexibility to deal with arbitrary topologies and sampling patterns, scalability to large meshes.
Differential quantities, including normals, curvatures, principal directions, and associated matrices, play a fundamental role in geometric processing and physics-based modeling. Computing these differential quantities consistently on surface meshes is important and challenging, and some existing methods often produce …
Surface parameterizations and registrations are important in computer graphics and imaging, where 1-1 correspondences between meshes are computed. In practice, surface maps are usually represented and stored as 3D coordinates each vertex is mapped to, which often requires lots of storage memory. This causes inconvenien…
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…