This article is a continuation of our earlier work , which introduced triangular decompositions of semi-algebraic systems and algorithms for computing them. Our new contributions include theoretical results based on which we obtain practical improvements for these decomposition algorithms. We exhibit new results on the theory of border polynomials of parametric semi-algebraic systems: in particular a geometric characterization of its "true boundary" (Definition 2). In order to optimize these algorithms, we also propose a technique, that we call relaxation, which can simplify the decomposition process and reduce the number of redundant components in the output. Moreover, we present procedures for basic set-theoretical operations on semi-algebraic sets represented by triangular decomposition. Experimentation confirms the effectiveness of our techniques.
|Name||Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC|
|Publisher||Association for Computing Machinery|
|Conference||36th International Symposium on Symbolic and Algebraic Computation, ISSAC 2011, June 8, 2011 - June 11, 2011|
|Country||USA United States|
|City||San Jose, CA|
|Period||1/01/11 → …|