A cluster-based cylindrical algebraic decomposition algorithm (Q1105372)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A cluster-based cylindrical algebraic decomposition algorithm |
scientific article; zbMATH DE number 4058864
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A cluster-based cylindrical algebraic decomposition algorithm |
scientific article; zbMATH DE number 4058864 |
Statements
A cluster-based cylindrical algebraic decomposition algorithm (English)
0 references
1988
0 references
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).
0 references
cylindrical algebraic decomposition
0 references
clusters of cells
0 references
0.839613676071167
0 references
0.8026857376098633
0 references
0.8010872602462769
0 references
