Optimal space coverage with white convex polygons (Q306074): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Independent set of intersection graphs of convex objects in 2D / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle-Free Planar Graphs and Segment Intersection Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theorem for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: White Space Regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5781239 / rank
 
Normal rank

Latest revision as of 11:38, 12 July 2024

scientific article
Language Label Description Also known as
English
Optimal space coverage with white convex polygons
scientific article

    Statements

    Optimal space coverage with white convex polygons (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    31 August 2016
    0 references
    white convex polygon
    0 references
    convex covering
    0 references
    NP-hardness
    0 references
    algorithm
    0 references

    Identifiers