Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Polygon_covering> ?p ?o }
Showing triples 1 to 50 of
50
with 100 triples per page.
- Polygon_covering 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.".
- Polygon_covering thumbnail Removing_holes_from_a_rectilinear_polygon.png?width=300.
- Polygon_covering wikiPageID "43043289".
- Polygon_covering wikiPageLength "15990".
- Polygon_covering wikiPageOutDegree "41".
- Polygon_covering wikiPageRevisionID "700494667".
- Polygon_covering wikiPageWikiLink APX.
- Polygon_covering wikiPageWikiLink Anti_rectangle.
- Polygon_covering wikiPageWikiLink Art_gallery_problem.
- Polygon_covering wikiPageWikiLink Category:Computational_geometry.
- Polygon_covering wikiPageWikiLink Category:Polygons.
- Polygon_covering wikiPageWikiLink Computational_geometry.
- Polygon_covering wikiPageWikiLink Covering_problems.
- Polygon_covering wikiPageWikiLink General_position.
- Polygon_covering wikiPageWikiLink NP-hardness.
- Polygon_covering wikiPageWikiLink Orthogonal_convex_hull.
- Polygon_covering wikiPageWikiLink Packing_problems.
- Polygon_covering wikiPageWikiLink Perfect_graph.
- Polygon_covering wikiPageWikiLink Polygon.
- Polygon_covering wikiPageWikiLink Polygon_partition.
- Polygon_covering wikiPageWikiLink Polygon_triangulation.
- Polygon_covering wikiPageWikiLink Pseudotriangle.
- Polygon_covering wikiPageWikiLink Rectilinear_polygon.
- Polygon_covering wikiPageWikiLink Set_cover_problem.
- Polygon_covering wikiPageWikiLink Simple_polygon.
- Polygon_covering wikiPageWikiLink Spiral.
- Polygon_covering wikiPageWikiLink Star_of_David.
- Polygon_covering wikiPageWikiLink Star_polygon.
- Polygon_covering wikiPageWikiLink Steiner_point.
- Polygon_covering wikiPageWikiLink Steiner_tree_problem.
- Polygon_covering wikiPageWikiLink Tessellation.
- Polygon_covering wikiPageWikiLink Tree_(graph_theory).
- Polygon_covering wikiPageWikiLink Vertex_cover.
- Polygon_covering wikiPageWikiLink File:Removing_holes_from_a_rectilinear_polygon.png.
- Polygon_covering wikiPageWikiLinkText "Polygon covering".
- Polygon_covering wikiPageWikiLinkText "Polygon covering#Covering a rectilinear polygon with star polygons".
- Polygon_covering wikiPageWikiLinkText "polygon triangle covering".
- Polygon_covering wikiPageUsesTemplate Template:Main.
- Polygon_covering wikiPageUsesTemplate Template:Reflist.
- Polygon_covering subject Category:Computational_geometry.
- Polygon_covering subject Category:Polygons.
- Polygon_covering hypernym Set.
- Polygon_covering 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.".
- Polygon_covering label "Polygon covering".
- Polygon_covering sameAs Q18389289.
- Polygon_covering sameAs m.010vtygw.
- Polygon_covering sameAs Q18389289.
- Polygon_covering wasDerivedFrom Polygon_covering?oldid=700494667.
- Polygon_covering depiction Removing_holes_from_a_rectilinear_polygon.png.
- Polygon_covering isPrimaryTopicOf Polygon_covering.