Form-finding with polyhedral meshes made simple

Handle URI:
http://hdl.handle.net/10754/555978
Title:
Form-finding with polyhedral meshes made simple
Authors:
Tang, Chengcheng ( 0000-0002-4875-6670 ) ; Sun, Xiang ( 0000-0003-0242-0319 ) ; Gomes, Maria Alexandra; Wallner, Johannes; Pottmann, Helmut ( 0000-0002-3195-9316 )
Abstract:
We solve the form-finding problem for polyhedral meshes in a way which combines form, function and fabrication; taking care of user-specified constraints like boundary interpolation, planarity of faces, statics, panel size and shape, enclosed volume, and last, but not least, cost. Our main application is the interactive modeling of meshes for architectural and industrial design. Our approach can be described as guided exploration of the constraint space whose algebraic structure is simplified by introducing auxiliary variables and ensuring that constraints are at most quadratic. Computationally, we perform a projection onto the constraint space which is biased towards low values of an energy which expresses desirable "soft" properties like fairness. We have created a tool which elegantly handles difficult tasks, such as taking boundary-alignment of polyhedral meshes into account, planarization, fairing under planarity side conditions, handling hybrid meshes, and extending the treatment of static equilibrium to shapes which possess overhanging parts.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Citation:
Form-finding with polyhedral meshes made simple 2014, 33 (4):1 ACM Transactions on Graphics
Publisher:
Association for Computing Machinery (ACM)
Conference/Event name:
41st International Conference and Exhibition on Computer Graphics and Interactive Techniques, ACM SIGGRAPH 2014
Issue Date:
27-Jul-2014
DOI:
10.1145/2601097.2601213
Type:
Conference Paper
ISSN:
07300301
Additional Links:
http://dl.acm.org/citation.cfm?doid=2601097.2601213
Appears in Collections:
Conference Papers; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorTang, Chengchengen
dc.contributor.authorSun, Xiangen
dc.contributor.authorGomes, Maria Alexandraen
dc.contributor.authorWallner, Johannesen
dc.contributor.authorPottmann, Helmuten
dc.date.accessioned2015-05-28T13:59:16Zen
dc.date.available2015-05-28T13:59:16Zen
dc.date.issued2014-07-27en
dc.identifier.citationForm-finding with polyhedral meshes made simple 2014, 33 (4):1 ACM Transactions on Graphicsen
dc.identifier.issn07300301en
dc.identifier.doi10.1145/2601097.2601213en
dc.identifier.urihttp://hdl.handle.net/10754/555978en
dc.description.abstractWe solve the form-finding problem for polyhedral meshes in a way which combines form, function and fabrication; taking care of user-specified constraints like boundary interpolation, planarity of faces, statics, panel size and shape, enclosed volume, and last, but not least, cost. Our main application is the interactive modeling of meshes for architectural and industrial design. Our approach can be described as guided exploration of the constraint space whose algebraic structure is simplified by introducing auxiliary variables and ensuring that constraints are at most quadratic. Computationally, we perform a projection onto the constraint space which is biased towards low values of an energy which expresses desirable "soft" properties like fairness. We have created a tool which elegantly handles difficult tasks, such as taking boundary-alignment of polyhedral meshes into account, planarization, fairing under planarity side conditions, handling hybrid meshes, and extending the treatment of static equilibrium to shapes which possess overhanging parts.en
dc.publisherAssociation for Computing Machinery (ACM)en
dc.relation.urlhttp://dl.acm.org/citation.cfm?doid=2601097.2601213en
dc.rights© ACM, 2014. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM Transactions on Graphics, Volume 33 Issue 4, July 2014. http://doi.acm.org/10.1145/2601097.2601213en
dc.titleForm-finding with polyhedral meshes made simpleen
dc.typeConference Paperen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.conference.date2014-08-10 to 2014-08-14en
dc.conference.name41st International Conference and Exhibition on Computer Graphics and Interactive Techniques, ACM SIGGRAPH 2014en
dc.conference.locationVancouver, BC, CANen
dc.eprint.versionPost-printen
dc.contributor.institutionTU Grazen
dc.contributor.institutionTU Wienen
kaust.authorTang, Chengchengen
kaust.authorSun, Xiangen
kaust.authorGomes, Maria Alexandraen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.