Blended Chart Surfaces: A Seamless Explicit Representation for Smooth Surface Fitting

• URL: http://arxiv.org/abs/2606.18069v1
• Date: Tue, 16 Jun 2026 15:39:38 GMT
• Title: Blended Chart Surfaces: A Seamless Explicit Representation for Smooth Surface Fitting
• Abstract summary: We introduce Blended Chart Surfaces, a compact, network-free, explicit representation that is smooth by construction and anchored to user-provided charts.<n>We evaluate Blended Chart Surfaces on various topologies and geometric complexity, and compare against explicit alternatives.
• Score: 0.14323566945483496
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A surface representation suitable for geometry processing should be compact and explicit, provide global smoothness guarantees, support a wide range of surface topologies, and offer reliable access to differential quantities such as normals and surface energies, while remaining compatible with modern differentiable optimization. Existing neural representations typically sacrifice one or more of these properties: implicit fields typically require iso-surfacing for downstream use, while explicit neural maps are constrained by canonical-domain parametrizations or exhibit seam artifacts between local charts. We introduce Blended Chart Surfaces, a compact, network-free, explicit representation that is smooth by construction and anchored to user-provided topology. Given a coarse proxy mesh encoding the intended surface topology and approximate geometry, Blended Chart Surfaces jointly optimize for a polynomial map at each proxy vertex using an off-the-shelf optimizer to fit to an implicit target shape, avoiding the need for an input parametrization. Neighboring maps are fused using a smooth 'one-ring coordinate' blending scheme, decoupling topology and coarse geometry (carried by the proxy) from geometric details (carried by the local patches). The surface is globally smooth, fully differentiable, and enables stable evaluation of derivatives, making differential quantities and surface energies directly accessible. Additionally, our construction is equivariant to rigid motions and scaling of the proxy mesh. We evaluate Blended Chart Surfaces on various topologies and geometric complexity, and compare against explicit alternatives including interpolating-function baselines and mesh-displacement MLPs. Across these, Blended Chart Surfaces achieve a favorable trade-off among compactness, simplicity, access to differential quantities, and expressivity while remaining smooth across patch boundaries.

Related papers

• MANGO-Grasp: Mahalanobis Fields over Geometry-Oriented 3D Gaussians for Cross-Embodiment Dexterous Grasping [82.63833405368159]
  Cross-embodiment dexterous grasping aims to synthesize stable grasps across heterogeneous multi-fingered hands with little or no embodiment-specific tuning.<n>We propose MANGO-Grasp, an anisotropic interaction framework that represents objects as geometry-oriented 3D Gaussian primitives and robot hands as surface keypoints encoded into morpho-kinematic descriptors.
  arXiv  Detail & Related papers  (2026-08-03T10:12:15Z)
• A Mean Curvature Approach to Boundary Detection: Geometric Insights for Unsupervised Learning [52.452902154360565]
  We introduce Mean Curvature Boundary Points (MCBP), a novel geometric framework grounded in Geometric Machine Learning.<n>MCBP explicitly models the intrinsic curvature of the data manifold and computes pointwise mean curvature without requiring principled manifold parametrization.<n>Experiments on synthetic and real-world datasets demonstrate that MCBP consistently improves clustering performance.
  arXiv  Detail & Related papers  (2026-05-05T20:19:09Z)
• Geometric Mixture-of-Experts with Curvature-Guided Adaptive Routing for Graph Representation Learning [11.124702719919831]
  We propose a Geometric Mixture-of-Experts framework (GeoMoE) to better accommodate multi-scale topological structures.<n>Specifically, we design a graph-aware gating network that assigns node-specific fusion weights to ensure interpretable and geometry-consistent routing.<n>Experiments on six benchmark datasets demonstrate that GeoMoE outperforms state-of-the-art baselines across diverse graph types.
  arXiv  Detail & Related papers  (2026-03-20T06:09:01Z)
• FlexPara: Flexible Neural Surface Parameterization [71.65203972602673]
  This paper introduces FlexPara, an unsupervised neural optimization framework to achieve both global and multi-chart surface parameterizations.<n>We ingeniously design and combine a series of geometrically-interpretable sub-networks, with specific functionalities, to construct a bi-directional cycle mapping framework for global parameterization.<n>Experiments demonstrate the universality, superiority, and inspiring potential of our neural surface parameterization paradigm.
  arXiv  Detail & Related papers  (2025-04-27T12:30:08Z)
• Flexible Isosurface Extraction for Gradient-Based Mesh Optimization [65.76362454554754]
  This work considers gradient-based mesh optimization, where we iteratively optimize for a 3D surface mesh by representing it as the isosurface of a scalar field. We introduce FlexiCubes, an isosurface representation specifically designed for optimizing an unknown mesh with respect to geometric, visual, or even physical objectives.
  arXiv  Detail & Related papers  (2023-08-10T06:40:19Z)
• Explicit Neural Surfaces: Learning Continuous Geometry With Deformation Fields [33.38609930708073]
  We introduce Explicit Neural Surfaces (ENS), an efficient smooth surface representation that encodes topology with a deformation field from a known base domain. Compared to implicit surfaces, ENS trains faster and has several orders of magnitude faster inference times.
  arXiv  Detail & Related papers  (2023-06-05T15:24:33Z)
• Minimal Neural Atlas: Parameterizing Complex Surfaces with Minimal Charts and Distortion [71.52576837870166]
  We present Minimal Neural Atlas, a novel atlas-based explicit neural surface representation. At its core is a fully learnable parametric domain, given by an implicit probabilistic occupancy field defined on an open square of the parametric space. Our reconstructions are more accurate in terms of the overall geometry, due to the separation of concerns on topology and geometry.
  arXiv  Detail & Related papers  (2022-07-29T16:55:06Z)
• A Level Set Theory for Neural Implicit Evolution under Explicit Flows [102.18622466770114]
  Coordinate-based neural networks parameterizing implicit surfaces have emerged as efficient representations of geometry. We present a framework that allows applying deformation operations defined for triangle meshes onto such implicit surfaces. We show that our approach exhibits improvements for applications like surface smoothing, mean-curvature flow, inverse rendering and user-defined editing on implicit geometry.
  arXiv  Detail & Related papers  (2022-04-14T17:59:39Z)
• Differentiable Surface Triangulation [40.13834693745158]
  We present a differentiable surface triangulation that enables optimization for any per-vertex or per-face differentiable objective function over the space of underlying surface triangulations. Our method builds on the result that any 2D triangulation can be achieved by a suitably weighted Delaunay triangulation. We extend the algorithm to 3D by decomposing shapes into developable sets and differentiably meshing each set with suitable boundary constraints.
  arXiv  Detail & Related papers  (2021-09-22T12:42:43Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.