Covering points with minimum/maximum area orthogonally convex polygons (Q283887): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
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 |
Revision as of 23:28, 11 July 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
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