Answers are grounded in this paper and cite their sources.
Given a set of r-variate integral polynomials, a cylindrical algebraic decomposition (cad) of euclidean r-space Eʳ partitions Eʳ into connected subsets compatible with the zeros of the polynomials. Each subset is a cell Collins gave a cad construction algorithm in 1975, as part of a quantifier elimination procedure for real closed fields. The cad algorithm has found diverse applications (optimization, curve display); new applications have been proposed (term rewriting systems, motion planning). In the present two-part paper, we give an algorithm which determines the pairs of adjacent cells as it constructs a cad of E². Such information is often useful in applications. In Part I we describe the essential features of the r-space cad algorithm, to provide a framework for the adjacency algorithm in Part II.
No takes yet. Share an insight, caveat, or question.
Arnon et al. (1984) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: