Jump to content

Space allocation problem

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Wavelength (talk | contribs) at 17:56, 25 February 2014 (inserting 2 hyphens: —> "two- or three-dimensional"—wikt:two-dimensionalwikt:three-dimensionalWP:HYPHEN, sub-subsection 3, point 7 on hanging hyphens). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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, mainly topological and geometric constraints, and the positioning of openings according to their geometric dimensions, in a two- or three-dimensional space.