AI & ML
Smooth Surfaces via Nets of Geodesics
arXiv cs.NA0 views
arXiv:2109.01429v4 Announce Type: replace-cross Abstract: We study the reconstruction of smooth surfaces from networks of spatial curves prescribed as geodesics. Motivated by applications in computer-aided geometric design and the perception of three-dimensional shape, we propose a variational approach minimizing the integral of squared Gaussian curvature over surfaces spanning geodesic contours. Using isothermal coordinates, we derive the Euler-Lagrange equation for the conformal factor of the metric and the associated Dirichlet and Neumann boundary conditions. We also consider a biharmonic approximation obtained by linearizing the nonlinear equation. Numerical experiments are performed on four quadrilateral cells of a geodesic network constructed on an ellipsoid. We compute approximate isothermal coordinates, solve the biharmonic boundary-value problem, and compare the resulting curvature with that of the reference surface. These experiments consist of an important step towards a complete framework for the computation of smooth surfaces from geodesic curves.
Source:https://arxiv.org/abs/2109.01429PreviousA Large Gap between Galerkin Errors with and without Mesh-Uniform Regularity for the KdV Equation with Boundary DissipationNextFirst-order methods for stochastic and finite-sum convex optimization with deterministic constraints
Related posts
Hydra · Coeziune OM–IA — the complete DOI registry (2026-11-18): 76 published works
0dev.to OpenSource
Your Rust Code Sets an Environment Variable and the 2024 Edition Calls That Unsafe
0dev.to Rust
Your Go Function Returned a Nil Error and the Caller Saw an Error Anyway
0dev.to Go
Kengele: an alarm for when an activist goes missing, that nobody can switch off
0dev.to Go
How OpenAI scales PostgreSQL to 800 million users
0dev.to Database
Spec-Driven PBT: Deriving Semantic Invariants from Code Specifications for Agentic Property-based Testing
0arXiv cs.SE