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

The Hebrew University of Jerusalem

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

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

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Geometry and Topology
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

10.1007/s00454-012-9484-7

Cite this

@article{52ed262eb83b4870a1ac886f87421ed3,

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 = "الإنجليزيّة",

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 - مقالة

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

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this