Rectangle packing

http://dbpedia.org/resource/Rectangle_packing

Rectangle packing is a packing problem where the objective is to determine whether a given set of small rectangles can be placed inside a given large polygon, such that no two small rectangles overlap. Several variants of this problem have been studied. rdf:langString

rdfs:label

rdf:langString Rectangle packing

dbpedia-owl:wikiPageID

xsd:integer 65267385

dbpedia-owl:wikiPageRevisionID

xsd:integer 1113037536

dbpedia-owl:abstract

rdf:langString Rectangle packing is a packing problem where the objective is to determine whether a given set of small rectangles can be placed inside a given large polygon, such that no two small rectangles overlap. Several variants of this problem have been studied.

dbpedia-owl:wikiPageLength

xsd:nonNegativeInteger 7242

dcterms:subject

<http://dbpedia.org/resource/Category:Packing_problems>

<http://dbpedia.org/resource/Category:Geometric_algorithms>

<http://dbpedia.org/resource/Category:NP-hard_problems>

dbpedia-owl:wikiPageWikiLink

<http://dbpedia.org/resource/NP_(complexity)>

<http://dbpedia.org/resource/Category:Packing_problems>

<http://dbpedia.org/resource/De_Bruijn's_theorem>

<http://dbpedia.org/resource/Independent_set_(graph_theory)>

<http://dbpedia.org/resource/Maximum_disjoint_set>