Computing the Maximum Overlap of Two Convex Polygons Under Translations - researchr publication related

researchr

You are not signed in
Sign in
Sign up

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.

The following publications are possibly variants of this publication:

Computing the Maximum Overlap of Two Convex Polygons under TranslationsMark de Berg, Otfried Cheong, Olivier Devillers, Marc J. van Kreveld, Monique Teillaud. mst, 31(5):613-628, 1998. [doi]

runs on WebDSL