arXiv:2509. 03758v5 Announce Type: replace Abstract: We propose a data-driven interpolation framework for reconstructing real-valued functions on smooth manifolds from scattered pointwise observations.
Blended Chart Surfaces present a compact, network‑free, explicit surface representation that is smooth by construction and anchored to user‑provided topology. The method jointly optimizes polynomial maps at proxy mesh vertices to fit an implicit target shape, then fuses neighboring maps with a smooth one‑ring coordinate blending scheme, decoupling coarse geometry from fine details. The resulting surface is globally smooth, fully differentiable, and equivariant to rigid motions and scaling, enabling reliable access to differential quantities and surface energies while avoiding seam artifacts common in other explicit neural maps.
arXiv:2606. 18759v1 Announce Type: cross Abstract: The concept of geodesic-like curves was introduced by Chen in 2010 as a method for estimating shortest paths (geodesics) on parametric surfaces, with its convergence established theoretically.
Curvature-Aware Radius Shrinkage for Adaptive Nearest Neighbor Classification (CARSANN) is a geometry-driven framework that adapts the spatial support of each neighborhood based on local geometric complexity. It estimates intrinsic dimensionality with TwoNN, builds an intrinsic representation via PCA, and uses a shape-operator-based estimate of local mean curvature to shrink the radius in highly curved regions while keeping a broader support in flatter areas. Experiments on over 70 OpenML datasets show that CARSANN consistently outperforms standard k‑NN and rivals other adaptive nearest‑neighbor methods, achieving a mean balanced accuracy increase from 0.6506 to 0.7528 and statistically significant improvements on most datasets.
Mesh subdivision is a fundamental operation for converting coarse, editable meshes into high-resolution surfaces, with broad applications in digital asset creation. Classical rule-based schemes rely on fixed local refinement rules and often produce over-smoothed surfaces.
arXiv:2606. 00139v1 Announce Type: cross Abstract: Curvature-penalized geodesic models have proven their effectiveness in image segmentation by computing globally optimal curves.
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.
arXiv:2603. 05607v2 Announce Type: replace-cross Abstract: Computer-Aided Design (CAD) relies on structured and editable geometric representations, yet existing generative methods are constrained by small annotated datasets with explicit design histories or boundary representation (BRep) labels.
arXiv:2609.14521v1 Announce Type: new Abstract: Recovering editable 3D parametric curves from 2D images is a fundamental challenge in computer graphics, bridging pixel-based perception and vector-bas...
Reinforcement learning from human feedback (RLHF) for 3D generation is now established across a number of works, but most existing pipelines optimise explicit surface representations, often by converting radiance fields into meshes and training heavily on surface-supervised data. We instead fine-tune a pretrained 3D-aware generative model directly from a learned reward over radiance-field density ($σ$) values, with no externally supplied mesh or shape prior.
P-CORE introduces a self‑supervised surface consistency technique for point‑based neural representations, enabling robust adaptation to large deformations without needing ground‑truth deformed images. By generating random deformations and enforcing that the predicted surface after deformation matches the deformation applied to the original surface prediction, the method leverages attention‑based point representations with a learned interpolation kernel. Experiments on synthetic benchmarks and real‑world datasets show improved zero‑shot editing performance and reduced artifacts compared to existing point‑based approaches.
arXiv:2607. 07623v1 Announce Type: new Abstract: Nonlinear least-squares optimization is central to regression, physics-informed neural networks, and other machine-learning tasks.