Pages that link to "Item:Q760006"

The following pages link to On the ''Piano Movers'' problem. II: General techniques for computing topological properties of real algebraic manifolds (Q760006):

Displaying 50 items.

• Divide and conquer roadmap for algebraic sets (Q464736) (← links)
• Cylindrical algebraic sub-decompositions (Q475412) (← links)
• A baby step-giant step roadmap algorithm for general algebraic sets (Q486687) (← links)
• Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets (Q581617) (← links)
• Some aspects of complexity in real algebraic geometry (Q582342) (← links)
• CAD and topology of semi-algebraic sets (Q626978) (← links)
• A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface (Q629823) (← links)
• Construction of C-space roadmaps from local sensory data. What should the sensors look for? (Q676266) (← links)
• Towards exact geometric computation (Q676577) (← links)
• An algebraic algorithm to compute the exact general sweep boundary of a 2D curved object (Q688223) (← links)
• Oracle complexities for computional geometry of semi-algebraic sets and voronoi diagrams (Q753493) (← links)
• Convex hulls of objects bounded by algebraic curves (Q802894) (← links)
• Robot navigation functions on manifolds with boundary (Q803601) (← links)
• Triangulating a nonconvex polytope (Q914375) (← links)
• Combinatorial complexity bounds for arrangements of curves and spheres (Q917017) (← links)
• Geometric reasoning with logic and algebra (Q918227) (← links)
• New algorithms for multilink robot arms (Q1079385) (← links)
• Dynamic path planning for a planar articulated robot arm moving amidst unknown obstacles (Q1094158) (← links)
• Generalized Voronoi diagrams for a ladder. II: Efficient construction of the diagram (Q1094871) (← links)
• Motion planning among time dependent obstacles (Q1096427) (← links)
• The complexity of elementary algebra and geometry (Q1096620) (← links)
• Partitioning and separating sets of orthogonal polygons (Q1097030) (← links)
• A search algorithm for motion planning with six degrees of freedom (Q1097053) (← links)
• Simplified Voronoi diagrams (Q1101687) (← links)
• A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space (Q1102109) (← links)
• Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape (Q1102132) (← links)
• A bibliography of quantifier elimination for real closed fields (Q1103610) (← links)
• An adjacency algorithm for cylindrical algebraic decompositions of three- dimensional space (Q1105371) (← links)
• A cluster-based cylindrical algebraic decomposition algorithm (Q1105372) (← links)
• Computer algebra applied to itself (Q1106662) (← links)
• Algorithmic and complexity issues of robot motion in an uncertain environment (Q1109740) (← links)
• A tight lower bound for the complexity of path-planning for a disc (Q1111039) (← links)
• A geometric approach to error detection recovery for robot motion planning with uncertainty (Q1116358) (← links)
• Algebraic decomposition of regular curves (Q1116997) (← links)
• Constructing roadmaps of semi-algebraic sets. I: Completeness (Q1117992) (← links)
• A survey of motion planning and related geometric algorithms (Q1123032) (← links)
• A singly exponential stratification scheme for real semi-algebraic varieties and its applications (Q1177933) (← links)
• Robot motion planning with uncertainty in control and sensing (Q1190788) (← links)
• On the general motion-planning problem with two degrees of freedom (Q1262130) (← links)
• Randomized query processing in robot path planning (Q1273861) (← links)
• Dynamic motion planning in low obstacle density environments (Q1276943) (← links)
• A computational method for determining strong stabilizability of \(n\)-D systems (Q1300577) (← links)
• Complete geometric query languages (Q1307692) (← links)
• Description of the connected components of a semialgebraic set in single exponential time (Q1317872) (← links)
• Extremal polygon containment problems (Q1330463) (← links)
• Castles in the air revisited (Q1334929) (← links)
• Reconfiguring closed polygonal chains in Euclidean \(d\)-space (Q1346132) (← links)
• Geometry and search in motion planning. (Q1353911) (← links)
• On-line motion planning: Case of a planar rod (Q1356165) (← links)
• Planning constrained motion (Q1356166) (← links)