Staircase kernels

被引：1

作者：

Magazanik, Evelyn ^{[1
]}

Perles, Micha A. ^{[1
]}

机构：

[1] Hebrew Univ Jerusalem, IL-91905 Jerusalem, Israel

来源：

ADVANCES IN GEOMETRY | 2008年 / 8卷 / 01期

关键词：

staircase kernels; staircase connectivity;

D O I：

10.1515/ADVGEOM.2008.005

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let S subset of R-2 be a compact staircase connected set with stdiam(S) = n. In [4] we showed that Ker(r)(S) is nonempty if r >= n+1/2, and for r >= n/2+1, Ker(r)(S) is staircase connected. In this paper we determine the possible values of the staircase diameter of Ker(r)(S) for r >= n/2+1 and present interesting facts about Ker(r)(S) when r= n/2 and r = n+1/2.

引用

页码：87 / 100

页数：14

共 50 条

[1] STAIRCASE VISIBILITY AND COMPUTATION OF KERNELS
SCHUIERER, S
WOOD, D
ALGORITHMICA, 1995, 14 (01) : 1 - 26
[2] Staircase visibility and computation of kernels
Schuierer, S.
Wood, D.
Algorithmica (New York), 1995, 14 (01):
[3] STAIRCASE KERNELS IN ORTHOGONAL POLYGONS
BREEN, M
ARCHIV DER MATHEMATIK, 1992, 59 (06) : 588 - 594
[4] DIMENSIONS OF STAIRCASE KERNELS IN ORTHOGONAL POLYGONS
BREEN, M
GEOMETRIAE DEDICATA, 1994, 49 (03) : 323 - 333
[5] Staircase kernels for orthogonal d-polytopes
Breen, M
MONATSHEFTE FUR MATHEMATIK, 1996, 122 (01): : 1 - 7
[6] STAIRCASE K-KERNELS FOR ORTHOGONAL POLYGONS
BREEN, M
ARCHIV DER MATHEMATIK, 1994, 63 (02) : 182 - 190
[7] Tree awareness for relational DBMS kernels: Staircase join
Grust, T
van Keulen, M
INTELLIGENT SEARCH ON XML DATA: APPLICATIONS, LANGUAGES, MODELS IMPLEMENTATIONS AND BENCHMARKS, 2003, 2818 : 231 - 245
[8] Staircase two-guard kernels of orthogonal polygons
Breen M.
Journal of Geometry, 2001, 71 (1) : 26 - 33
[9] Suitable families of boxes and kernels of staircase starshaped sets in
Breen, Marilyn
AEQUATIONES MATHEMATICAE, 2014, 87 (1-2) : 43 - 52
[10] An enlarged class of orthogonal polytopes having staircase convex kernels
Breen, Marilyn (mbreen@ou.edu), 1600, Charles Babbage Research Centre (101):

← 1 2 3 4 5 →