Computing Roadmaps of General Semi-Algebraic Sets

DOI10.1093/COMJNL/36.5.504zbMath0798.14031OpenAlexW2086785654MaRDI QIDQ3140561

John F. Canny

Publication date: 9 November 1994

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/36.5.504

zbMATH Keywords

complexityroadmap algorithmcomponent of a semi-algebraic set

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Semialgebraic sets and related spaces (14P10)

Related Items (19)

Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics ⋮ Algorithm for Connectivity Queries on Real Algebraic Curves ⋮ Persistent Homology of Semialgebraic Sets ⋮ Efficient simplicial replacement of semialgebraic sets ⋮ Variant quantifier elimination ⋮ Computing roadmaps in unbounded smooth real algebraic sets. I: Connectivity results ⋮ A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface ⋮ Numerically computing real points on algebraic sets ⋮ Polynomial hierarchy, Betti numbers, and a real analogue of Toda's theorem ⋮ Computing the first few Betti numbers of semi-algebraic sets in single exponential time ⋮ On the number of cells defined by a family of polynomials on a variety ⋮ Computing the top Betti numbers of semialgebraic sets defined by quadratic inequalities in polynomial time ⋮ Computing the first Betti number of a semi-algebraic set ⋮ Computing the homology of semialgebraic sets. I: Lax formulas ⋮ Computing roadmaps of semi-algebraic sets on a variety ⋮ Computing the Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials ⋮ Rods and Rings: Soft Subdivision Planner for R^3 x S^2. ⋮ On soft predicates in subdivision motion planning ⋮ Bounding the length of gradient trajectories

This page was built for publication: Computing Roadmaps of General Semi-Algebraic Sets