Covering points with minimum/maximum area orthogonally convex polygons (Q283887): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65D18 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 52C15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6580914 / rank
 
Normal rank
Property / zbMATH Keywords
 
orthogonally convex
Property / zbMATH Keywords: orthogonally convex / rank
 
Normal rank
Property / zbMATH Keywords
 
polygon cover
Property / zbMATH Keywords: polygon cover / rank
 
Normal rank
Property / zbMATH Keywords
 
optimal area
Property / zbMATH Keywords: optimal area / rank
 
Normal rank
Property / zbMATH Keywords
 
dynamic programming
Property / zbMATH Keywords: dynamic programming / rank
 
Normal rank
Property / zbMATH Keywords
 
numerical example
Property / zbMATH Keywords: numerical example / rank
 
Normal rank
Property / zbMATH Keywords
 
algorithm
Property / zbMATH Keywords: algorithm / rank
 
Normal rank

Revision as of 18:12, 27 June 2023

scientific article
Language Label Description Also known as
English
Covering points with minimum/maximum area orthogonally convex polygons
scientific article

    Statements

    Covering points with minimum/maximum area orthogonally convex polygons (English)
    0 references
    0 references
    0 references
    0 references
    17 May 2016
    0 references
    orthogonally convex
    0 references
    polygon cover
    0 references
    optimal area
    0 references
    dynamic programming
    0 references
    numerical example
    0 references
    algorithm
    0 references

    Identifiers