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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.comgeo.2016.02.003 / rank
Normal rank
 
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
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.1016/j.comgeo.2016.02.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2278044688 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3796758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected Rectilinear Graphs on Point Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing orthogonal polyhedra from putative vertex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering oriented points in the plane with orthogonal polygons is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering points with orthogonal polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing polygons from scanner data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering points with orthogonally convex polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the definition and computation of rectilinear convex hulls / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COMGEO.2016.02.003 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:16, 9 December 2024

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