Jump to content

Space allocation problem

From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Ma nam is geoffrey (talk | contribs) at 12:15, 18 June 2020 (Unnecessary capitalization). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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.