Intersections of maximal staircase sets

Evelyn Magazanik*, Micha A. Perles

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

A compact set S ℝ2 is staircase connected if every two points a, b S can be connected by an x-monotone and y-monotone polygonal path with sides parallel to the coordinate axes. In [5] we have introduced the concepts of staircase k-stars and kernels. In this paper we prove that if the staircase k-kernel is not empty, then it can be expressed as the intersection of a covering family of maximal subsets of staircase diameter k of S.

Original languageEnglish
Pages (from-to)127-133
Number of pages7
JournalJournal of Geometry
Volume88
Issue number1-2
DOIs
StatePublished - Mar 2008

Keywords

  • Orthogonal convexity
  • Staircase kernels
  • Staircase sets

Fingerprint

Dive into the research topics of 'Intersections of maximal staircase sets'. Together they form a unique fingerprint.

Cite this