Computing the Maximum Overlap of Two Convex Polygons under Translations
Theory of Computing Systems1998Vol. 31(5), pp. 613–628
Related Papers
- → Simple convex polytopes and the strong Lefschetz theorem(1991)13 cited
- → Lower bounds on the independence number of certain graphs of odd girth at least seven(2010)5 cited
- → The homotopic invariance for fixed points of set-valued mappings in Banach spaces(2013)
- General Cesaro mean approximation methods for nonexpansive mappings in Hilbert spaces(2012)
- → A Question from a Famous Paper of Erdős(2013)