Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q18389289> ?p ?o }
Showing triples 1 to 32 of
32
with 100 triples per page.
- Q18389289 subject Q6309001.
- Q18389289 subject Q7214699.
- Q18389289 abstract "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 covered and on the types of units allowed in the covering. An example polygon covering problem is: given a rectilinear polygon, find a smallest set of squares whose union equals the polygon.In some scenarios, it is not required to cover the entire polygon but only its edges (this is called polygon edge covering) or its vertices (this is called polygon vertex covering).In a covering problem, the units in the covering are allowed to overlap, as long as their union is exactly equal to the target polygon. This is in contrast to a packing problem, in which the units must be disjoint and their union may be smaller than the target polygon, and to a polygon partition problem, in which the units must be disjoint and their union must be equal to the target polygon.A polygon covering problem is a special case of the set cover problem. In general, the problem of finding a smallest set covering is NP-complete, but for special classes of polygons, a smallest polygon covering can be found in polynomial time.".
- Q18389289 thumbnail Removing_holes_from_a_rectilinear_polygon.png?width=300.
- Q18389289 wikiPageWikiLink Q1137554.
- Q18389289 wikiPageWikiLink Q1187620.
- Q18389289 wikiPageWikiLink Q1192100.
- Q18389289 wikiPageWikiLink Q161396.
- Q18389289 wikiPageWikiLink Q1764144.
- Q18389289 wikiPageWikiLink Q189114.
- Q18389289 wikiPageWikiLink Q2000090.
- Q18389289 wikiPageWikiLink Q214856.
- Q18389289 wikiPageWikiLink Q272735.
- Q18389289 wikiPageWikiLink Q3045660.
- Q18389289 wikiPageWikiLink Q37555.
- Q18389289 wikiPageWikiLink Q3851477.
- Q18389289 wikiPageWikiLink Q4189855.
- Q18389289 wikiPageWikiLink Q4653447.
- Q18389289 wikiPageWikiLink Q5179260.
- Q18389289 wikiPageWikiLink Q591310.
- Q18389289 wikiPageWikiLink Q6309001.
- Q18389289 wikiPageWikiLink Q7104528.
- Q18389289 wikiPageWikiLink Q7214699.
- Q18389289 wikiPageWikiLink Q7255664.
- Q18389289 wikiPageWikiLink Q7303186.
- Q18389289 wikiPageWikiLink Q7606862.
- Q18389289 wikiPageWikiLink Q782746.
- Q18389289 wikiPageWikiLink Q874709.
- Q18389289 wikiPageWikiLink Q924362.
- Q18389289 comment "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 covered and on the types of units allowed in the covering.".
- Q18389289 label "Polygon covering".
- Q18389289 depiction Removing_holes_from_a_rectilinear_polygon.png.