# Separating Two Simple Polygons by a Sequence of Translations.

R. Pollack; M. Sharir; S. Sifrony

Discrete & computational geometry (1988)

- Volume: 3, Issue: 1-2, page 123-136
- ISSN: 0179-5376; 1432-0444/e

## Access Full Article

top## How to cite

topPollack, R., Sharir, M., and Sifrony, S.. "Separating Two Simple Polygons by a Sequence of Translations.." Discrete & computational geometry 3.1-2 (1988): 123-136. <http://eudml.org/doc/131041>.

@article{Pollack1988,

author = {Pollack, R., Sharir, M., Sifrony, S.},

journal = {Discrete & computational geometry},

keywords = {inverse Ackermann function; optimal algorithm; separating polygons. translational separability of planar objects; Computational geometry},

number = {1-2},

pages = {123-136},

title = {Separating Two Simple Polygons by a Sequence of Translations.},

url = {http://eudml.org/doc/131041},

volume = {3},

year = {1988},

}

TY - JOUR

AU - Pollack, R.

AU - Sharir, M.

AU - Sifrony, S.

TI - Separating Two Simple Polygons by a Sequence of Translations.

JO - Discrete & computational geometry

PY - 1988

VL - 3

IS - 1-2

SP - 123

EP - 136

KW - inverse Ackermann function; optimal algorithm; separating polygons. translational separability of planar objects; Computational geometry

UR - http://eudml.org/doc/131041

ER -

## Citations in EuDML Documents

top## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.