Paper finds maximum curvature of Bézier-spline curves.
problem Finding maximum curvature of Bézier-spline curves.
method Modified B-spline solutions for inverse interpolation problem.
result Determined maximum curvature of Bézier-spline curves.
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,742 papers · 148 categories
Trend · papers per month
48 results for “Bezier curves”
Approximating complex curves with simple parametric curves is widely used in CAGD, CG, and CNC. This paper presents an algorithm to compute a certified approximation to a given parametric space curve with cubic B-spline curves. By certified, we mean that the approximation can approximate the given curve to any given pr…
For Bezier curves, subdivision algorithms create control polygons as piecewise linear (PL) approximations that converge in terms of Hausdorff distance. We prove that the exterior angles of control polygons under subdivision converge to 0 at the rate of , where is the number of subdivisions.…
The preservation of ambient isotopic equivalence under piecewise linear (PL) approximation for smooth knots are prominent in molecular modeling and simulation. Sufficient conditions are given regarding: (1) Hausdorff distance, and (2) a sum of total curvature and derivative. High degree Bezier curves are often used as …
We prove that the control polygon of a Bezier curve B becomes homeomorphic and ambient isotopic to B via subdivision, and we provide closed-form formulas to compute the number of iterations to ensure these topological characteristics. We first show that the exterior angles of control polygons converge exponentially to …
A variational model for data fitting on manifolds by minimizing the acceleration of a Bézier curvemath.NA
We derive a variational model to fit a composite Bézier curve to a set of data points on a Riemannian manifold. The resulting curve is obtained in such a way that its mean squared acceleration is minimal in addition to remaining close the data points. We approximate the acceleration by discretizing the squared second o…
Properties of a parametric curve in R^3 are often determined by analysis of its piecewise linear (PL) approximation. For Bezier curves, there are standard algorithms, known as subdivision, that recursively create PL curves that converge to the curve in distance . The exterior angles of PL curves under subdivision are s…
Combines Bézier curves with Gaussian processes for better sequential data modeling.
problem Limited expressiveness of MDNs in probabilistic modeling of sequential data.
method Integrates Gaussian processes with probabilistic Bézier curves for full Bayesian inference.
result Improves expressiveness of MDNs by enabling full Bayesian inference.
For applications in computing, Bezier curves are pervasive and are defined by a piecewise linear curve L which is embedded in R^3 and yields a smooth polynomial curve C embedded in R^3. It is of interest to understand when L and C have the same embeddings. One class of counterexamples is shown for L being unknotted, wh…
Proposes ridge regression on Riemannian manifolds for time-series prediction.
problem Time-series prediction on Riemannian manifolds.
method Combines Riemannian least-squares fitting via Bézier curves, empirical covariance on manifolds, and Mahalanobis distance regularization.
result Significant error reduction in synthetic spherical experiments and hurricane forecasting.
A set of control points can determine a Bezier surface and a triangulated surface simultaneously. We prove that the triangulated surface becomes homeomorphic and ambient isotopic to the Bezier surface via subdivision. We also show that the total Gaussian curvature of the triangulated surface converges to the total Gaus…
Bézier-GAN optimizes airfoil design by reducing shape complexity.
problem High computational cost in aerodynamic shape optimization.
method Generative adversarial networks (GANs) to learn compact shape representations.
result Empirically accelerates optimization convergence by at least two times.
The Bezier simplex fitting is a novel data modeling technique which exploits geometric structures of data to approximate the Pareto front of multi-objective optimization problems. There are two fitting methods based on different sampling strategies. The inductive skeleton fitting employs a stratified subsampling from e…
New ABC method improves Bézier simplex fitting for noisy data.
problem Overfitting in Bézier simplex fitting when sample points are not on the Pareto set.
method Extended Bézier simplex model to a probabilistic one and proposed a new learning algorithm based on approximate Bayesian computation (ABC) with Wasserstein distance.
result The new algorithm converges on a finite sample and outperforms deterministic methods on noisy instances.
Many real-world objects are designed by smooth curves, especially in the domain of aerospace and ship, where aerodynamic shapes (e.g., airfoils) and hydrodynamic shapes (e.g., hulls) are designed. To facilitate the design process of those objects, we propose a deep learning based generative model that can synthesize sm…
Background elimination for noisy character images or character images from real scene is still a challenging problem, due to the bewildering backgrounds, uneven illumination, low resolution and different distortions. We propose a stroke-based character reconstruction(SCR) method that use a weighted quadratic Bezier cur…
Paper develops efficient mechanisms for estimating variance and covariance under differential privacy in the add-remove model.
problem Estimating variance and covariance under differential privacy in the add-remove model.
method Developed mechanisms based on the Bézier mechanism, a novel moment-release framework.
result Proved minimax optimality of the Bézier-based estimator in the high-privacy regime and demonstrated its better utility in instance-wise analysis.
Kernel improves Gaussian process scalability for wide datasets.
problem Under-performance of Gaussian processes on wide data.
method Introduces Bézier Gaussian Process kernel with exponential summarising variables growth and linear cost.
result Empirically demonstrates scalability to both tall and wide datasets.
Develops a hierarchical model for analyzing longitudinal data on manifolds.
problem Correlation between intra-subject measurements in nonlinear manifolds.
method Geodesic hierarchical models extended to Bézier spline trends.
result Validated on osteoarthritis data, improving disease progression classification.
Quantum computing speeds up neural network training and retraining.
problem Inefficient classical training and retraining of neural networks.
method Adiabatic quantum computing to optimize Kolmogorov-Arnold Networks using Bezier curves.
result Quantum optimization achieves 100x faster retraining compared to classical methods.
Minimal surfaces with isothermal parameters admitting Bézier representation were studied by Cosin and Monterde. They showed that, up to an affine transformation, the Enneper surface is the only bi-cubic isothermal minimal surface. Here we study bi-quartic isothermal minimal surfaces and establish the general form of th…
We describe an online handwriting system that is able to support 102 languages using a deep neural network architecture. This new system has completely replaced our previous Segment-and-Decode-based system and reduced the error rate by 20%-40% relative for most languages. Further, we report new state-of-the-art results…
Representations of sequential data are commonly based on the assumption that observed sequences are realizations of an unknown underlying stochastic process, where the learning problem includes determination of the model parameters. In this context the model must be able to capture the multi-modal nature of the data, w…
Cubic spline interpolation on Euclidean space is a standard topic in numerical analysis, with countless applications in science and technology. In several emerging fields, for example computer vision and quantum control, there is a growing need for spline interpolation on curved, non-Euclidean space. The generalization…
LoRA-Curve connects independent LoRA optima through continuous low-loss valleys, improving Bayesian model averaging.
problem Challenges in estimating epistemic uncertainty in LoRA-based Bayesian inference.
method Introduces LoRA-Curve, a segmented Bézier curve parameterization in the LoRA space, with free and anchored configurations.
result Empirically shows that connecting independent LoRA optima through continuous low-loss valleys improves mutual information of the predictive distribution.
This paper develops a new method for constructing splines on Lie groups using Poisson equation solutions.
problem Existing methods for constructing splines on Lie groups have limitations and assumptions that may not reflect actual curves.
method The paper introduces a new approach using solutions of the Poisson equation on Lie groups to construct splines.
result The new method allows for global splines with arbitrary initial conditions, improving curve reconstruction.
Generative Thermal Design Through Boundary Representation and Multi-Agent Cooperative Environmentcs.LG
Generative thermal design learns optimal shapes using multi-agent reinforcement learning.
problem Complex thermal design challenges due to convection-diffusion equation and boundary interactions.
method Cooperative multi-agent deep reinforcement learning with continuous geometric representation.
result Framework learns optimal design strategies without shape derivation or differentiable objectives.
Unsupervised ranking faces one critical challenge in evaluation applications, that is, no ground truth is available. When PageRank and its variants show a good solution in related subjects, they are applicable only for ranking from link-structure data. In this work, we focus on unsupervised ranking from multi-attribute…
Improved tracking of tangled point sources using Riemannian metrics.
problem Tangled point source trajectories in temporal stacks.
method Lifting to higher-dimensional space of roto-translation group, new regularisation based on relaxed Reeds-Shepp metric.
result Reconstruction and untangling of trajectories even from numerical standpoint.
Machining processes are most accurately described using complex dynamical systems that include nonlinearities, time delays, and stochastic effects. Due to the nature of these models as well as the practical challenges which include time-varying parameters, the transition from numerical/analytical modeling of machining …
The study explores Bertrand and Mannheim curves in 4D Euclidean space for framed curves.
problem Exploring Bertrand and Mannheim curves in 4D Euclidean space for framed curves.
method Defining and investigating Bertrand and Mannheim curves of framed curves in 4D Euclidean space.
result Bertrand and Mannheim curves exist even for framed curves in 4D Euclidean space, contrary to regular curves.
The study examines Bertrand Legendre curves in the unit tangent bundle over Euclidean plane.
problem Investigating properties of Legendre curves and their associated curves.
method Analyzing Bertrand Legendre curves and their associated curves, including parallel, evolute, and involute curves.
result Existence conditions and inverse operation for Bertrand Legendre curves are provided.
Method for generating new curves from plane curves on cylinders.
problem Generating new space curves from given plane curves.
method Defining a non-planar space curve on a right generalized cylinder and examining its focal curve.
result Parametric representation of the focal curve of a cylindrical curve.
In this study, we introduce a new approach to curve pairs by using integral curves. We consider the direction curve and donor curve to study curve couples such as involute-evolute curves, Mannheim partner curves and Bertrand partner curves. We obtain new methods to construct partner curves of a unit speed curve and giv…
The paper characterizes curves in pseudo-Galilean 4-space.
problem Characterizing curves in the pseudo-Galilean 4-space .
method Investigation and characterisation of admissible curves in terms of curvature functions.
result Necessary and sufficient conditions for admissible rectifying curves in .
In this paper, we introduce a new approach to non-lightlike curve pairs by using integral curves in Minkowski 3-space. We consider direction curve and donor curve to study non-lightlike curve couples such as involute-evolute curves, Mannheim partner curves and Bertrand partner curves. We obtain new methods to construct…
The paper explores Bertrand and framed curves in 3D space.
problem Characterizing Bertrand and framed curves in Euclidean 3-space.
method Analyzing curves where tangent, normal, or binormal lines match another curve's lines.
result Conditions for the existence of Bertrand and framed curves are clarified.
The paper examines how closed curves on surfaces intersect and how this intersection determines the curves.
problem Determining closed curves on surfaces based on their intersections.
method Constructing and studying -equivalent curves, analyzing intersections with other curves.
result Curves are determined by their intersections with all other curves, but non-simple curves require infinitely many intersections to distinguish.
Flow deforms locally convex curves to curves of constant k-order width.
problem Evolve locally convex curves to curves of constant k-order width.
method Introduced a nonlocal curvature flow to evolve locally convex curves in the plane.
result The flow converges to a smooth, locally convex curve of constant k-order width as time goes to infinity.
Modified curve shortening flow constructs -Angenent curve.
problem Constructing -Angenent curve.
method Modified curve shortening flow
result Constructs -Angenent curve.
Study on CR curves in 3-sphere, focusing on critical curves integration and existence.
problem Addressing the integration and existence of critical curves in the CR 3-sphere.
method Provided a procedure for the explicit integration of general critical curves and characterized closed curves.
result Existence of infinite countably many closed critical curves.
A non-Newtonian approach in differential geometry of curves: multiplicative rectifying curvesmath.DG
Study rectifying curves in 3D multiplicative Euclidean space.
problem Investigate rectifying curves in a non-Newtonian geometry setting.
method Apply multiplicative differential-geometric concepts to rectifying curves.
result Classify multiplicative rectifying curves using spherical curves.
The paper characterizes pedal curves of quadratic curves.
problem Understanding pedal curves of quadratic curves.
method Analyzing the inverse construction of pedal curves.
result Characterization of pedal curves of quadratic curves.
In classical curve theory, the geometry of a curve in three dimensions is essentially characterized by their invariants, curvature and torsion. When they are given, the problem of finding a corresponding curve is known as 'solving natural equations'. Explicit solutions are known only for a handful of curve classes, inc…
Unified description of aesthetic curves through self-affinities.
problem Characterizing log-aesthetic curves and their properties.
method Reformulating and proving self-affinities of planar curves, integrating equiaffine geometry.
result Unified characterization of constant curvature curves in similarity and equiaffine geometries.
Primitive curves in handlebodies form a connected complex.
problem Understanding the structure of curves in handlebodies.
method Defining and analyzing primitive curves and constructing sequences between them.
result The primitive curve complex for a handlebody is connected.
Study on Bertrand lightcone framed curves in Lorentz-Minkowski 3-space.
problem Analyzing mixed types of curves with singular points in Lorentz-Minkowski 3-space.
method Using lightcone frame to consider Bertrand types for lightcone framed curves.
result Existence conditions of Bertrand lightcone framed curves in all cases.
In this study, we introduce a new type of surface curves called D-type curve. This curve is defined by the property that the unit Darboux vector W0 of a space curve r(s) and unit surface normal n along the curve r(s) satisfy the condition <n,W0>=constant. We point out that a D-type curve is a geodesic curve or an asymp…