11418

Interactive Design Exploration for Constrained Meshes

Bailin Deng, Sofien Bouaziz, Mario Deuss, Alexandre Kaspar, Yuliy Schwartzburg, Mark Pauly
Computer Graphics and Geometry Laboratory, EPFL, CH-1015 Lausanne, Switzerland
Computer-Aided Design (CAD), 2014

@techreport{bouaziz2014interactive,

   title={Interactive Design Exploration for Constrained Meshes},

   author={Bouaziz, Sofien and Deuss, Mario Moacir and Kaspar, Alexandre and Schwartzburg, Yuliy and Pauly, Mark and Deng, Bailin},

   year={2014}

}

Download Download (PDF)   View View   Source Source   

768

views

In architectural design, surface shapes are commonly subject to geometric constraints imposed by material, fabrication or assembly. Rationalization algorithms can convert a freeform design into a form feasible for production, but often require design modifications that might not comply with the design intent. In addition, they only offer limited support for exploring alternative feasible shapes, due to the high complexity of the optimization algorithm. We address these shortcomings and present a computational framework for interactive shape exploration of discrete geometric structures in the context of freeform architectural design. Our method is formulated as a mesh optimization subject to shape constraints. Our formulation can enforce soft constraints and hard constraints at the same time, and handles equality constraints and inequality constraints in a unified way. We propose a novel numerical solver that splits the optimization into a sequence of simple subproblems that can be solved efficiently and accurately. Based on this algorithm, we develop a system that allows the user to explore designs satisfying geometric constraints. Our system offers full control over the exploration process, by providing direct access to the specification of the design space. At the same time, the complexity of the underlying optimization is hidden from the user, who communicates with the system through intuitive interfaces.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: