作者: Matthew J. Katz , Klara Kedem , Michael Segal
DOI: 10.1007/BFB0054358
关键词:
摘要: Given a set P of n points in the plane, we seek two squares whose center belong to P, their union contains and area larger square is minimal. We present efficient algorithms for three variants this problem: In first axe axis parallel, second they are free rotate but must remain parallel each other, third independently.