On the polygonal diameter (= link diameter) of the interior, resp. exterior, of a simple closed polygon in the plane (Q2446340)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the polygonal diameter (= link diameter) of the interior, resp. exterior, of a simple closed polygon in the plane
scientific article

    Statements

    On the polygonal diameter (= link diameter) of the interior, resp. exterior, of a simple closed polygon in the plane (English)
    0 references
    0 references
    0 references
    0 references
    16 April 2014
    0 references
    The authors consider the polygonal diameter \(\text{poldiam}(D)\) of a set \(D \subset \mathbb{R}^{2}\) called also the link diameter in some papers. It is defined as \(\sup \{\rho_D(x, y) : x, y \in D \}\), where \(\rho_D(x, y)\) denotes the smallest number of edges of a polygonal path in \(D\) that connects \(x\) and \(y\). The main theorem of this paper says that for every simple closed \(n\)-gon \(P \subset \mathbb{R}^{2}\), where \(n \geq 3\), the polygonal diameter of the interior of \(P\) is at most \(\lfloor {n \over 2} \rfloor \), and the polygonal diameter of the exterior of \(P\) is at most \(\lceil {n \over 2} \rceil\). Moreover, for every \(n \geq 3\) there exists an \(n\)-gon for which both these bounds are attained. Recall that \textit{M. A. Perles} et al. [Discrete Comput. Geom. 42, No. 2, 277--304 (2009; Zbl 1176.52005)] gave almost tight estimates for a polyhedral \((d-1)\)-pseudomanifold in \(\mathbb{R}^{d}\) in terms of the number \(n\) of its facets and the dimension \(d\) of the ambient space.
    0 references
    0 references
    Jordan-Brouwer theorem
    0 references
    Jordan exterior
    0 references
    Jordan interior
    0 references
    Jordan's curve theorem
    0 references
    polygonal diameter
    0 references
    link diameter
    0 references
    raindrop proof
    0 references
    simple closed polygon
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references