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.
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.
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…
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…
3D shape instantiation which reconstructs the 3D shape of a target from limited 2D images or projections is an emerging technique for surgical intervention. It improves the currently less-informative and insufficient 2D navigation schemes for robot-assisted Minimally Invasive Surgery (MIS) to 3D navigation. Previously,…
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.
Worldsheet wraps a 3D mesh sheet onto a single image to synthesize novel views.
problem Synthesizing novel views from a single image with large viewpoint changes.
method Shrink-wrapping a planar mesh sheet onto the input image, consistent with learned depth.
result Worldsheet consistently outperforms prior methods on single-image view synthesis.
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.
Highly expressive models such as deep neural networks (DNNs) have been widely applied to various applications. However, recent studies show that DNNs are vulnerable to adversarial examples, which are carefully crafted inputs aiming to mislead the predictions. Currently, the majority of these studies have focused on per…
PointTriNet generates 3D triangulations from point clouds efficiently and scalably.
problem Generating a triangulation among a set of points in 3D space.
method Iteratively applies a classification network and a proposal network over nearby points and triangles, using a novel triangle-relative input encoding.
result Generates robust and scalable triangulations for 3D learning pipelines.
The paper proves a new discrete Laplacian for 3D meshes and shows its superiority over primal construction.
problem Developing a more accurate discrete Laplacian for 3D meshes.
method Proves the Euler-Lagrange equation for the Dirichlet energy using the associated discrete Laplacian of the dual construction.
result The associated discrete Laplacian is optimal in R3 compared to the primal construction. 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.
LION generates high-quality 3D shapes using hierarchical latent diffusion models.
problem Creating high-quality 3D shapes for digital artists.
method Hierarchical Latent Point Diffusion Model (LION) with a global shape latent and point-structured latent space.
result LION achieves state-of-the-art generation performance on ShapeNet benchmarks.
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…
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…
A new method monitors unstructured 3D shapes without registration.
problem Error-prone registration and mesh reconstruction steps in PCD monitoring.
method Intrinsic geometric properties of shapes, using Laplacian and geodesic distances.
result Effective monitoring of defects without registration and mesh reconstruction.
EuLearn creates diverse 3D topological datasets for machine learning.
problem Training machine learning systems to discern topological features.
method Developed novel sampling and neural network architectures for graph and manifold data.
result Incorporating topological information improves deep learning performance on EuLearn datasets.
3D dataset for intracranial aneurysms aids deep learning applications.
problem Lack of 3D medical datasets for deep learning.
method Developed an open-access 3D dataset, IntrA, for intracranial aneurysms.
result Demonstrated the challenges and performance of 3D medical datasets.
Pix2Shape learns 3D scene representations from single images without supervision.
problem Learning 3D scene information from a single image without supervision.
method Pix2Shape uses an encoder, decoder, and critic network to generate 2.5D surfel-based reconstructions.
result Pix2Shape can generate complex 3D scenes from a single image, scaling with on-screen resolution.
Develops a method for conformal parameterization of point clouds without fixed boundaries.
problem Desirable distortion in fixed-boundary parameterizations of point clouds.
method Free-boundary conformal parameterization method involving approximation of point cloud Laplacian and boundary treatment.
result High-quality point cloud meshing achieved through the proposed method.
Recently, multiple formulations of vision problems as probabilistic inversions of generative models based on computer graphics have been proposed. However, applications to 3D perception from natural images have focused on low-dimensional latent scenes, due to challenges in both modeling and inference. Accounting for th…
Proposes polynomial neural networks for improved function approximation in various tasks.
problem Improving function approximation in various tasks like image generation, face verification, and 3D mesh representation learning.
method Introduces polynomial neural networks (Π-Nets) and three tensor decompositions to reduce parameter count and enhance expressiveness. result Demonstrates that Π-Nets can produce state-of-the-art results in challenging tasks without non-linear activation functions. Extends SW and GSW to compare heterogeneous joint distributions.
problem Limited applicability of SW and GSW to heterogeneous joint distributions.
method Introduces HHRT and PGRT to extend SW and GSW.
result H2SW distance for heterogeneous joint distributions.
Differentiable pipeline replaces non-differentiable CAE components for shape optimization.
problem Gradient-based optimization is limited by non-differentiable components in CAE workflows.
method Surrogate models replace non-differentiable pipeline components, enabling gradient-based optimization.
result Gradient-based shape optimization possible without differentiable solvers.
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…
In this paper, a new algorithm based on differential geometry viewpoint to solve the 3D rotating Navier-Stokes equations with complex Boundary is proposed, which is called Bi-parallel algorithm. For xample, it can be applied to passage flow between two blades in impeller and circulation flow through aircrafts with comp…
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.
We study data-driven representations for three-dimensional triangle meshes, which are one of the prevalent objects used to represent 3D geometry. Recent works have developed models that exploit the intrinsic geometry of manifolds and graphs, namely the Graph Neural Networks (GNNs) and its spectral variants, which learn…
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.
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.
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.
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.
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.
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. …
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…
Cardiac motion modeling using LDDMM and shape splines.
problem Difficulties in probing cardiac function due to shape and deformation interactions.
method LDDMM framework, parallel transport, normalization, shape splines.
result Significant differences in model parameters between pathologies, revealing insights into disease dynamics.
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 …
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.
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.
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.