Computing Roadmaps of Semi-algebraic Sets on a Variety (Extended Abstract)
From MaRDI portal
Publication:4336086
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)
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
Cited in
(7)- Quantitative curve selection lemma
- On computing a set of points meeting every cell defined by a family of polynomials on a variety
- scientific article; zbMATH DE number 27176 (Why is no real title available?)
- Geodesic diameter of sets defined by few quadratic equations and inequalities
- scientific article; zbMATH DE number 17838 (Why is no real title available?)
- scientific article; zbMATH DE number 177864 (Why is no real title available?)
- 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)