arXiv Computer Vision

Differentiable Voxelization of Surface Representations

The paper introduces a differentiable voxelization technique that computes gradients of volumetric properties, such as winding numbers, with respect to surface mesh parameters. This method allows efficient optimization of triangle meshes using voxel-based volume samples on a regular grid. The authors demonstrate its utility in applications like resolving mesh intersections, designing manufacturable shapes for bandsaw cutting, and creating near-tiling 3D structures.

arXiv AI
Aug 11

P2Voxel: Pyramid Pivot Voxelization for 3D Mesh Tokenization

arXiv:2608. 07549v1 Announce Type: cross Abstract: Triangle meshes provide explicit and accurate surface geometry, yet their irregular topology connectivity makes 3D mesh tokenization a geometric sampling problem: how to sample and organize geometric evidence into compact, structured and learnable tokens.

By Zhenhong Sun, Haozhe Liu, Yifu Wang, Xibin Song, Senbo Wang, Huadong Mo, Daoyi Dong, Hongdong Li, Pan Ji
arXiv Computer Vision
2d ago

Elastic Triangle Splatting

arXiv:2608.29106v1 Announce Type: new Abstract: While neural rendering methods such as 3D Gaussian Splatting achieve remarkable visual fidelity, traditional polygonal meshes remain the backbone of es...

By Tian Shi, Shenhan Qian, Daniel Cremers
arXiv Machine Learning
Jun 3

CADFit: Precise Mesh-to-CAD Program Generation with Hybrid Optimization

arXiv:2605. 01171v2 Announce Type: replace-cross Abstract: Despite recent progress, recovering parametric CAD construction sequences from geometric input, such as meshes or point clouds, is a key challenge for design and manufacturing, as existing CAD reconstruction and generation methods are largely restricted to difficult-to-edit formats like meshes or Breps or editable simple sketch-and-extrude pipelines and low-complexity datasets.

By Ghadi Nehme, Eamon Whalen, Faez Ahmed
arXiv Machine Learning
Aug 5

Robust Biharmonic Skinning Using Geometric Fields

arXiv:2406. 00238v3 Announce Type: replace-cross Abstract: Bounded bihramonic weights are a popular tool used to rig and deform characters for animation, to compute reduced-order simulations, and to define feature descriptors for geometry processing.

By Ana Dodik, Vincent Sitzmann, Justin Solomon, Oded Stein
arXiv Computer Vision
2d ago

ExMesh: Explicit Mesh Reconstruction with Topology Adaptation

arXiv:2606.07288v2 Announce Type: replace Abstract: Reconstructing surface meshes from multi-view images has remained a core challenge in recent years. Most existing methods, whether implicit or expl...

By Chuanjin Fan, Lifan Wu, Wenjie Chang, Hanzhi Chang, Wenfei Yang, Tianzhu Zhang
arXiv Machine Learning
Jul 2

Efficient Compression of Structured and Unstructured Volumes via Learned 3D Gaussian Representation

arXiv:2607. 01164v1 Announce Type: new Abstract: Recent work has shown that implicit neural representations (INRs) can be trained to effectively compress structured and unstructured volume data, allowing for direct data querying with a reduced memory footprint.

By Landon Dyken, Sharmistha Chakrabarti, Nathan Debardeleben, Steve Petruzza, Qi Wu, Will Usher, Sidharth Kumar
arXiv Computer Vision
1d ago

TriFlow: Generating Artist-Like 3D Mesh Topology via Nearest-Vertex Vector Fields

TriFlow introduces a generative method for creating compact 3D meshes with artist‑like triangle topology directly from input geometry such as signed distance fields. It represents mesh topology as a nearest‑vertex vector field (NVF) over the surface, trains a latent flow‑matching model to synthesize this field, and then clusters surface regions to guide a constrained quadric error metric simplification. The resulting meshes closely match the input geometry while exhibiting structured, artist‑like connectivity, achieving 90% lower Chamfer Distance and an 8× speedup over state‑of‑the‑art learning‑based approaches.

By Haoxuan Li, Ziya Erko\c{c}, Daniele Sirigatti, Vladislav Rosov, Lei Li, Angela Dai, Matthias Nie{\ss}ner
arXiv Computer Vision
Aug 27

Steer the Sampling, Not the Kernel Grid: Geometry-Guided Sampling Operator for Volumetric Segmentation

The paper introduces a geometry‑guided sampling operator that directs feature sampling rather than altering convolution kernels in 3D encoder‑decoder networks. By predicting local orientations and bounded step sizes, the operator samples symmetrically around each voxel, generating compact geometric and boundary cues that improve fine‑structure segmentation. Replacing stride‑1 and stride‑2 operations in a 3D U‑Net yields consistent gains on BraTS, MSD Hepatic Vessel, and TDSC‑ABUS datasets, with better boundary metrics and fewer parameters, and the operator can be integrated into other backbones without architectural changes.

By Sizhe Wang, Himashi Peiris, Zhaolin Chen