Mark de Berg, Olivier Devillers, Marc J. van Kreveld, Otfried Schwarzkopf, Monique Teillaud. Computing the Maximum Overlap of Two Convex Polygons Under Translations. In Tetsuo Asano, Yoshihide Igarashi, Hiroshi Nagamochi, Satoru Miyano, Subhash Suri, editors, Algorithms and Computation, 7th International Symposium, ISAAC 96, Osaka, Japan, December 16-18, 1996, Proceedings. Volume 1178 of Lecture Notes in Computer Science, pages 126-135, Springer, 1996.
@inproceedings{BergDKST96,
title = {Computing the Maximum Overlap of Two Convex Polygons Under Translations},
author = {Mark de Berg and Olivier Devillers and Marc J. van Kreveld and Otfried Schwarzkopf and Monique Teillaud},
year = {1996},
tags = {translation},
researchr = {https://researchr.org/publication/BergDKST96},
cites = {0},
citedby = {0},
pages = {126-135},
booktitle = {Algorithms and Computation, 7th International Symposium, ISAAC 96, Osaka, Japan, December 16-18, 1996, Proceedings},
editor = {Tetsuo Asano and Yoshihide Igarashi and Hiroshi Nagamochi and Satoru Miyano and Subhash Suri},
volume = {1178},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-62048-6},
}