The critical curvature degree of an algebraic variety
Emil Horobet
TL;DR
This paper investigates the complexity of computing the reach and critical spherical curvature points of algebraic varieties, providing properties and an algorithm for their computation across arbitrary dimensions.
Contribution
It introduces new properties of critical spherical curvature points and presents an algorithm to compute them for algebraic varieties in any dimension.
Findings
Analysis of the complexity of computing reach and curvature points
Properties of critical spherical curvature points
An algorithm for their computation
Abstract
In this article, we study the complexity involved in the computation of the reach in arbitrary dimension and in particular the computation of the critical spherical curvature points of an arbitrary algebraic variety. We present properties of the critical spherical curvature points as well as an algorithm for computing it.
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
TopicsPolynomial and algebraic computation · Algebraic Geometry and Number Theory · Mathematics and Applications