Computing Smooth Geodesics under Two-Sided Curvature Bounds with Applications to Robotics and Image Analysis

• URL: http://arxiv.org/abs/2606.14794v1
• Date: Thu, 11 Jun 2026 14:13:24 GMT
• Title: Computing Smooth Geodesics under Two-Sided Curvature Bounds with Applications to Robotics and Image Analysis
• Abstract summary: Curvature of planar curves serves as a key regularization term for computing second-order minimal paths.<n>We propose a new curvature-bounded geodesic model, developed under the Hamilton-Jacobi-Bellman (HJB) partial differential equation (PDE) framework.<n> Numerical experiments demonstrate that the proposed curvature-bounded geodesic model serves as a powerful and robust tool for finding satisfactory paths.
• Score: 23.336775580260337
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Curvature of planar curves serves as a key regularization term for computing second-order minimal paths, due to its tight relevance to desirable geometric properties such as smoothness, rigidity, and elasticity. In this paper, we tackle a more challenging problem in computational physics and geometry problem: tracking minimal paths whose curvature is constrained by arbitrary upper and lower bounds. For that purpose, we propose a new curvature-bounded geodesic model, developed under the Hamilton-Jacobi-Bellman (HJB) partial differential equation (PDE) framework. It provides strong geometric control over minimal paths by enforcing curvature range constraints, whose paths are smooth and of bounded curvature limitation. We also present a discretization scheme for the Hamiltonian and the HJB PDE incorporating curvature bounds, allowing efficient solver for estimating numerical solutions to the model. Finally, we illustrate the capability of the proposed curvature-bounded geodesic model in applications of robot path planning and curvilinear structures tracking from images. Numerical experiments demonstrate that the proposed curvature-bounded geodesic model serves as a powerful and robust tool for finding satisfactory paths.

Related papers

• A Neural Network Framework for Geodesic-Like Curve Computation on Parametric Surfaces [0.0]
  We propose an efficient approach for computing geodesic-like curves by leveraging deep learning and Physics-Informed Neural Networks (PINNs)<n>Under the proposed framework, not only can single parametric surfaces be handled efficiently, but a broad class of complex parametric surfaces can also be robustly addressed.
  arXiv  Detail & Related papers  (2026-06-17T07:18:39Z)
• Geodesics with Unified Tangent-constrained Priors and Curvature Regularization [24.540173691581575]
  Curvature-penalized geodesic models have proven their effectiveness in image segmentation by computing globally optimal curves.<n>We propose a unified geodesic framework that integrates tangent-constrained priors with curvature penalization.
  arXiv  Detail & Related papers  (2026-05-28T23:27:05Z)
• Fitting Unknown Number of Hyperplanes with Manifold Optimization [57.48093263119306]
  Fitting unknown number of linearplanes to data is a fundamental yet challenging problem in machine learning.<n>Existing approaches often struggle with optimum optima or lack geometric consistency.
  arXiv  Detail & Related papers  (2026-05-27T14:02:20Z)
• 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)
• Kinematics of continuum planar grasping [1.820191017437162]
  The paper presents an analytical framework to study the geometry arising when a soft continuum arm grasps a planar object.<n>Both the arm centerline and the object boundary are modeled as smooth curves.<n>The grasping problem is formulated as a kinematic boundary following problem, in which the object boundary acts as the arm's'shadow curve'
  arXiv  Detail & Related papers  (2026-04-10T18:22:41Z)
• Curvature Learning for Generalization of Hyperbolic Neural Networks [51.888534247573894]
  Hyperbolic neural networks (HNNs) have demonstrated notable efficacy in representing real-world data with hierarchical structures.<n>Inappropriate curvatures may cause HNNs to converge to suboptimal parameters, degrading overall performance.<n>We propose a sharpness-aware curvature learning method to smooth the loss landscape, thereby improving the generalization of HNNs.
  arXiv  Detail & Related papers  (2025-08-24T07:14:30Z)
• NeuVAS: Neural Implicit Surfaces for Variational Shape Modeling [59.41129792124764]
  NeuVAS is a variational approach to shape modeling using neural implicit surfaces constrained under sparse input shape control.<n>We introduce a smoothness term based on a functional of surface curvatures to minimize shape variation of the zero-level set surface of a neural SDF.
  arXiv  Detail & Related papers  (2025-06-16T02:39:45Z)
• Follow the Energy, Find the Path: Riemannian Metrics from Energy-Based Models [63.331590876872944]
  We propose a method for deriving Riemannian metrics directly from pretrained Energy-Based Models.<n>These metrics define spatially varying distances, enabling the computation of geodesics.<n>We show that EBM-derived metrics consistently outperform established baselines.
  arXiv  Detail & Related papers  (2025-05-23T12:18:08Z)
• First-Order Algorithms for Min-Max Optimization in Geodesic Metric Spaces [93.35384756718868]
  min-max algorithms have been analyzed in the Euclidean setting. We prove that the extraiteient (RCEG) method corrected lastrate convergence at a linear rate.
  arXiv  Detail & Related papers  (2022-06-04T18:53:44Z)
• Geodesic Models with Convexity Shape Prior [8.932981695464761]
  In this paper, we take into account a more complicated problem: finding curvature-penalized geodesic paths with a convexity shape prior. We establish new geodesic models relying on the strategy of orientation-lifting. The convexity shape prior serves as a constraint for the construction of local geodesic metrics encoding a curvature constraint.
  arXiv  Detail & Related papers  (2021-11-01T09:41:54Z)
• Exact imposition of boundary conditions with distance functions in physics-informed deep neural networks [0.5804039129951741]
  We introduce geometry-aware trial functions in artifical neural networks to improve the training in deep learning for partial differential equations. To exactly impose homogeneous Dirichlet boundary conditions, the trial function is taken as $phi$ multiplied by the PINN approximation. We present numerical solutions for linear and nonlinear boundary-value problems over domains with affine and curved boundaries.
  arXiv  Detail & Related papers  (2021-04-17T03:02:52Z)
• Curvature Regularized Surface Reconstruction from Point Cloud [4.389913383268497]
  We propose a variational functional and fast algorithms to reconstruct implicit surface from point cloud data with a curvature constraint. The proposed method shows against noise, and recovers concave features and sharp corners better compared to models without curvature constraint.
  arXiv  Detail & Related papers  (2020-01-22T05:34:40Z)

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.