9,823 research outputs found
Wire mesh design
We present a computational approach for designing wire meshes, i.e., freeform surfaces composed of woven wires arranged in a regular grid. To facilitate shape exploration, we map material properties of wire meshes to the geometric model of Chebyshev nets. This abstraction is exploited to build an efficient optimization scheme. While the theory of Chebyshev nets suggests a highly constrained design space, we show that allowing controlled deviations from the underlying surface provides a rich shape space for design exploration. Our algorithm balances globally coupled material constraints with aesthetic and geometric design objectives that can be specified by the user in an interactive design session. In addition to sculptural art, wire meshes represent an innovative medium for industrial applications including composite materials and architectural façades. We demonstrate the effectiveness of our approach using a variety of digital and physical prototypes with a level of shape complexity unobtainable using previous methods
Interactive design exploration for constrained meshes
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
Data-Driven Shape Analysis and Processing
Data-driven methods play an increasingly important role in discovering
geometric, structural, and semantic relationships between 3D shapes in
collections, and applying this analysis to support intelligent modeling,
editing, and visualization of geometric data. In contrast to traditional
approaches, a key feature of data-driven approaches is that they aggregate
information from a collection of shapes to improve the analysis and processing
of individual shapes. In addition, they are able to learn models that reason
about properties and relationships of shapes without relying on hard-coded
rules or explicitly programmed instructions. We provide an overview of the main
concepts and components of these techniques, and discuss their application to
shape classification, segmentation, matching, reconstruction, modeling and
exploration, as well as scene analysis and synthesis, through reviewing the
literature and relating the existing works with both qualitative and numerical
comparisons. We conclude our report with ideas that can inspire future research
in data-driven shape analysis and processing.Comment: 10 pages, 19 figure
A Variational Level Set Approach for Surface Area Minimization of Triply Periodic Surfaces
In this paper, we study triply periodic surfaces with minimal surface area
under a constraint in the volume fraction of the regions (phases) that the
surface separates. Using a variational level set method formulation, we present
a theoretical characterization of and a numerical algorithm for computing these
surfaces. We use our theoretical and computational formulation to study the
optimality of the Schwartz P, Schwartz D, and Schoen G surfaces when the volume
fractions of the two phases are equal and explore the properties of optimal
structures when the volume fractions of the two phases not equal. Due to the
computational cost of the fully, three-dimensional shape optimization problem,
we implement our numerical simulations using a parallel level set method
software package.Comment: 28 pages, 16 figures, 3 table
Möbius Geometry and Cyclidic Nets: A Framework for Complex Shape Generation
International audienceFree-form architecture challenges architects, engineers and builders. The geometrical rationalization of complex structures requires sophisticated tools. To this day, two frameworks are commonly used: NURBS modeling and mesh-based approaches. The authors propose an alternative modeling framework called generalized cyclidic nets that automatically yields optimal geometrical properties for the façade and the structure. This framework uses a base circular mesh and Dupin cyclides, which are natural objects of the geometry of circles in space, also known as Möbius geometry. This paper illustrates how new shapes can be generated from generalized cyclidic nets. Finally, it is demonstrated that this framework gives a simple method to generate curved-creases on free-forms. These findings open new perspectives for structural design of complex shells
Morphing of Triangular Meshes in Shape Space
We present a novel approach to morph between two isometric poses of the same
non-rigid object given as triangular meshes. We model the morphs as linear
interpolations in a suitable shape space . For triangulated 3D
polygons, we prove that interpolating linearly in this shape space corresponds
to the most isometric morph in . We then extend this shape space
to arbitrary triangulations in 3D using a heuristic approach and show the
practical use of the approach using experiments. Furthermore, we discuss a
modified shape space that is useful for isometric skeleton morphing. All of the
newly presented approaches solve the morphing problem without the need to solve
a minimization problem.Comment: Improved experimental result
- …