A cluster-based cylindrical algebraic decomposition algorithm

DOI10.1016/S0747-7171(88)80012-9MaRDI QIDQ1105372zbMATH OpenFDO

Authors Dennis S. Arnon

Publication date 1988

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0747-7171(88)80012-9

zbMATH Keywords

clusters of cellscylindrical algebraic decomposition

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to field theory (12-04) Software, source code, etc. for problems pertaining to algebraic geometry (14-04) Projective techniques in algebraic geometry (14N05) Symbolic computation and algebraic computation (68W30)

Review text

Assuming the availability of a cylindrical algebraic decomposition (cad) algorithm that not only determines the cells of the cad but also identifies pairs of adjacent cells, a modified cad algorithm is presented. It uses clusters of cells (a collection of cells whose union is connected) and seems to be more efficient in some cases than the original (but also less efficient in other examples).

Recommendations

• scientific article; zbMATH DE number 3945340
• Cylindrical Algebraic Decomposition I: The Basic Algorithm
• scientific article; zbMATH DE number 3921970
• An adjacency algorithm for cylindrical algebraic decompositions of three- dimensional space
• Cylindrical algebraic decomposition using local projections

Cites work

• Cylindrical Algebraic Decomposition I: The Basic Algorithm
• Geometric reasoning with logic and algebra
• scientific article; zbMATH DE number 3920595 (Why is no real title available?)
• scientific article; zbMATH DE number 3739299 (Why is no real title available?)
• scientific article; zbMATH DE number 3771547 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3629097 (Why is no real title available?)
• On Approximations and Incidence in Cylindrical Algebraic Decompositions
• On mechanical quantifier elimination for elementary algebra and geometry
• On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds

Cited in

(15)

• An efficient algorithm for the stratification and triangulation of an algebraic surface
• On mechanical quantifier elimination for elementary algebra and geometry
• A bibliography of quantifier elimination for real closed fields
• An adjacency algorithm for cylindrical algebraic decompositions of three- dimensional space
• A polynomial-time algorithm for the topological type of real algebraic curve
• Partial cylindrical algebraic decomposition for quantifier elimination
• Quantifier elimination for trigonometric polynomials by cylindrical trigonometric decomposition
• Local box adjacency algorithms for cylindrical algebraic decompositions
• Real quantifier elimination for the synthesis of optimal numerical algorithms (case study: square root computation)
• scientific article; zbMATH DE number 3921970 (Why is no real title available?)
• scientific article; zbMATH DE number 3945340 (Why is no real title available?)
• Cylindrical Algebraic Decomposition I: The Basic Algorithm
• Two-view ``cylindrical decomposition of binary images
• Truth table invariant cylindrical algebraic decomposition
• Testing elementary function identities using CAD

This page was built for publication: A cluster-based cylindrical algebraic decomposition algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1105372)