Visibility in semi-convex spaces (Q1375948): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clear Visibility and the Dimension of Kernels of Starshaped Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Krasnosel'skij theorem for staircase paths in orthogonal polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved Krasnosel'skij type theorem for orthogonal polygons which are starshaped via staircase paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonally convex covering of orthogonal polygons without holes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3888082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tverberg-type generalization of the Helly number of a convexity space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Der Satz von Radon in konvexen Produktstrukturen. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5728945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3940405 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiomatic convexity theory and relationships between the Carathéodory, Helly, and Radon numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5807392 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering orthogonal polygons with star polygons: The perfect graph approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rectangular visibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3274652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3796310 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decompositin theorem for convexity spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4125422 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3902107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Radon partitions in convexity spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3675094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal algorithms to compute the closure of a set of iso-rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radial Functions of Convex and Star-Shaped Bodies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical visibility and outward rays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Convexity and L n Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141898 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01252225 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2018197491 / rank
 
Normal rank

Latest revision as of 10:07, 30 July 2024

scientific article
Language Label Description Also known as
English
Visibility in semi-convex spaces
scientific article

    Statements

    Visibility in semi-convex spaces (English)
    0 references
    0 references
    0 references
    24 August 1998
    0 references
    A semi-convex space is a pair \((X,C_X)\) consisting of a set \(X\) and a collection \(C_X\) of subsets of \(X\) such that \(\varnothing\in C_X\) and, for all nonempty \(C \subseteq C_X\), one has \(\cap C\in C_X\) (in contrast with the definition of a convexity space, it is not required that \(X\in C_X)\). The convex hull of \(Y\subseteq X\) is defined as \(C_X- \text{hull} (Y)=\cap \{C\in C_X| Y\subseteq C\}\), with the unusual convention \(\cap \varnothing= \varnothing\). Setting \(C_Y= \{C\in C_X| C\subseteq Y\}\), one says that \(x\) \(C_Y\)-sees \(y\) in \(Y\) if \(C_Y-\text{hull} (\{x,y\}) \neq\varnothing\). One further defines \(C_X\)-kernel\((Y)= \{y\in Y| \text{ for all } y'\in Y,\;y\) \(C_Y\)-sees \(y'\}\). The maximal elements (with respect to inclusion) of \(C_Y\) are called \(C_X\)-skulls of \(Y\). The authors prove several theorems relating skulls and kernels, and study semi-convex spaces in the plane induced by metrics. The theory is illustrated with two examples of semi-convex spaces based on geodesic convexity and staircase convexity.
    0 references
    visibility
    0 references
    kernel
    0 references
    skull
    0 references
    semi-convex space
    0 references
    convexity space
    0 references
    geodesic convexity
    0 references
    staircase convexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers