Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Polygon_partition> ?p ?o }
Showing triples 1 to 52 of
52
with 100 triples per page.
- Polygon_partition abstract "A partition of a polygon is a set of primitive units (e.g. squares), which do not overlap and whose union equals the polygon. A polygon partition problem is a problem of finding a partition which is minimal in some sense, for example: a partition with a smallest number of units or with units of smallest total side-length. Polygon partitioning is an important class of problems in computational geometry. There are many different polygon partition problems, depending on the type of polygon being partitioned and on the types of units allowed in the partition. The term polygon decomposition is often used as a general term that includes both covering and partitioning.".
- Polygon_partition wikiPageID "48191322".
- Polygon_partition wikiPageLength "9619".
- Polygon_partition wikiPageOutDegree "39".
- Polygon_partition wikiPageRevisionID "704593487".
- Polygon_partition wikiPageWikiLink Bitmap.
- Polygon_partition wikiPageWikiLink Category:Computational_geometry.
- Polygon_partition wikiPageWikiLink Category:Polygons.
- Polygon_partition wikiPageWikiLink Computational_geometry.
- Polygon_partition wikiPageWikiLink Computer_graphics.
- Polygon_partition wikiPageWikiLink Convex_polygon.
- Polygon_partition wikiPageWikiLink Convolution.
- Polygon_partition wikiPageWikiLink DNA.
- Polygon_partition wikiPageWikiLink Data_compression.
- Polygon_partition wikiPageWikiLink Database.
- Polygon_partition wikiPageWikiLink Euclidean_tilings_by_convex_regular_polygons.
- Polygon_partition wikiPageWikiLink Image_processing.
- Polygon_partition wikiPageWikiLink Minimum-weight_triangulation.
- Polygon_partition wikiPageWikiLink Monotone_polygon.
- Polygon_partition wikiPageWikiLink NP-hardness.
- Polygon_partition wikiPageWikiLink Packing_problems.
- Polygon_partition wikiPageWikiLink Pattern_recognition.
- Polygon_partition wikiPageWikiLink Point_inclusion_problem.
- Polygon_partition wikiPageWikiLink Polygon.
- Polygon_partition wikiPageWikiLink Polygon_covering.
- Polygon_partition wikiPageWikiLink Polygon_triangulation.
- Polygon_partition wikiPageWikiLink Pseudotriangle.
- Polygon_partition wikiPageWikiLink Quadrilateral.
- Polygon_partition wikiPageWikiLink Radiation_therapy.
- Polygon_partition wikiPageWikiLink Rectangle.
- Polygon_partition wikiPageWikiLink Rectilinear_polygon.
- Polygon_partition wikiPageWikiLink Self-assembly.
- Polygon_partition wikiPageWikiLink Spiral.
- Polygon_partition wikiPageWikiLink Squaring_the_square.
- Polygon_partition wikiPageWikiLink Star_polygon.
- Polygon_partition wikiPageWikiLink Steiner_tree_problem.
- Polygon_partition wikiPageWikiLink Tiling_puzzle.
- Polygon_partition wikiPageWikiLink Tiling_with_rectangles.
- Polygon_partition wikiPageWikiLink Trapezoid.
- Polygon_partition wikiPageWikiLink Very-large-scale_integration.
- Polygon_partition wikiPageWikiLinkText "Polygon partition".
- Polygon_partition wikiPageWikiLinkText "polygon partition".
- Polygon_partition wikiPageUsesTemplate Template:Main.
- Polygon_partition wikiPageUsesTemplate Template:Reflist.
- Polygon_partition wikiPageUsesTemplate Template:Rp.
- Polygon_partition subject Category:Computational_geometry.
- Polygon_partition subject Category:Polygons.
- Polygon_partition hypernym Set.
- Polygon_partition comment "A partition of a polygon is a set of primitive units (e.g. squares), which do not overlap and whose union equals the polygon. A polygon partition problem is a problem of finding a partition which is minimal in some sense, for example: a partition with a smallest number of units or with units of smallest total side-length. Polygon partitioning is an important class of problems in computational geometry.".
- Polygon_partition label "Polygon partition".
- Polygon_partition wasDerivedFrom Polygon_partition?oldid=704593487.
- Polygon_partition isPrimaryTopicOf Polygon_partition.