A Geodesic Stratification of Two-dimensional Semi-algebraic Sets
Chengcheng Yang

TL;DR
This paper constructs a semi-algebraic stratification of planar semi-algebraic sets ensuring finite intersections with shortest paths, offering new insights into the structure of geodesics in semi-algebraic geometry.
Contribution
It introduces a specific stratification of planar semi-algebraic sets that guarantees finitely many geodesic segments within each cell, advancing understanding of geodesic behavior in semi-algebraic sets.
Findings
Provides a cell decomposition with finiteness property for geodesic intersections
Offers a framework for high-dimensional stratifications related to geodesics
Enhances understanding of shortest paths in semi-algebraic geometry
Abstract
Given any arbitrary semi-algebraic set , any two points in may be joined by a piecewise path of shortest length. Suppose is a semi-algebraic stratification of such that each component of is either a singleton or a real analytic geodesic segment in , the question is whether has at most finitely many such components. This paper gives a semi-algebraic stratification, in particular a cell decomposition, of a real semi-algebraic set in the plane whose open cells have this finiteness property. This provides insights for high dimensional stratifications of semi-algebraic sets in connection with geodesics.
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
TopicsAdvanced Numerical Analysis Techniques · Advanced Differential Equations and Dynamical Systems · Polynomial and algebraic computation
