skip to main content
10.1145/800059.801152acmconferencesArticle/Chapter ViewAbstractPublication PagessiggraphConference Proceedingsconference-collections
Article
Free Access

Topologically reliable display of algebraic curves

Authors Info & Claims
Published:01 July 1983Publication History

ABSTRACT

An algebraic curve is a set of points in the plane satisfying an equation F(x,y) = 0, where F(x,y) is a polynomial in x and y with rational number coefficients. The topological structure of an algebraic curve can be complicated. It may, for example, have multiple components, isolated points, or intricate self-crossings. In the field of Computer Algebra (Symbolic Mathematical Computation), algorithms for exact computations on polynomials with rational number coefficients have been developed. In particular, the cylindrical algebraic decomposition (cad) algorithm of Computer Algebra determines the topological structure of an algebraic curve, given F(x,y) as input. We describe methods for algebraic curve display which, by making use of the cad algorithm, correctly portray the topological structure of the curve. The running times of our algorithms consist almost entirely of the time required for the cad algorithm, which varies from seconds to hours depending on the particular F(x,y).

References

  1. 1.DS Arnon, "Automatic analysis of real algebraic curves," SIGSAM Bulletin (of the Association for Computing Machinery)15, pp. 3-9 (1981). Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2.DS Arnon, "Algorithms for the geometry of semialgebraic sets," Technical Report #436, Computer Science Dept., University of Wisconsin, Madison,Wisconsin(1981). (Ph.D. thesis) Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.DS Arnon, GE Collins, and S McCallum, "Cylindrical algebraic decomposition II: an adjacency algorithm for the plane," Technical Report CSD TR-428, Computer Science Dept., Purdue University(December, 1982).Google ScholarGoogle Scholar
  4. 4.DS Arnon and S McCallum, "Cylindrical algebraic decomposition by quantifier elimination," pp. 215-222 in Proceedings of the European Computer Algebra Conference (EUROCAM '82), ed. J Calmet,Lecture Notes in Computer Science, 144, Springer-Verlag, Berlin(1982). Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.DS Arnon, GE Collins, and S McCallum, "Cylindrical algebraic decomposition I: the basic algorithm," Technical Report CSD TR-427, Computer Science Dept., Purdue University(December, 1982).Google ScholarGoogle Scholar
  6. 6.GE Collins, "Computer algebra of polynomials and rational functions," American Mathematical Monthly80, pp. 725-755 (1973).Google ScholarGoogle Scholar
  7. 7.GE Collins, "Quantifier elimination for real closed fields by cylindrical algebraic decomposition," pp. 134-163 in Proceedings of the Second GI Conference on Automata and Formal Languages, Lecture notes in Computer Science, 33, Springer-Verlag, Berlin(1975). Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8.GE Collins, "SAC-2 and ALDES now available," SIGSAM Bulletin (of the Association for Computing Machinery)14, p. 19 (1980).Google ScholarGoogle Scholar
  9. 9.JT Kajiya, "Ray tracing parametric patches," Computer Graphics16, pp. 245-254 (1982). Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10.R Pavelle, M Rothstein, and J Fitch, "Computer algebra," Scientific American245, pp. 136-152 (1981).Google ScholarGoogle Scholar
  11. 11.T Pavlidis, Algorithms for graphics and image processing, Computer Science Press, Rockville, Maryland(1982). Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12.DR Stoutemyer and DYY Yun, "Symbolic mathematical computation," in Encyclopedia of Computer Science and Technology, ed. J Belzer, AG Holzman, A Kent,Marcel Dekker(1980). (Supplement)Google ScholarGoogle Scholar

Index Terms

  1. Topologically reliable display of algebraic curves

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Conferences
            SIGGRAPH '83: Proceedings of the 10th annual conference on Computer graphics and interactive techniques
            July 1983
            420 pages
            ISBN:0897911091
            DOI:10.1145/800059

            Copyright © 1983 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 July 1983

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Author Tags

            Qualifiers

            • Article

            Acceptance Rates

            Overall Acceptance Rate1,822of8,601submissions,21%

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader