The following pages link to (Q3795219):
Displayed 12 items.
- Combinatorial complexity bounds for arrangements of curves and spheres (Q917017) (← links)
- Single facility collection depots location problem in the plane (Q1025297) (← links)
- On \(k\)-sets in arrangements of curves and surfaces (Q1179129) (← links)
- Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom (Q1194309) (← links)
- On the zone of a surface in a hyperplane arrangement (Q1209841) (← links)
- On the general motion-planning problem with two degrees of freedom (Q1262130) (← links)
- Implicitly representing arrangements of lines or segments (Q1263966) (← links)
- On the complexity of a single cell in certain arrangements of surfaces related to motion planning (Q1314439) (← links)
- Finding constrained and weighted Voronoi diagrams in the plane (Q1388136) (← links)
- A note on the Papadimitriou-Silverberg algorithm for planning optimal piecewise-linear motion of a ladder (Q1822971) (← links)
- Triangles in space or building (and analyzing) castles in the air (Q2638823) (← links)
- Graphics in flatland revisited (Q5056094) (← links)