2025/02/07 by Burr, Michael, Byrd, Michael, Lee, Kisun · 1 citation
#65H14 #Algebraic Geometry (math.AG) #FOS: Computer and information sciences #FOS: Mathematics #Numerical Analysis (math.NA) #Symbolic Computation (cs.SC)
paper · doi:10.48550/arxiv.2502.05357
We present a certified algorithm that takes a smooth algebraic curve in ℝn and computes an isotopic approximation for a generic projection of the curve into ℝ2. Our algorithm is designed for curves given implicitly by the zeros of n-1 polynomials, but it can be partially extended to parametrically defined curves. The main challenge in correctly computing the projection is to guarantee the topological correctness of crossings in the projection. Our approach combines certified path tracking and interval arithmetic in a two-step procedure: first, we construct an approximation to the curve in ℝn, and, second, we refine the approximation until the topological correctness of the projection can be guaranteed. We provide a proof-of-concept implementation illustrating the algorithm.