Certified algebraic curve projections by path tracking
Michael Burr, Michael Byrd, Kisun Lee

TL;DR
This paper introduces a certified algorithm that accurately computes topologically correct projections of smooth algebraic curves from higher dimensions into 2D, ensuring the preservation of crossings and topology.
Contribution
The paper presents a novel certified algorithm combining path tracking and interval arithmetic to produce topologically correct projections of algebraic curves.
Findings
Algorithm guarantees topological correctness of projections.
Implementation demonstrates practical viability.
Applicable to implicit algebraic curves, extendable to parametric cases.
Abstract
We present a certified algorithm that takes a smooth algebraic curve in and computes an isotopic approximation for a generic projection of the curve into . Our algorithm is designed for curves given implicitly by the zeros of 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 , 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.
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 · Computer Graphics and Visualization Techniques · Advanced Vision and Imaging
