Divide-And-Conquer Computation of Cylindrical Algebraic Decomposition

Adam Strzebonski

Divide-And-Conquer Computation of Cylindrical Algebraic Decomposition

Symbolic Computation 2014-02-05 v1 Mathematical Software

Authors: Adam Strzebonski

Abstract

We present a divide-and-conquer version of the Cylindrical Algebraic Decomposition (CAD) algorithm. The algorithm represents the input as a Boolean combination of subformulas, computes cylindrical algebraic decompositions of solution sets of the subformulas, and combines the results. We propose a graph-based heuristic to find a suitable partitioning of the input and present empirical comparison with direct CAD computation.

Keywords

computer algebra geometric modeling computational geometry

Cite

@article{arxiv.1402.0622,
  title  = {Divide-And-Conquer Computation of Cylindrical Algebraic Decomposition},
  author = {Adam Strzebonski},
  journal= {arXiv preprint arXiv:1402.0622},
  year   = {2014}
}

Related papers

View all related →