Computing Roadmaps of Semi-algebraic Sets on a Variety (Extended Abstract)
DOI10.1007/978-3-642-60539-0_1zbMATH Open0894.14029OpenAlexW1878891288MaRDI QIDQ4336086FDOQ4336086
Authors: Saugata Basu, Richard Pollack, Marie-Françoise Roy 
Publication date: 12 June 1997
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-60539-0_1
Recommendations
- Computing roadmaps of semi-algebraic sets on a variety
- scientific article; zbMATH DE number 1256732
- Computing Roadmaps of General Semi-Algebraic Sets
- scientific article; zbMATH DE number 177864
- Constructing roadmaps of semi-algebraic sets. I: Completeness
- Construction of roadmaps in semi-algebraic sets
- Computing roadmaps in smooth real algebraic sets
- Computing the homology of semialgebraic sets. II: General formulas
- Recent advances in the computation of the homology of semialgebraic sets
- scientific article; zbMATH DE number 4180345
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Semialgebraic sets and related spaces (14P10) Computational aspects of higher-dimensional varieties (14Q15)
Cited In (6)
- Quantitative curve selection lemma
- Title not available (Why is that?)
- Geodesic diameter of sets defined by few quadratic equations and inequalities
- Title not available (Why is that?)
- Title not available (Why is that?)
- Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics
This page was built for publication: Computing Roadmaps of Semi-algebraic Sets on a Variety (Extended Abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4336086)
