Polygon covering
A covering of a polygon is a set of primitive units (e.g. squares) whose union equals the polygon. A polygon covering problem is a problem of finding a covering with a smallest number of units for a given polygon. This is an important class of problems in computational geometry. There are many different polygon covering problems, depending on the type of polygon being covering. An example polygon covering problem is: given a rectilinear polygon, find a smallest set of squares whose union equals the polygon.
Link from a Wikipage to another Wikipage
primaryTopic
Polygon covering
A covering of a polygon is a set of primitive units (e.g. squares) whose union equals the polygon. A polygon covering problem is a problem of finding a covering with a smallest number of units for a given polygon. This is an important class of problems in computational geometry. There are many different polygon covering problems, depending on the type of polygon being covering. An example polygon covering problem is: given a rectilinear polygon, find a smallest set of squares whose union equals the polygon.
has abstract
A covering of a polygon is a s ...... s minimal, but not vice versa.
@en
Wikipage page ID
43,043,289
page length (characters) of wiki page
Wikipage revision ID
1,006,783,891
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
comment
A covering of a polygon is a s ...... hose union equals the polygon.
@en
label
Polygon covering
@en