Constrained square-center problems

Matthew J. Katz; Klara Kedem; Michael Segal

doi:10.1007/BFb0054358

Constrained square-center problems

Matthew J. Katz, Klara Kedem, Michael Segal

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Scopus citations

Abstract

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 language	English
Title of host publication	Algorithm Theory — SWAT 1998 - 6th Scandinavian Workshop on Algorithm Theory, Proceedings
Editors	Stefan Arnborg, Lars Ivansson
Publisher	Springer Verlag
Pages	95-106
Number of pages	12
ISBN (Print)	3540646825, 9783540646822
DOIs	https://doi.org/10.1007/BFb0054358
State	Published - 1 Jan 1998
Event	6th Scandinavian Workshop on Algorithm Theory, SWAT 1998 - Stockholm, Sweden Duration: 8 Jul 1998 → 10 Jul 1998

Publication series

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

Conference

Conference	6th Scandinavian Workshop on Algorithm Theory, SWAT 1998
Country/Territory	Sweden
City	Stockholm
Period	8/07/98 → 10/07/98

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science (all)

Access to Document

10.1007/BFb0054358

Cite this

Katz, M. J., Kedem, K., & Segal, M. (1998). Constrained square-center problems. In S. Arnborg, & L. Ivansson (Eds.), Algorithm Theory — SWAT 1998 - 6th Scandinavian Workshop on Algorithm Theory, Proceedings (pp. 95-106). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1432). Springer Verlag. https://doi.org/10.1007/BFb0054358

Katz, Matthew J. ; Kedem, Klara ; Segal, Michael. / Constrained square-center problems. Algorithm Theory — SWAT 1998 - 6th Scandinavian Workshop on Algorithm Theory, Proceedings. editor / Stefan Arnborg ; Lars Ivansson. Springer Verlag, 1998. pp. 95-106 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{b79db75105a6416ea8e87112d5445846,

title = "Constrained square-center problems",

abstract = "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.",

author = "Katz, {Matthew J.} and Klara Kedem and Michael Segal",

year = "1998",

month = jan,

day = "1",

doi = "10.1007/BFb0054358",

language = "English",

isbn = "3540646825",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "95--106",

editor = "Stefan Arnborg and Lars Ivansson",

booktitle = "Algorithm Theory — SWAT 1998 - 6th Scandinavian Workshop on Algorithm Theory, Proceedings",

address = "Germany",

}

Katz, MJ , Kedem, K & Segal, M 1998, Constrained square-center problems. in S Arnborg & L Ivansson (eds), Algorithm Theory — SWAT 1998 - 6th Scandinavian Workshop on Algorithm Theory, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1432, Springer Verlag, pp. 95-106, 6th Scandinavian Workshop on Algorithm Theory, SWAT 1998, Stockholm, Sweden, 8/07/98. https://doi.org/10.1007/BFb0054358

Constrained square-center problems. / Katz, Matthew J.; Kedem, Klara ; Segal, Michael.
Algorithm Theory — SWAT 1998 - 6th Scandinavian Workshop on Algorithm Theory, Proceedings. ed. / Stefan Arnborg; Lars Ivansson. Springer Verlag, 1998. p. 95-106 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1432).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Constrained square-center problems

AU - Katz, Matthew J.

AU - Kedem, Klara

AU - Segal, Michael

PY - 1998/1/1

Y1 - 1998/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84957659029&partnerID=8YFLogxK

U2 - 10.1007/BFb0054358

DO - 10.1007/BFb0054358

M3 - Conference contribution

AN - SCOPUS:84957659029

SN - 3540646825

SN - 9783540646822

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 95

EP - 106

BT - Algorithm Theory — SWAT 1998 - 6th Scandinavian Workshop on Algorithm Theory, Proceedings

A2 - Arnborg, Stefan

A2 - Ivansson, Lars

PB - Springer Verlag

T2 - 6th Scandinavian Workshop on Algorithm Theory, SWAT 1998

Y2 - 8 July 1998 through 10 July 1998

ER -

Katz MJ , Kedem K , Segal M. Constrained square-center problems. In Arnborg S, Ivansson L, editors, Algorithm Theory — SWAT 1998 - 6th Scandinavian Workshop on Algorithm Theory, Proceedings. Springer Verlag. 1998. p. 95-106. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/BFb0054358

Constrained square-center problems

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this