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…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,694 papers · 148 categories
Trend · papers per month
48 results for “spherical mesh data”
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.
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.
New graph convolution captures local features on non-Euclidean grids.
problem Capturing local features on irregular, coarse non-Euclidean grids.
method Low-rank learnable local filters in graph convolutions.
result Proves more expressive than previous spectral graph convolution methods.
We show how to compute the circular area invariant of planar curves, and the spherical volume invariant of surfaces, in terms of line and surface integrals, respectively. We use the Divergence Theorem to express the area and volume integrals as line and surface integrals, respectively, against particular kernels; our r…
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…
This work develops discrete Gaussian models for vector-valued data on triangular meshes.
problem Discrete representation of continuous vector-valued environmental data.
method Develops discrete intrinsic Gaussian processes for vector-valued data on triangular meshes using discrete differential operators.
result Models can capture harmonic flows, incorporate boundary conditions, and model non-stationary data.
Hydrogen atom confined inside an inverted-Gaussian potentialphysics.atom-ph
Hydrogen atom confined in an inverted-Gaussian potential, with detailed numerical methods and results.
problem Studying hydrogen atom in a specific potential.
method Three numerical methods: Lagrange-mesh, fourth order finite differences, and finite element method.
result Accurate numerical results for hydrogen atom energies and eigenfunctions, improving previous literature.
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…
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…
New method for mesh denoising using TGV of normal vector field.
problem Improving mesh quality by removing noise.
method Proposes a novel TGV formulation for normal vector fields on triangular meshes.
result New method outperforms existing techniques in mesh denoising experiments.
Computationally Efficient CFD Prediction of Bubbly Flow using Physics-Guided Deep Learningphysics.comp-ph
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 …
CupNet prunes neural nets for cup-shaped data.
problem Pruning neural networks for cup-shaped data.
method Used simulated cup drawing data to prune a neural network.
result Pruning effectively reduces network size for cup-shaped data.
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.
Fractured Meshesmath.NA
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.
New mesh network preserves symmetries in deep learning.
problem No existing mesh processing architecture is equivariant to all symmetries.
method Equivariant attention-based mesh network using relative tangential features.
result The network achieves improved performance and is equivariant to various transformations.
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.
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.
Parallelizable global conformal parameterization of simply-connected surfaces via partial weldingcs.CG
Conformal surface parameterization is useful in graphics, imaging and visualization, with applications to texture mapping, atlas construction, registration, remeshing and so on. With the increasing capability in scanning and storing data, dense 3D surface meshes are common nowadays. While meshes with higher resolution …
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.
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.
Generative models emulate climate model outputs for impact assessment.
problem Outdated climate model projections hinder adaptation and mitigation planning.
method Score-based diffusion on a spherical mesh, trained on monthly ESM fields.
result Generative models produce distributions closely matching ESM outputs.
New neural network solves Nirenberg problem for curvature on sphere.
problem Prescribing Gaussian curvature on for metrics conformal to the round metric.
method Mesh-free physics-informed neural network (PINN) that directly parametrises the conformal factor.
result Neural network achieves very low losses for realisable curvatures, distinguishing them from non-realisable ones.
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.
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.
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.
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.
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…
We developed a convolution neural network (CNN) on semi-regular triangulated meshes whose vertices have 6 neighbours. The key blocks of the proposed CNN, including convolution and down-sampling, are directly defined in a vertex domain. By exploiting the ordering property of semi-regular meshes, the convolution is defin…
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…
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 in 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 . As the mesh size $…
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, …
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.
GeONet learns the Wasserstein geodesic without mesh discretization.
problem Computing the Wasserstein geodesic between complex data distributions.
method Mesh-invariant deep neural operator network that learns saddle point optimality conditions.
result GeONet achieves comparable accuracy to standard OT solvers with reduced computational cost.
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.
Random feature model approximates PDE solutions efficiently.
problem Approximating solutions to PDEs with high-dimensional inputs and outputs.
method Random feature model applied to infinite-dimensional operators.
result Efficient and accurate approximation of PDE solutions.
In this note, we derive an approximation for the mean curvature normal vector on vertices of triangulated surface meshes from the Young-Laplace equation and the force balance principle. We then demonstrate that the approximation expression from our physics-based derivation is equivalent to the discrete Laplace-Beltrami…
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.
In this short paper we investigate whether meta-learning techniques can be used to more effectively tune the hyperparameters of machine learning models using successive halving (SH). We propose a novel variant of the SH algorithm (MeSH), that uses meta-regressors to determine which candidate configurations should be el…
PGF kernels analyze spherical data using generalized RBF kernels.
problem Analysis of spherical data.
method Introduced PGF kernels and a semi-parametric learning algorithm.
result PGF kernels generalize RBF kernels for spherical data.
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…
A new method for nonparametric regression using mesh-based solutions.
problem Estimating regression functions non-parametrically with computational tractability.
method Mesh-based approximate solution (MBS) for penalized regression problems.
result MBS transforms NPR to a discrete convex minimization problem, making it computationally feasible.
Generative modeling of 3D shapes has become an important problem due to its relevance to many applications across Computer Vision, Graphics, and VR. In this paper we build upon recently introduced 3D mesh-convolutional Variational AutoEncoders which have shown great promise for learning rich representations of deformab…