A Planar 3-Convex Set is Indeed a Union of Six Convex Sets

Noa Nitzan; Micha A. Perles

doi:10.1007/s00454-012-9484-7

A Planar 3-Convex Set is Indeed a Union of Six Convex Sets

Noa Nitzan^*, Micha A. Perles

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

Suppose S is a planar set. Two points a,b in S see each other via S if [a,b] is included in S. F. Valentine proved in 1957 that if S is closed, and if for every three points of S, at least two see each other via S, then S is a union of three convex sets. The pentagonal star shows that the number three is the best possible. We drop the condition that S is closed and show that S is a union of (at most) six convex sets. The number six is best possible.

Original language	American English
Pages (from-to)	454-477
Number of pages	24
Journal	Discrete and Computational Geometry
Volume	49
Issue number	3
DOIs	https://doi.org/10.1007/s00454-012-9484-7
State	Published - Apr 2013

Keywords

Invisibility graph
Non-convexity
Seeing subset
Valentine's Theorem (57')
Visually independent

Access to Document

10.1007/s00454-012-9484-7

Cite this

@article{606ce763a766453c9657e6ec5eddde77,

title = "A Planar 3-Convex Set is Indeed a Union of Six Convex Sets",

abstract = "Suppose S is a planar set. Two points a,b in S see each other via S if [a,b] is included in S. F. Valentine proved in 1957 that if S is closed, and if for every three points of S, at least two see each other via S, then S is a union of three convex sets. The pentagonal star shows that the number three is the best possible. We drop the condition that S is closed and show that S is a union of (at most) six convex sets. The number six is best possible.",

keywords = "Invisibility graph, Non-convexity, Seeing subset, Valentine's Theorem (57'), Visually independent",

author = "Noa Nitzan and Perles, {Micha A.}",

year = "2013",

month = apr,

doi = "10.1007/s00454-012-9484-7",

language = "American English",

volume = "49",

pages = "454--477",

journal = "Discrete and Computational Geometry",

issn = "0179-5376",

publisher = "Springer New York",

number = "3",

}

TY - JOUR

T1 - A Planar 3-Convex Set is Indeed a Union of Six Convex Sets

AU - Nitzan, Noa

AU - Perles, Micha A.

PY - 2013/4

Y1 - 2013/4

N2 - Suppose S is a planar set. Two points a,b in S see each other via S if [a,b] is included in S. F. Valentine proved in 1957 that if S is closed, and if for every three points of S, at least two see each other via S, then S is a union of three convex sets. The pentagonal star shows that the number three is the best possible. We drop the condition that S is closed and show that S is a union of (at most) six convex sets. The number six is best possible.

AB - Suppose S is a planar set. Two points a,b in S see each other via S if [a,b] is included in S. F. Valentine proved in 1957 that if S is closed, and if for every three points of S, at least two see each other via S, then S is a union of three convex sets. The pentagonal star shows that the number three is the best possible. We drop the condition that S is closed and show that S is a union of (at most) six convex sets. The number six is best possible.

KW - Invisibility graph

KW - Non-convexity

KW - Seeing subset

KW - Valentine's Theorem (57')

KW - Visually independent

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

U2 - 10.1007/s00454-012-9484-7

DO - 10.1007/s00454-012-9484-7

M3 - Article

AN - SCOPUS:84876455499

SN - 0179-5376

VL - 49

SP - 454

EP - 477

JO - Discrete and Computational Geometry

JF - Discrete and Computational Geometry

IS - 3

ER -

A Planar 3-Convex Set is Indeed a Union of Six Convex Sets

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this