Finding optimal bipartitions of points and polygons

Joseph S.B. Mitchell; Erik L. Wynters

doi:10.1007/BFb0028263

Finding optimal bipartitions of points and polygons

Joseph S.B. Mitchell
, Erik L. Wynters

Applied Mathematics and Statistics

Cornell University

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

9 Scopus citations

Abstract

We give efficient algorithms to compute an optimal bipartition of a set of points or a set of simple polygons in the plane. We examine various criteria involving the perimeter and the area of the convex hulls of the two subsets.

Original language	English
Title of host publication	Algorithms and Data Structures - 2nd Workshop, WADS 1991, Proceedings
Editors	Frank Dehne, Jorg-Rudiger Sack, Nicola Santoro
Publisher	Springer Verlag
Pages	202-213
Number of pages	12
ISBN (Print)	9783540475668
DOIs	https://doi.org/10.1007/BFb0028263
State	Published - 1991
Event	2nd Workshop on Algorithms and Data Structures, WADS 1991 - Ottawa, Canada Duration: Aug 14 1991 → Aug 16 1991

Publication series

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

Conference

Conference	2nd Workshop on Algorithms and Data Structures, WADS 1991
Country/Territory	Canada
City	Ottawa
Period	08/14/91 → 08/16/91

Access to Document

10.1007/BFb0028263

Cite this

Mitchell, J. S. B., & Wynters, E. L. (1991). Finding optimal bipartitions of points and polygons. In F. Dehne, J.-R. Sack, & N. Santoro (Eds.), Algorithms and Data Structures - 2nd Workshop, WADS 1991, Proceedings (pp. 202-213). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 519 LNCS). Springer Verlag. https://doi.org/10.1007/BFb0028263

Mitchell, Joseph S.B. ; Wynters, Erik L. / Finding optimal bipartitions of points and polygons. Algorithms and Data Structures - 2nd Workshop, WADS 1991, Proceedings. editor / Frank Dehne ; Jorg-Rudiger Sack ; Nicola Santoro. Springer Verlag, 1991. pp. 202-213 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{b612a9edfd2d4094a8badb20ccb4c50f,

title = "Finding optimal bipartitions of points and polygons",

abstract = "We give efficient algorithms to compute an optimal bipartition of a set of points or a set of simple polygons in the plane. We examine various criteria involving the perimeter and the area of the convex hulls of the two subsets.",

author = "Mitchell, \{Joseph S.B.\} and Wynters, \{Erik L.\}",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1991.; 2nd Workshop on Algorithms and Data Structures, WADS 1991 ; Conference date: 14-08-1991 Through 16-08-1991",

year = "1991",

doi = "10.1007/BFb0028263",

language = "English",

isbn = "9783540475668",

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

publisher = "Springer Verlag",

pages = "202--213",

editor = "Frank Dehne and Jorg-Rudiger Sack and Nicola Santoro",

booktitle = "Algorithms and Data Structures - 2nd Workshop, WADS 1991, Proceedings",

}

Mitchell, JSB & Wynters, EL 1991, Finding optimal bipartitions of points and polygons. in F Dehne, J-R Sack & N Santoro (eds), Algorithms and Data Structures - 2nd Workshop, WADS 1991, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 519 LNCS, Springer Verlag, pp. 202-213, 2nd Workshop on Algorithms and Data Structures, WADS 1991, Ottawa, Canada, 08/14/91. https://doi.org/10.1007/BFb0028263

Finding optimal bipartitions of points and polygons. / Mitchell, Joseph S.B.; Wynters, Erik L.
Algorithms and Data Structures - 2nd Workshop, WADS 1991, Proceedings. ed. / Frank Dehne; Jorg-Rudiger Sack; Nicola Santoro. Springer Verlag, 1991. p. 202-213 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 519 LNCS).

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

TY - GEN

T1 - Finding optimal bipartitions of points and polygons

AU - Mitchell, Joseph S.B.

AU - Wynters, Erik L.

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1991.

PY - 1991

Y1 - 1991

N2 - We give efficient algorithms to compute an optimal bipartition of a set of points or a set of simple polygons in the plane. We examine various criteria involving the perimeter and the area of the convex hulls of the two subsets.

AB - We give efficient algorithms to compute an optimal bipartition of a set of points or a set of simple polygons in the plane. We examine various criteria involving the perimeter and the area of the convex hulls of the two subsets.

UR - https://www.scopus.com/pages/publications/0343733438

U2 - 10.1007/BFb0028263

DO - 10.1007/BFb0028263

M3 - Conference contribution

AN - SCOPUS:0343733438

SN - 9783540475668

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

SP - 202

EP - 213

BT - Algorithms and Data Structures - 2nd Workshop, WADS 1991, Proceedings

A2 - Dehne, Frank

A2 - Sack, Jorg-Rudiger

A2 - Santoro, Nicola

PB - Springer Verlag

T2 - 2nd Workshop on Algorithms and Data Structures, WADS 1991

Y2 - 14 August 1991 through 16 August 1991

ER -

Mitchell JSB, Wynters EL. Finding optimal bipartitions of points and polygons. In Dehne F, Sack JR, Santoro N, editors, Algorithms and Data Structures - 2nd Workshop, WADS 1991, Proceedings. Springer Verlag. 1991. p. 202-213. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/BFb0028263

Finding optimal bipartitions of points and polygons

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this