Illuminating disjoint line segments in the plane (Q1434256): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00454-003-2797-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1519914687 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3910557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable. I: Discharging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable. II: Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized planar matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for guard placement in polygons with holes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Illuminating rectangles and triangles on the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Illumination of convex discs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>k</i>‐piece packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An art gallery theorem for line segments in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing paths of length at least two / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the completeness of a generalized matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial problems on the illumination of convex bodies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3799261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4547825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Illumination in the presence of opaque line segments in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visible Shorelines / rank
 
Normal rank

Latest revision as of 18:22, 6 June 2024

scientific article
Language Label Description Also known as
English
Illuminating disjoint line segments in the plane
scientific article

    Statements

    Illuminating disjoint line segments in the plane (English)
    0 references
    0 references
    7 July 2004
    0 references
    In the Euclidean plane \(E^2\), let \(S\) be a set of points (light sources), and \(D\) be a family of objects. We say that the set \(S\) ``illuminates'' a point set \(P\) if for any \(p\in P\) there is some \(s\in S\) such that \(]p,s[\cap D=\emptyset\), and the whole family \(D\) is illuminated by \(S\) if any boundary point of every member of \(D\) is illuminated by some \(s\in S\). (Note that the concept of illumination used here equals the concept of ``visibility'' introduced by F. A. Valentine.) Improving older results, the author shows that if \(D\) consists of \(n\) disjoint line segments (each of them clearly forming its own boundary), \(\lfloor{(n+1)\over 2}\rfloor\) light sources are enough. He also considers ``free space illumination'' (i.e., illumination of the complement of the union of all objects, with respect to \(E^2\)) and proves that \(\lfloor{4(n+1)\over 5}\rfloor\) light sources are sufficient (and sometimes also necessary) to illuminate the free space and both sides of \(n\geq 2\) disjoint line segments in \(E^2\).
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    illumination
    0 references
    visibility
    0 references
    matching technique
    0 references
    dual graph
    0 references
    simple graph
    0 references
    convex partition
    0 references
    0 references