# 2D Part Orienting

### Abstract

The project deals with the problem of orienting a given polygon *P* without the use of sensors. We focus on a method called oblivious push-plans, which means we push P using a straight arm from several different directions, and construct this series of directions such that *P* will always end up in the same, predetermined orientation, regardless of the orientation in which it is given to us. The project includes the implementation of several algorithms that construct valid and optimal push-plans for a given polygon *P*, as well as a simulation program, which can be used to demonstrate how the push-plan we obtain operates on different orientations of *P*.

A polygonal part and its radius function. The minima of the radius
function correspond to normals to polygon edges that intersect the center-of-mass. The maxima correspond to tangents to polygon vertices whose normals intersect the center-of-mass. |
A polygonal part and its push function. The horizontal steps of the push function are angular intervals between two successive maxima of the radius function. |

Using the overlay of the Gaussian map and the central map of P to constructthe radius function of P. In
this case, is immediately between n(e _{i})d(v _{i})and d(v
in the overlay, and thus _{i+1})n(e is a minimum point for the radius
_{i})function, and it constitutes a step of the push function. |
Deciding whether an interval I of orientations _{1}can be "collapsed" into an interval I with a _{2}single push is done by comparing the known- of angle I with the _{1}fit-angle of I. A single
_{2}push suffices if and only if the former is smaller than the latter. The figure shows the (blue) and known-angle fit-angle (orange) of the interval [d._{1}, d_{2}] |

### References

- Kenneth Goldberg

*Orienting Polygonal Parts without Sensors*

**Algorithmica**, 1993, Volume 10, Issue 2–4, pp 201–225 [link]

### Links

### Contacts

Geva Kipper |
||

Efi Fogel | ||

Dan Halperin |