An adjacency algorithm for cylindrical algebraic decompositions of three- dimensional space (Q1105371): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Cylindrical Algebraic Decomposition I: The Basic Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cluster-based cylindrical algebraic decomposition algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Calculation of Multivariate Polynomial Resultants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3316585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3668871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4157293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved projection operation for cylindrical algebraic decomposition of three-dimensional space / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Approximations and Incidence in Cylindrical Algebraic Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ''Piano Movers'' problem. II: General techniques for computing topological properties of real algebraic manifolds / rank
 
Normal rank

Latest revision as of 18:01, 18 June 2024

scientific article
Language Label Description Also known as
English
An adjacency algorithm for cylindrical algebraic decompositions of three- dimensional space
scientific article

    Statements

    An adjacency algorithm for cylindrical algebraic decompositions of three- dimensional space (English)
    0 references
    0 references
    0 references
    0 references
    1988
    0 references
    The authors present an algorithm that determines the pairs of adjacent cells as it constructs a cylindrical algebraic decomposition of three- dimensional Euclidean space. The algorithm is an extension of the authors' algorithm for the two-dimensional case and does not require coordinate changes.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    cylindrical algebraic decomposition
    0 references
    three-dimensional Euclidean space
    0 references