A Subdivision Approach to Planar Semi-algebraic Sets
Semi-algebraic sets occur naturally when dealing with implicit models and boolean operations between them. In this work we present an algorithm to efficiently and in a certified way compute the connected components of semi-algebraic sets given by intersection or union of conjunctions of bi-variate equalities and inequalities. For any given precision, this algorithm can also provide a polygonal and isotopic approximation of the exact set. The idea is to localize the boundary curves by subdividing the space and then deduce their shape within small enough cells using only boundary information. Then a systematic traversal of the boundary curve graph yields polygonal regions isotopic to the connected components of the semi-algebraic set. Space subdivision is supported by a kd-tree structure and localization is done using Bernstein representation. We conclude by demonstrating our C++ implementation in the CAS Mathemagix.
Keywordssubdivision algorithm semi-algebraic set connected component algebraic curve topology computation
Unable to display preview. Download preview PDF.
- 6.Collins, G.E.: Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 134–183. Springer, Heidelberg (1975)Google Scholar
- 8.Coste, M.: An introduction to semi-algebraic geometry. RAAG network school (2002)Google Scholar
- 10.Farin, G.: Curves and Surfaces for CAGD: A Practical Guide. Morgan Kaufmann Publishers Inc., San Francisco (2002)Google Scholar
- 13.Hironaka, H.: Triangulations of algebraic sets. In: Algebraic geometry, Proc. Sympos. Pure Math., Humboldt State Univ., Arcata, Calif., 1974, vol. 29, pp. 165–185. Amer. Math. Soc., Providence (1975)Google Scholar
- 15.Lasserre, J.B.: Moments, Positive Polynomials and their Applications. Optimization Series, vol. 1. Imperial College Press, London (2009)Google Scholar