On Approximations and Incidence in Cylindrical Algebraic Decompositions

DOI10.1137/0215069zbMath0643.14002OpenAlexW2037018716MaRDI QIDQ3784167

David Prill

Publication date: 1986

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0215069

zbMATH Keywords

collision-free pathsroboticspolynomial timecylindrical algebraic decompositionsapproximations of roots of polynomialsincidence of cellssemi-algebraic cells

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Software, source code, etc. for problems pertaining to algebraic geometry (14-04) Real algebraic and real-analytic geometry (14Pxx)

Related Items

A bibliography of quantifier elimination for real closed fields ⋮ An adjacency algorithm for cylindrical algebraic decompositions of three- dimensional space ⋮ A cluster-based cylindrical algebraic decomposition algorithm ⋮ The topological configuration of a real algebraic curve ⋮ Triangulating a nonconvex polytope ⋮ A singly exponential stratification scheme for real semi-algebraic varieties and its applications ⋮ An exact and efficient approach for computing a cell in an arrangement of quadrics

This page was built for publication: On Approximations and Incidence in Cylindrical Algebraic Decompositions