Trust Network Analysis : exploring three-dimensional equilibrium
Citable URI:
http://hdl.handle.net/1721.1/49539
| Title: | Trust Network Analysis : exploring three-dimensional equilibrium |
| Author: | Block, Philippe (Philippe Camille Vincent) |
| Other Contributors: | Massachusetts Institute of Technology. Dept. of Architecture. |
| Advisor: | John A. Ochsendorf. |
| Department: | Massachusetts Institute of Technology. Dept. of Architecture. |
| Publisher: | Massachusetts Institute of Technology |
| Issue Date: | 2009 |
| Abstract: | This dissertation presents Thrust Network Analysis, a new methodology for generating compression-only vaulted surfaces and networks. The method finds possible funicular solutions under gravitational loading within a defined envelope. Using projective geometry, duality theory and linear optimization, it provides a graphical and intuitive method, adopting the same advantages of techniques such as graphic statics, but offering a viable extension to fully three-dimensional problems. The proposed method is applicable for the analysis of vaulted historical structures, specifically in unreinforced masonry, as well as the design of new vaulted structures. This dissertation introduces the method and shows examples of applications in both fields. Thrust Network Analysis, masonry, historic structures, compression-only structures, limit analysis, equilibrium analysis, funicular design, form-finding, structural optimization, Gothic vaults, reciprocal diagrams. |
| Description: |
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Architecture, 2009. This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. Includes bibliographical references (p. 145-153). |
| URI: | http://hdl.handle.net/1721.1/49539 |
| Keywords: | Architecture. |
Files in this item
| Files | Size | Format |
|---|---|---|
| Preview, non-printable (open to all) | 22.49Mb | application/pdf |
| Full printable version (MIT only) | 24.04Mb | application/pdf |
This item appears in the following Collection(s)
All Items in DSpace@MIT are protected by original copyright, with all rights reserved, unless otherwise indicated.
|
|
Contact
MIT Libraries
|