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

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.

This author has not been identified. Look up 'Mark de Berg' in GoogleThis author has not been identified. Look up 'Olivier Devillers' in GoogleThis author has not been identified. Look up 'Marc J. van Kreveld' in GoogleThis author has not been identified. Look up 'Otfried Schwarzkopf' in GoogleThis author has not been identified. Look up 'Monique Teillaud' in Google

runs on WebDSL