On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
From MaRDI portal
On the ''Piano Movers'' problem. II: General techniques for computing topological properties of real algebraic manifolds
Recommendations
- On the exact computation of the topology of real algebraic curves
- On the complexity of computing the topology of real algebraic space curves
- scientific article; zbMATH DE number 34393
- scientific article; zbMATH DE number 2016154
- Computation of the topology of real algebraic space curves
- Topological complexity and motion planning in certain real Grassmannians.
- Topological manifolds and real algebraic geometry
- scientific article; zbMATH DE number 2151222
- On the topology of real algebraic plane curves
- Computing the topology of an arrangement of implicitly defined real algebraic plane curves
Cites work
- scientific article; zbMATH DE number 3142931 (Why is no real title available?)
- scientific article; zbMATH DE number 3711281 (Why is no real title available?)
- scientific article; zbMATH DE number 3711282 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3518931 (Why is no real title available?)
- scientific article; zbMATH DE number 3276402 (Why is no real title available?)
- scientific article; zbMATH DE number 3034436 (Why is no real title available?)
- scientific article; zbMATH DE number 3057883 (Why is no real title available?)
- scientific article; zbMATH DE number 3068536 (Why is no real title available?)
- Algèbre linéaire sur $K[X_1,\dots,X_n]$ et élimination
- All Algebraic Functions Can Be Computed Fast
- An inequality for the discriminant of a polynomial
- Automatic analysis of real algebraic curves
- Counting types of rigid frameworks
- Decision procedures for real and p‐adic fields
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Fast computation of GCDs
- Integer Arithmetic Algorithms for Polynomial Real Zero Determination
- On Euclid's Algorithm and the Theory of Subresultants
- On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
- The fastest exact algorithms for the isolation of the real roots of a polynomial equation
Cited in
(only showing first 100 items - show all)- OPTIMAL VORONOI DIAGRAM CONSTRUCTION WITH n CONVEX SITES IN THREE DIMENSIONS
- On the parameterized complexity of motion planning for rectangular robots
- Motion planning among time dependent obstacles
- Persistent Homology of Semialgebraic Sets
- New algorithms for multilink robot arms
- Randomized query processing in robot path planning
- The jogger's problem: Control of dynamics in real-time motion planning
- Complexity of control-affine motion planning
- scientific article; zbMATH DE number 3951430 (Why is no real title available?)
- Vandermonde varieties, mirrored spaces, and the cohomology of symmetric semi-algebraic sets
- Constructing roadmaps of semi-algebraic sets. I: Completeness
- The complexity of elementary algebra and geometry
- Description of the connected components of a semialgebraic set in single exponential time
- Rapidly-exploring Sorted Random Tree: A Self Adaptive Random Motion Planning Algorithm
- On polynomial vector fields having a given affine variety as attractive and invariant set: application to robotics
- CW Complexes for Complex Algebraic Surfaces
- Construction of C-space roadmaps from local sensory data. What should the sensors look for?
- A cluster-based cylindrical algebraic decomposition algorithm
- Validity proof of Lazard's method for CAD construction
- Algorithmic and complexity issues of robot motion in an uncertain environment
- Rods and Rings: Soft Subdivision Planner for R^3 x S^2.
- An algebraic algorithm to compute the exact general sweep boundary of a 2D curved object
- scientific article; zbMATH DE number 822177 (Why is no real title available?)
- Computing roadmaps of semi-algebraic sets on a variety
- An algorithm for generalized point location and its applications
- On the piano movers' problem: V. The case of a rod moving in three-dimensional space amidst polyhedral obstacles
- Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems
- Convex hulls of objects bounded by algebraic curves
- Generalized Voronoi diagrams for a ladder. II: Efficient construction of the diagram
- A survey of motion planning and related geometric algorithms
- Efficient algorithms for computing the Euler-Poincaré characteristic of symmetric semi-algebraic sets
- Some aspects of complexity in real algebraic geometry
- Robots, computer algebra and eight connected components
- Motion planning in the presence of movable obstacles
- On-line motion planning: Case of a planar rod
- Robot motion planning with uncertainty in control and sensing
- Throwing a sofa through the window
- A bibliography of quantifier elimination for real closed fields
- Computer algebra applied to itself
- Voronoi diagrams with barriers and on polyhedra for minimal path planning
- Coordinated motion planning for two independent robots
- Extremal polygon containment problems
- On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
- Automated Deduction in Geometry
- Cylindrical algebraic decomposition with equational constraints
- An adjacency algorithm for cylindrical algebraic decompositions of three- dimensional space
- Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
- Problem formulation for truth-table invariant cylindrical algebraic decomposition by incremental triangular decomposition
- A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space
- A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface
- Inner and outer approximate quantifier elimination for general reachability problems
- Scalable distributed algorithms for multi-robot near-optimal motion planning
- Complete geometric query languages
- Dynamic motion planning in low obstacle density environments
- The Construction of Analytic Diffeomorphisms for Exact Robot Navigation on Star Worlds
- Combinatorial complexity bounds for arrangements of curves and spheres
- A singly exponential stratification scheme for real semi-algebraic varieties and its applications
- A :20piano movers' '
- Robot navigation functions on manifolds with boundary
- A simple path non-existence algorithm using \(C\)-obstacle query
- Algebraic decomposition of regular curves
- scientific article; zbMATH DE number 1403894 (Why is no real title available?)
- On ray shooting for triangles in 3-space and related problems
- scientific article; zbMATH DE number 16983 (Why is no real title available?)
- Entropy and complexity of a path in sub-Riemannian geometry
- Computing roadmaps in unbounded smooth real algebraic sets. I: Connectivity results
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
- Intersection searching amid tetrahedra in four dimensions
- A computational method for determining strong stabilizability of \(n\)-D systems
- On ray shooting for triangles in 3-space and related problems
- Local box adjacency algorithms for cylindrical algebraic decompositions
- On soft predicates in subdivision motion planning
- On minimal and minimum cylindrical algebraic decompositions
- Connectivity in symmetric semi-algebraic sets
- Geometry and search in motion planning.
- Reconfiguring closed polygonal chains in Euclidean \(d\)-space
- Planning constrained motion
- A real-time dual-arm collision avoidance algorithm for assembly
- On boundaries of highly visible spaces and applications
- Divide and conquer roadmap for algebraic sets
- On the general motion-planning problem with two degrees of freedom
- scientific article; zbMATH DE number 34393 (Why is no real title available?)
- A baby step-giant step roadmap algorithm for general algebraic sets
- On the reconfiguration of chains
- A biologically inspired neural net for trajectory formation and obstacle avoidance
- Partitioning and separating sets of orthogonal polygons
- Efficient computation of a semi-algebraic basis of the first homology group of a semi-algebraic set
- Simplified Voronoi diagrams
- On the equivariant Betti numbers of symmetric definable sets: vanishing, bounds and algorithms
- A geometric approach to error detection recovery for robot motion planning with uncertainty
- Decomposing the complement of the union of cubes and boxes in three dimensions
- Oracle complexities for computional geometry of semi-algebraic sets and voronoi diagrams
- Computing the Betti numbers of arrangements via spectral sequences
- Towards exact geometric computation
- Semilinear motion planning in REDLOG
- A tight lower bound for the complexity of path-planning for a disc
- Geometric reasoning with logic and algebra
- Cylindrical algebraic sub-decompositions
- CAD and topology of semi-algebraic sets
- Ray shooting on triangles in 3-space
This page was built for publication: On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q760006)