### Abstract

Let P equals (p//1,p//2,. . . , p//n) and Q equals (q//1,q//2,. . . ,q//m) be two non-intersecting polygons in the plane specified by their cartesian coordinates in order. Given a direction d we can ask whether P can be translated an arbitrary distance in direction d without colliding with Q. An algorithm is presented for answering the above translation query in O(n plus m) time. It is also shown that all the directions of movability (translation) of P with respect to Q can be computed in O(nm) time. For the more general case of a set of M non-intersecting n-gons P equals (P//1,P//2,. . . ,P//M) we say that it exhibits the translation ordering property if for all fixed directions there exists an ordering for translating the polygons by a single common vector without any collisions occurring with those polygons not yet moved. It is shown that for a given collection P, the translation ordering property query can be answered in O(Mn plus M**2log n) time.

Original language | English (US) |
---|---|

Pages | 158-163 |

Number of pages | 6 |

State | Published - Dec 1 1983 |

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

*SOME NEW RESULTS ON MOVING POLYGONS IN THE PLANE.*. 158-163.

**SOME NEW RESULTS ON MOVING POLYGONS IN THE PLANE.** / Toussaint, Godfried; Sack, Jorg R.

Research output: Contribution to conference › Paper

}

TY - CONF

T1 - SOME NEW RESULTS ON MOVING POLYGONS IN THE PLANE.

AU - Toussaint, Godfried

AU - Sack, Jorg R.

PY - 1983/12/1

Y1 - 1983/12/1

N2 - Let P equals (p//1,p//2,. . . , p//n) and Q equals (q//1,q//2,. . . ,q//m) be two non-intersecting polygons in the plane specified by their cartesian coordinates in order. Given a direction d we can ask whether P can be translated an arbitrary distance in direction d without colliding with Q. An algorithm is presented for answering the above translation query in O(n plus m) time. It is also shown that all the directions of movability (translation) of P with respect to Q can be computed in O(nm) time. For the more general case of a set of M non-intersecting n-gons P equals (P//1,P//2,. . . ,P//M) we say that it exhibits the translation ordering property if for all fixed directions there exists an ordering for translating the polygons by a single common vector without any collisions occurring with those polygons not yet moved. It is shown that for a given collection P, the translation ordering property query can be answered in O(Mn plus M**2log n) time.

AB - Let P equals (p//1,p//2,. . . , p//n) and Q equals (q//1,q//2,. . . ,q//m) be two non-intersecting polygons in the plane specified by their cartesian coordinates in order. Given a direction d we can ask whether P can be translated an arbitrary distance in direction d without colliding with Q. An algorithm is presented for answering the above translation query in O(n plus m) time. It is also shown that all the directions of movability (translation) of P with respect to Q can be computed in O(nm) time. For the more general case of a set of M non-intersecting n-gons P equals (P//1,P//2,. . . ,P//M) we say that it exhibits the translation ordering property if for all fixed directions there exists an ordering for translating the polygons by a single common vector without any collisions occurring with those polygons not yet moved. It is shown that for a given collection P, the translation ordering property query can be answered in O(Mn plus M**2log n) time.

UR - http://www.scopus.com/inward/record.url?scp=0020861207&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0020861207&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0020861207

SP - 158

EP - 163

ER -