Covering oriented points in the plane with orthogonal polygons is NP-complete (Q2883577): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of detecting crossingfree configurations in the plane / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reconstructing orthogonal polyhedra from putative vertex sets / rank | |||
Normal rank | |||
Revision as of 04:24, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Covering oriented points in the plane with orthogonal polygons is NP-complete |
scientific article |
Statements
Covering oriented points in the plane with orthogonal polygons is NP-complete (English)
0 references
13 May 2012
0 references
computational geometry
0 references
covering
0 references
orthogonal polygon
0 references
NP-complete
0 references
