Abstract
Computing the topology of an algebraic plane curve C means computing a combinatorial graph that is isotopic to C and thus represents its topology in R 2 . We prove that, for a polynomial of degree n with integer coefficients bounded by 2 ρ , the topology of the induced curve can be computed with O ̃ ( n 8 ρ ( n + ρ ) ) bit operations ( O ̃ indicates that we omit logarithmic factors). Our analysis improves the previous best known complexity bounds by a factor of n 2 . The improvement is based on new techniques to compute and refine isolating intervals for the real roots of polynomials, and on the consequent amortized analysis of the critical fibers of the algebraic curve.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
