Computing the maximum overlap of two convex polygons under translations

M. Berg, de; O. Devillers; M.J. Kreveld, van; O. Schwarzkopf; M. Teillaud

doi:10.1007/BFb0009488

Computing the maximum overlap of two convex polygons under translations

M. Berg, de, O. Devillers, M.J. Kreveld, van, O. Schwarzkopf, M. Teillaud

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Original language	English
Title of host publication	Algorithms and Computation (Proceedings 7th International Symposium, ISAAC'96, Osaka, Japan, December 16-18, 1996)
Editors	T. Asano, Y. Igarashi, H. Nagamochi, S. Miyano, S. Suri
Place of Publication	Berlin
Publisher	Springer
Pages	126-135
ISBN (Print)	3-540-62048-6
DOIs	https://doi.org/10.1007/BFb0009488
Publication status	Published - 1996

Publication series

Name	Lecture Notes in Computer Science
Volume	1178
ISSN (Print)	0302-9743

Access to Document

10.1007/BFb0009488

Cite this

Berg, de, M., Devillers, O., Kreveld, van, M. J., Schwarzkopf, O., & Teillaud, M. (1996). Computing the maximum overlap of two convex polygons under translations. In T. Asano, Y. Igarashi, H. Nagamochi, S. Miyano, & S. Suri (Eds.), Algorithms and Computation (Proceedings 7th International Symposium, ISAAC'96, Osaka, Japan, December 16-18, 1996) (pp. 126-135). (Lecture Notes in Computer Science; Vol. 1178). Springer. https://doi.org/10.1007/BFb0009488

Berg, de, M. ; Devillers, O. ; Kreveld, van, M.J. et al. / Computing the maximum overlap of two convex polygons under translations. Algorithms and Computation (Proceedings 7th International Symposium, ISAAC'96, Osaka, Japan, December 16-18, 1996). editor / T. Asano ; Y. Igarashi ; H. Nagamochi ; S. Miyano ; S. Suri. Berlin : Springer, 1996. pp. 126-135 (Lecture Notes in Computer Science).

@inproceedings{e1c61e53078844c78d1f152a89154dab,

title = "Computing the maximum overlap of two convex polygons under translations",

author = "{Berg, de}, M. and O. Devillers and {Kreveld, van}, M.J. and O. Schwarzkopf and M. Teillaud",

year = "1996",

doi = "10.1007/BFb0009488",

language = "English",

isbn = "3-540-62048-6",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "126--135",

editor = "T. Asano and Y. Igarashi and H. Nagamochi and S. Miyano and S. Suri",

booktitle = "Algorithms and Computation (Proceedings 7th International Symposium, ISAAC'96, Osaka, Japan, December 16-18, 1996)",

address = "Germany",

}

Berg, de, M, Devillers, O, Kreveld, van, MJ, Schwarzkopf, O & Teillaud, M 1996, Computing the maximum overlap of two convex polygons under translations. in T Asano, Y Igarashi, H Nagamochi, S Miyano & S Suri (eds), Algorithms and Computation (Proceedings 7th International Symposium, ISAAC'96, Osaka, Japan, December 16-18, 1996). Lecture Notes in Computer Science, vol. 1178, Springer, Berlin, pp. 126-135. https://doi.org/10.1007/BFb0009488

Computing the maximum overlap of two convex polygons under translations. / Berg, de, M.; Devillers, O.; Kreveld, van, M.J. et al.
Algorithms and Computation (Proceedings 7th International Symposium, ISAAC'96, Osaka, Japan, December 16-18, 1996). ed. / T. Asano; Y. Igarashi; H. Nagamochi; S. Miyano; S. Suri. Berlin: Springer, 1996. p. 126-135 (Lecture Notes in Computer Science; Vol. 1178).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Computing the maximum overlap of two convex polygons under translations

AU - Berg, de, M.

AU - Devillers, O.

AU - Kreveld, van, M.J.

AU - Schwarzkopf, O.

AU - Teillaud, M.

PY - 1996

Y1 - 1996

U2 - 10.1007/BFb0009488

DO - 10.1007/BFb0009488

M3 - Conference contribution

SN - 3-540-62048-6

T3 - Lecture Notes in Computer Science

SP - 126

EP - 135

BT - Algorithms and Computation (Proceedings 7th International Symposium, ISAAC'96, Osaka, Japan, December 16-18, 1996)

A2 - Asano, T.

A2 - Igarashi, Y.

A2 - Nagamochi, H.

A2 - Miyano, S.

A2 - Suri, S.

PB - Springer

CY - Berlin

ER -

Berg, de M, Devillers O, Kreveld, van MJ, Schwarzkopf O, Teillaud M. Computing the maximum overlap of two convex polygons under translations. In Asano T, Igarashi Y, Nagamochi H, Miyano S, Suri S, editors, Algorithms and Computation (Proceedings 7th International Symposium, ISAAC'96, Osaka, Japan, December 16-18, 1996). Berlin: Springer. 1996. p. 126-135. (Lecture Notes in Computer Science). doi: 10.1007/BFb0009488