Generalized Curvatures of Curves in $\mathbb{R}^n$
Lee-Peng Teo

TL;DR
This paper presents a new method to compute generalized curvatures of curves in n-dimensional space using principal minors of a specific matrix, enabling more efficient calculations.
Contribution
It introduces a formula expressing generalized curvatures in terms of principal minors, providing an efficient computational algorithm for curves in higher dimensions.
Findings
Derived explicit formulas for generalized curvatures in terms of matrix minors
Developed an efficient algorithm for curvature calculation in $\,\mathbb{R}^n$
Validated the method with theoretical proofs and computational examples
Abstract
For a curve of order , we prove that the generalized curvatures can be expressed in terms of the leading principal minors of the matrix , where is the matrix whose -th column is . This gives an efficient algorithm to calculate the curvatures.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric Analysis and Curvature Flows · Advanced Numerical Analysis Techniques · Holomorphic and Operator Theory
