skip to main content
10.1145/1837934.1837952acmotherconferencesArticle/Chapter ViewAbstractPublication PagesissacConference Proceedingsconference-collections
research-article

Computation with semialgebraic sets represented by cylindrical algebraic formulas

Published:25 July 2010Publication History

ABSTRACT

Cylindrical algebraic formulas are an explicit representation of semialgebraic sets as finite unions of cylindrically arranged disjoint cells bounded by graphs of algebraic functions. We present a version of the Cylindrical Algebraic Decomposition (CAD) algorithm customized for efficient computation of arbitrary combinations of unions, intersections and complements of semialgebraic sets given in this representation. The algorithm can also be used to eliminate quantifiers from Boolean combinations of cylindrical algebraic formulas. We show application examples and an empirical comparison with direct CAD computation for unions and intersections of semialgebraic sets.

References

  1. C. W. Brown. An overview of qepcad b: a tool for real quantifier elimination and formula simplification. J. JSSAC, 10:13--22, 2003.Google ScholarGoogle Scholar
  2. C. W. Brown. Qepcad b - a program for computing with semi-algebraic sets using cads. ACM SIGSAM Bulletin, 37:97--108, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. B. Caviness and J. Johnson, editors. Quantifier Elimination and Cylindrical Algebraic Decomposition, New York, 1998. Springer Verlag.Google ScholarGoogle ScholarCross RefCross Ref
  4. C. Chen, M. M. Maza, B. Xia, and L. Yang. Computing cylindrical algebraic decomposition via triangular decomposition. In Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC 2009, pages 95--102. ACM, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. G. E. Collins. Quantifier elimination for the elementary theory of real closed fields by cylindrical algebraic decomposition. Lect. Notes Comput. Sci., 33:134--183, 1975.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. G. E. Collins. Application of quantifier elimination to solotareff's approximation problem. RISC Report Series 95--31, University of Linz, Austria, 1995.Google ScholarGoogle Scholar
  7. G. E. Collins and H. Hong. Partial cylindrical algebraic decomposition for quantifier elimination. J. Symbolic Comp., 12:299--328, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. H. Hong. An improvement of the projection operator in cylindrical algebraic decomposition. In Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC 1990, pages 261--264. ACM, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. D. Lazard. Solving kaltofen's challenge on zolotarev's approximation problem. In Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC 2006, pages 196--203. ACM, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. S. McCallum. An improved projection for cylindrical algebraic decomposition of three dimensional space. J. Symbolic Comp., 5:141--161, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. S. McCallum. An improved projection for cylindrical algebraic decomposition. In B. Caviness and J. Johnson, editors, Quantifier Elimination and Cylindrical Algebraic Decomposition, pages 242--268. Springer Verlag, 1998.Google ScholarGoogle ScholarCross RefCross Ref
  12. S. L. ojasiewicz. Ensembles semi-analytiques. I. H.E.S., 1964.Google ScholarGoogle Scholar
  13. A. Strzeboński. Computing in the field of complex algebraic numbers. J. Symbolic Comp., 24:647--656, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. A. Strzeboński. Solving systems of strict polynomial inequalities. J. Symbolic Comp., 29:471--480, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. A. Strzeboński. Cylindrical algebraic decomposition using validated numerics. J. Symbolic Comp., 41:1021--1038, 2006.Google ScholarGoogle ScholarCross RefCross Ref
  16. A. Tarski. A decision method for elementary algebra and geometry. University of California Press, 1951.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Computation with semialgebraic sets represented by cylindrical algebraic formulas

      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 Other conferences
        ISSAC '10: Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
        July 2010
        366 pages
        ISBN:9781450301503
        DOI:10.1145/1837934

        Copyright © 2010 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: 25 July 2010

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        ISSAC '10 Paper Acceptance Rate45of110submissions,41%Overall Acceptance Rate395of838submissions,47%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader