An Entity of Type: Election, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

The space allocation problem (SAP) is the process in architecture, or in any kind of space planning (SP) technique, of determining the position and size of several elements according to the input-specified design program requirements. These are usually topological and geometric constraints, as well as matters related to the positioning of openings according to their geometric dimensions, in a two- or three-dimensional space. * v * t * e

Property Value
dbo:abstract
  • The space allocation problem (SAP) is the process in architecture, or in any kind of space planning (SP) technique, of determining the position and size of several elements according to the input-specified design program requirements. These are usually topological and geometric constraints, as well as matters related to the positioning of openings according to their geometric dimensions, in a two- or three-dimensional space. * v * t * e (en)
dbo:wikiPageID
  • 36744582 (xsd:integer)
dbo:wikiPageLength
  • 667 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 963194373 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • The space allocation problem (SAP) is the process in architecture, or in any kind of space planning (SP) technique, of determining the position and size of several elements according to the input-specified design program requirements. These are usually topological and geometric constraints, as well as matters related to the positioning of openings according to their geometric dimensions, in a two- or three-dimensional space. * v * t * e (en)
rdfs:label
  • Space allocation problem (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageDisambiguates of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License