A generalization of staircase visibility (Q4035765)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 176589
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A generalization of staircase visibility |
scientific article; zbMATH DE number 176589 |
Statements
18 May 1993
0 references
kernel
0 references
staircase-visibility
0 references
polygon
0 references
0.8737012
0 references
0.86473864
0 references
0.84982055
0 references
0.84005797
0 references
0 references
0.81899405
0 references
0 references
0 references
0 references
A generalization of staircase visibility (English)
0 references
[For the entire collection see Zbl 0753.00016.] The authors discuss for some sets of orientations generalizations of staircase-visibility. Curves that are monotone with respect to the given set \(\mathcal O\) of orientations are called \(\mathcal O\)-staircases. The \(\mathcal O\)-kernel of a polygon \(P\) is the set of all points \(p\) in \(P\) for which for all other points \(q\) in \(P\) there exists an \(\mathcal O\)-staircase from \(p\) to \(q\) that is completely contained in \(P\). A fast algorithm for computing the \(\mathcal O\)-kernel of a polygon is given.
0 references