2,087 research outputs found

    Monitoring the production process of lightweight fibrous structures using terrestrial laser scanning

    Get PDF
    The Cluster of Excellence Integrative Computational Design and Construction for Architecture at the University of Stuttgart brings together various disciplines to jointly develop amongst other things a better of processes in the manufacturing and construction domain. One of the cluster’s aims is to create new solutions for the construction of lightweight fibrous structures using coreless winding of lightweight fiber composite systems. For this purpose, a precise geometry and an understanding of the fibers’ behavior during the production process are of major importance. The fibers’ production process is monitored by repeatedly scanning the fibers during different stages of the process using a terrestrial laser scanner. In order to determine the geometry of the fibers’ axes as well as their cross-sections, two different strategies are used. The first strategy focuses on the segmentation of several straight lines between two intersection points. For the comparison of the individual fabrication steps, the positions of the intersection points are contrasted. For the cross-sectional areas of the fibers, orthogonal planes of intersection are then defined and all points within a predefined area are projected onto this plane. Then the area is calculated using a convex hull. In the second strategy, the fibers‘ main axes are represented by best-fitting B-spline curves. The borders of the cross-sections of interest are also approximated by best-fitting B-spline curves, forming the basis for the final determination of the cross-sectional areas. In this case study two epochs are analyzed with a deformation of the size of around 1cm. For both epochs the cross-sections are calculated in cm steps

    A Survey of Spatial Deformation from a User-Centered Perspective

    Get PDF
    The spatial deformation methods are a family of modeling and animation techniques for indirectly reshaping an object by warping the surrounding space, with results that are similar to molding a highly malleable substance. They have the virtue of being computationally efficient (and hence interactive) and applicable to a variety of object representations. In this paper we survey the state of the art in spatial deformation. Since manipulating ambient space directly is infeasible, deformations are controlled by tools of varying dimension - points, curves, surfaces and volumes - and it is on this basis that we classify them. Unlike previous surveys that concentrate on providing a single underlying mathematical formalism, we use the user-centered criteria of versatility, ease of use, efficiency and correctness to compare techniques

    A simulation method to estimate closing forces in car-sealing rubber elements

    Get PDF
    The door-closing process can reinforce the impression of a solid, rock-proof, car body or of a rather cheap, flimsy vehicle. As there are no real prototypes during rubber profile bidding-out stages, engineers need to carry out non-linear numerical simulations that involve complex phenomena as well as static and dynamic loads for several profile candidates. This paper presents a structured virtual design tool based on FEM, including constitutive laws and incompressibility constraints allowing to predict more realistically the final closing forces and even to estimate sealing overpressure as an additional guarantee of noise insulation. Comparisons with results of physical tests are performed

    Modeling and hexahedral meshing of cerebral arterial networks from centerlines

    Full text link
    Computational fluid dynamics (CFD) simulation provides valuable information on blood flow from the vascular geometry. However, it requires extracting precise models of arteries from low-resolution medical images, which remains challenging. Centerline-based representation is widely used to model large vascular networks with small vessels, as it encodes both the geometric and topological information and facilitates manual editing. In this work, we propose an automatic method to generate a structured hexahedral mesh suitable for CFD directly from centerlines. We addressed both the modeling and meshing tasks. We proposed a vessel model based on penalized splines to overcome the limitations inherent to the centerline representation, such as noise and sparsity. The bifurcations are reconstructed using a parametric model based on the anatomy that we extended to planar n-furcations. Finally, we developed a method to produce a volume mesh with structured, hexahedral, and flow-oriented cells from the proposed vascular network model. The proposed method offers better robustness to the common defects of centerlines and increases the mesh quality compared to state-of-the-art methods. As it relies on centerlines alone, it can be applied to edit the vascular model effortlessly to study the impact of vascular geometry and topology on hemodynamics. We demonstrate the efficiency of our method by entirely meshing a dataset of 60 cerebral vascular networks. 92% of the vessels and 83% of the bifurcations were meshed without defects needing manual intervention, despite the challenging aspect of the input data. The source code is released publicly

    Theory and applications of bijective barycentric mappings

    Get PDF
    Barycentric coordinates provide a convenient way to represent a point inside a triangle as a convex combination of the triangle's vertices, and to linearly interpolate data given at these vertices. Due to their favourable properties, they are commonly applied in geometric modelling, finite element methods, computer graphics, and many other fields. In some of these applications it is desirable to extend the concept of barycentric coordinates from triangles to polygons. Several variants of such generalized barycentric coordinates have been proposed in recent years. An important application of barycentric coordinates consists of barycentric mappings, which allow to naturally warp a source polygon to a corresponding target polygon, or more generally, to create mappings between closed curves or polyhedra. The principal practical application is image warping, which takes as input a control polygon drawn around an image and smoothly warps the image by moving the polygon vertices. A required property of image warping is to avoid fold-overs in the resulting image. The problem of fold-overs is a manifestation of a larger problem related to the lack of bijectivity of the barycentric mapping. Unfortunately, bijectivity of such barycentric mappings can only be guaranteed for the special case of warping between convex polygons or by triangulating the domain and hence renouncing smoothness. In fact, for any barycentric coordinates, it is always possible to construct a pair of polygons such that the barycentric mapping is not bijective. In the first part of this thesis we illustrate three methods to achieve bijective mappings. The first method is based on the intuition that, if two polygons are sufficiently close, then the mapping is close to the identity and hence bijective. This suggests to ``split'' the mapping into several intermediate mappings and to create a composite barycentric mapping which is guaranteed to be bijective between arbitrary polygons, polyhedra, or closed planar curves. We provide theoretical bounds on the bijectivity of the composite mapping related to the norm of the gradient of the coordinates. The fact that the bound depends on the gradient implies that these bounds exist only if the gradient of the coordinates is bounded. We focus on mean value coordinates and analyse the behaviour of their directional derivatives and gradient at the vertices of a polygon. The composition of barycentric mappings for closed planar curves leads to the problem of blending between two planar curves. We suggest to solve it by linearly interpolating the signed curvature and then reconstructing the intermediate curve from the interpolated curvature values. However, when both input curves are closed, this strategy can lead to open intermediate curves. We present a new algorithm for solving this problem, which finds the closed curve whose curvature is closest to the interpolated values. Our method relies on the definition of a suitable metric for measuring the distance between two planar curves and an appropriate discretization of the signed curvature functions. The second method to construct smooth bijective mappings with prescribed behaviour along the domain boundary exploits the properties of harmonic maps. These maps can be approximated in different ways, and we discuss their respective advantages and disadvantages. We further present a simple procedure for reducing their distortion and demonstrate the effectiveness of our approach by providing examples. The last method relies on a reformulation of complex barycentric mappings, which allows us to modify the ``speed'' along the edges to create complex bijective mappings. We provide some initial results and an optimization procedure which creates complex bijective maps. In the second part we provide two main applications of bijective mapping. The first one is in the context of finite elements simulations, where the discretization of the computational domain plays a central role. In the standard discretization, the domain is triangulated with a mesh and its boundary is approximated by a polygon. We present an approach which combines parametric finite elements with smooth bijective mappings, leaving the choice of approximation spaces free. This approach allows to represent arbitrarily complex geometries on coarse meshes with curved edges, regardless of the domain boundary complexity. The main idea is to use a bijective mapping for automatically warping the volume of a simple parametrization domain to the complex computational domain, thus creating a curved mesh of the latter. The second application addresses the meshing problem and the possibility to solve finite element simulations on polygonal meshes. In this context we present several methods to discretize the bijective mapping to create polygonal and piece-wise polynomial meshes

    Conceptual free-form styling in virtual environments

    Get PDF
    This dissertation introduces the tools for designing complete models from scratch directly in a head-tracked, table-like virtual work environment. The models consist of free-form surfaces, and are constructed by drawing a network of curves directly in space. This is accomplished by using a tracked pen-like input device. Interactive deformation tools for curves and surfaces are proposed and are based on variational methods. By aligning the model with the left hand, editing is made possible with the right hand, corresponding to a natural distribution of tasks using both hands. Furthermore, in the emerging field of 3D interaction in virtual environments, particularly with regard to system control, this work uses novel methods to integrate system control tasks, such as selecting tools, and workflow of shape design. The aim of this work is to propose more suitable user interfaces to computersupported conceptual shape design applications. This would be beneficial since it is a field that lacks adequate support from standard desktop systems.Diese Dissertation beschreibtWerkzeuge zum Entwurf kompletter virtueller Modelle von Grund auf. Dies geschieht direkt in einer tischartigen, virtuellen Arbeitsumge-bung mit Hilfe von Tracking der HĂ€nde und der Kopfposition. Die Modelle sind aus FreiformlĂ€chen aufgebaut und werden als Netz von Kurven mit Hilfe eines getrack-ten, stiftartigen EingabegerĂ€tes direkt im Raum gezeichnet. Es werden interaktive Deformationswerkzeuge fĂŒr Kurven und FlĂ€chen vorgestellt, die auf Methoden des Variational Modeling basieren. Durch das Ausrichten des Modells mit der linken Hand wird das Editieren mit der rechten Hand erleichtert. Dies entspricht einer natĂŒrlichen Aufteilung von Aufgaben auf beide HĂ€nde. ZusĂ€tzlich stellt diese Arbeit neue Techniken fĂŒr die 3D-Interaktion in virtuellen Umgebungen, insbesondere im Bereich Anwendungskontrolle, vor, die die Aufgabe der Werkzeugauswahl in den Arbeitsablauf der Formgestaltung integrieren. Das Ziel dieser Arbeit ist es, besser geeignete Schnittstellen fĂŒr den computer-unterstĂŒtzten, konzeptionellen Formentwurf zur VerfĂŒgung zu stellen; ein Gebiet, fĂŒr das Standard-Desktop-Systeme wenig geeignete UnterstĂŒtzung bieten

    Numerical Methods in Shape Spaces and Optimal Branching Patterns

    Get PDF
    The contribution of this thesis is twofold. The main part deals with numerical methods in the context of shape space analysis, where the shape space at hand is considered as a Riemannian manifold. In detail, we apply and extend the time-discrete geodesic calculus (established by Rumpf and Wirth [WBRS11, RW15]) to the space of discrete shells, i.e. triangular meshes with fixed connectivity. The essential building block is a variational time-discretization of geodesic curves, which is based on a local approximation of the squared Riemannian distance on the manifold. On physical shape spaces this approximation can be derived e.g. from a dissimilarity measure. The dissimilarity measure between two shell surfaces can naturally be defined as an elastic deformation energy capturing both membrane and bending distortions. Combined with a non-conforming discretization of a physically sound thin shell model the time-discrete geodesic calculus applied to the space of discrete shells is shown to be suitable to solve important problems in computer graphics and animation. To extend the existing calculus, we introduce a generalized spline functional based on the covariant derivative along a curve in shape space whose minimizers can be considered as Riemannian splines. We establish a corresponding time-discrete functional that fits perfectly into the framework of Rumpf and Wirth, and prove this discretization to be consistent. Several numerical simulations reveal that the optimization of the spline functional—subject to appropriate constraints—can be used to solve the multiple interpolation problem in shape space, e.g. to realize keyframe animation. Based on the spline functional, we further develop a simple regression model which generalizes linear regression to nonlinear shape spaces. Numerical examples based on real data from anatomy and botany show the capability of the model. Finally, we apply the statistical analysis of elastic shape spaces presented by Rumpf and Wirth [RW09, RW11] to the space of discrete shells. To this end, we compute a FrĂ©chet mean within a class of shapes bearing highly nonlinear variations and perform a principal component analysis with respect to the metric induced by the Hessian of an elastic shell energy. The last part of this thesis deals with the optimization of microstructures arising e.g. at austenite-martensite interfaces in shape memory alloys. For a corresponding scalar problem, Kohn and MĂŒller [KM92, KM94] proved existence of a minimizer and provided a lower and an upper bound for the optimal energy. To establish the upper bound, they studied a particular branching pattern generated by mixing two different martensite phases. We perform a finite element simulation based on subdivision surfaces that suggests a topologically different class of branching patterns to represent an optimal microstructure. Based on these observations we derive a novel, low dimensional family of patterns and show—numerically and analytically—that our new branching pattern results in a significantly better upper energy bound
    • 

    corecore