Generalized convex kernels of simply connected L n sets in the plane

Evelyn Magazanik; Micha A. Perles

doi:10.1007/s11856-007-0059-x

Generalized convex kernels of simply connected L _n sets in the plane

Evelyn Magazanik^*, Micha A. Perles

^*Corresponding author for this work

Einstein Institute of Mathematics

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

9 Scopus citations

Abstract

Let D be a compact, simply connected subset of R². Assume that every two points of D can be connected by a polygonal line with at most n edges within D. Then there is a point q D that can be connected to any other point in D by a polygonal line with at most n edges. This is best possible for all n.

Original language	English
Pages (from-to)	157-171
Number of pages	15
Journal	Israel Journal of Mathematics
Volume	160
DOIs	https://doi.org/10.1007/s11856-007-0059-x
State	Published - Aug 2007

Access to Document

10.1007/s11856-007-0059-x

Cite this

@article{9b68574976da4c0fb19da261f42846f0,

title = "Generalized convex kernels of simply connected L n sets in the plane",

abstract = "Let D be a compact, simply connected subset of R2. Assume that every two points of D can be connected by a polygonal line with at most n edges within D. Then there is a point q D that can be connected to any other point in D by a polygonal line with at most n edges. This is best possible for all n.",

author = "Evelyn Magazanik and Perles, {Micha A.}",

year = "2007",

month = aug,

doi = "10.1007/s11856-007-0059-x",

language = "אנגלית",

volume = "160",

pages = "157--171",

journal = "Israel Journal of Mathematics",

issn = "0021-2172",

publisher = "Springer New York",

}

TY - JOUR

T1 - Generalized convex kernels of simply connected L n sets in the plane

AU - Magazanik, Evelyn

AU - Perles, Micha A.

PY - 2007/8

Y1 - 2007/8

N2 - Let D be a compact, simply connected subset of R2. Assume that every two points of D can be connected by a polygonal line with at most n edges within D. Then there is a point q D that can be connected to any other point in D by a polygonal line with at most n edges. This is best possible for all n.

AB - Let D be a compact, simply connected subset of R2. Assume that every two points of D can be connected by a polygonal line with at most n edges within D. Then there is a point q D that can be connected to any other point in D by a polygonal line with at most n edges. This is best possible for all n.

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

U2 - 10.1007/s11856-007-0059-x

DO - 10.1007/s11856-007-0059-x

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:58449099922

SN - 0021-2172

VL - 160

SP - 157

EP - 171

JO - Israel Journal of Mathematics

JF - Israel Journal of Mathematics

ER -

Generalized convex kernels of simply connected L _n sets in the plane

Abstract

Access to Document

Other files and links

Fingerprint

Cite this