Constrained square-center problems

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations


Given a set P of n points in the plane, we seek two squares whose center points belong to P, their union contains P, and the area of the larger square is minimal. We present efficient algorithms for three variants of this problem: In the first the squares are axis parallel, in the second they are free to rotate but must remain parallel to each other, and in the third they are free to rotate independently.

Original languageEnglish
Title of host publicationAlgorithm Theory — SWAT 1998 - 6th Scandinavian Workshop on Algorithm Theory, Proceedings
EditorsStefan Arnborg, Lars Ivansson
PublisherSpringer Verlag
Number of pages12
ISBN (Print)3540646825, 9783540646822
StatePublished - 1 Jan 1998
Event6th Scandinavian Workshop on Algorithm Theory, SWAT 1998 - Stockholm, Sweden
Duration: 8 Jul 199810 Jul 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference6th Scandinavian Workshop on Algorithm Theory, SWAT 1998

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)


Dive into the research topics of 'Constrained square-center problems'. Together they form a unique fingerprint.

Cite this