The following pages link to (Q3479508):
Displaying 16 items.
- A note on the combinatorial structure of the visibility graph in simple polygons (Q673765) (← links)
- A competitive analysis of algorithms for searching unknown scenes (Q685600) (← links)
- Computational geometry in a curved world (Q911324) (← links)
- An algorithmic approach to some problems in terrain navigation (Q1116366) (← links)
- Simultaneous inner and outer approximation of shapes (Q1201744) (← links)
- An approximate algorithm for computing multidimensional convex hulls (Q1294388) (← links)
- The complexity of the free space for a robot moving amidst fat obstacles (Q1314536) (← links)
- Combinatorial complexity of translating a box in polyhedral 3-space (Q1384201) (← links)
- Finding a largest rectangle inside a digital object and rectangularization (Q1747507) (← links)
- Characterizing the shortest path of an object among obstacles (Q1823707) (← links)
- On soft predicates in subdivision motion planning (Q2354924) (← links)
- The topology of boundaries (Q2676561) (← links)
- Soft Subdivision Search in Motion Planning, II: Axiomatics (Q3452548) (← links)
- Mapping in unknown graph-like worlds (Q4346513) (← links)
- The visibility diagram: A data structure for visibility problems and motion planning (Q5056095) (← links)
- Rods and Rings: Soft Subdivision Planner for R^3 x S^2. (Q5088973) (← links)
