Jump to content

Space allocation problem

Add links
From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Veryproicelandic (talk | contribs) at 04:53, 18 August 2018 (added some links, removed that flag, cleaned up the syntax... removed technical flag- it's HS-level reading, but not overly complex...). 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. 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.


Stub icon

This architecture-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Space_allocation_problem&oldid=855420431"