The Correlation framework: bridging the gap between modeling and analysis for 3D woven composites

International audienceA large variety of dierent descriptors can be employed for describing 3D woven composites. Each of them is targeted to a specic application, ranging from design, weaving, molding, impregnation down to non-destructive testing, imaging and numerical modeling of the actual micro-structure. In order to relate these dierent representations, it is proposed herewith to rely on the inherent weaving pattern as an intrinsic common feature, and to resort to images as a common language to guaranty the continuity of information. To connect these 3D images (either real or synthesized), Digital Volume Correlation (DVC) is called for in order to exploit the conservation of topology. A complete test scenario is devised in which dierent manufactured woven samples are compared to the theoretical textile arrangement. The results conrm the eectiveness of the method

The State-of-the-Art of Set Visualization

Sets comprise a generic data model that has been used in a variety of data analysis problems. Such problems involve analysing and visualizing set relations between multiple sets defined over the same collection of elements. However, visualizing sets is a non-trivial problem due to the large number of possible relations between them. We provide a systematic overview of state-of-the-art techniques for visualizing different kinds of set relations. We classify these techniques into six main categories according to the visual representations they use and the tasks they support. We compare the categories to provide guidance for choosing an appropriate technique for a given problem. Finally, we identify challenges in this area that need further research and propose possible directions to address these challenges. Further resources on set visualization are available at http://www.setviz.net

Multi-scale modelling of strongly heterogeneous 3D composite structures using spatial Voronoi tessellation

Abstract3D composite materials are characterized by complex internal yarn architectures, leading to complex deformation and failure development mechanisms. Net-shaped preforms, which are originally periodic in nature, lose their periodicity when the fabric is draped, deformed on a tool, and consolidated to create geometrically complex composite components. As a result, the internal yarn architecture, which dominates the mechanical behaviour, becomes dependent on the structural geometry. Hence, predicting the mechanical behaviour of 3D composites requires an accurate representation of the yarn architecture within structural scale models. When applied to 3D composites, conventional finite element modelling techniques are limited to either homogenised properties at the structural scale, or the unit cell scale for a more detailed material property definition. Consequently, these models fail to capture the complex phenomena occurring across multiple length scales and their effects on a 3D composite’s mechanical response. Here a multi-scale modelling approach based on a 3D spatial Voronoi tessellation is proposed. The model creates an intermediate length scale suitable for homogenisation to deal with the non-periodic nature of the final material. Information is passed between the different length scales to allow for the effect of the structural geometry to be taken into account on the smaller scales. The stiffness and surface strain predictions from the proposed model have been found to be in good agreement with experimental results.The proposed modelling framework has been used to gain important insight into the behaviour of this category of materials. It has been observed that the strain and stress distributions are strongly dependent on the internal yarn architecture and consequently on the final component geometry. Even for simple coupon tests, the internal architecture and geometric effects dominate the mechanical response. Consequently, the behaviour of 3D woven composites should be considered to be a structure specific response rather than generic homogenised material properties

Analysis of textile impressions from pottery of the Selkirk composite

The boreal forest regions of Saskatchewan and Manitoba are characterized by Late Woodland period archaeological assemblages. Although the pottery associated with these assemblages exhibit textile impressed exteriors, little is known about the associated textile industry. In part, this is due to the lack of archaeological textiles. In order to describe the textile structures employed by these people, it is necessary to study their textile-impressed pottery. Two complexes within the Selkirk Composite, Pehonan/Keskatchewan and Kame Hills are known through several intensively excavated sites and a large number of pottery recoveries. Using textile attribute studies, data on 47 impressed vessels from 17 sites were collected. Supplemented by ethnographic and historical reports from neighbouring regions, textile structures are identified for both complexes. The most represented textile structure is twining. These identified structures verify the homogeneity of the Selkirk Composite. There are enough structural variations, however, to support the regional expressions of each complex. The impressed textiles are utilitarian in nature and played an integral part in pottery manufacture. Selkirk potters were expert craftpersons. This is reflected in their pottery and in the way they employed the textiles. Although the analysis is limited to textiles used in pottery construction, cursory textile comparisons indicate the Selkirk textiles have more similarity to those produced historically by Algonquians to the south

Proposal Flow: Semantic Correspondences from Object Proposals

Finding image correspondences remains a challenging problem in the presence of intra-class variations and large changes in scene layout. Semantic flow methods are designed to handle images depicting different instances of the same object or scene category. We introduce a novel approach to semantic flow, dubbed proposal flow, that establishes reliable correspondences using object proposals. Unlike prevailing semantic flow approaches that operate on pixels or regularly sampled local regions, proposal flow benefits from the characteristics of modern object proposals, that exhibit high repeatability at multiple scales, and can take advantage of both local and geometric consistency constraints among proposals. We also show that the corresponding sparse proposal flow can effectively be transformed into a conventional dense flow field. We introduce two new challenging datasets that can be used to evaluate both general semantic flow techniques and region-based approaches such as proposal flow. We use these benchmarks to compare different matching algorithms, object proposals, and region features within proposal flow, to the state of the art in semantic flow. This comparison, along with experiments on standard datasets, demonstrates that proposal flow significantly outperforms existing semantic flow methods in various settings.Comment: arXiv admin note: text overlap with arXiv:1511.0506

Drawing graphs for cartographic applications

Graph Drawing is a relatively young area that combines elements of graph theory, algorithms, (computational) geometry and (computational) topology. Research in this field concentrates on developing algorithms for drawing graphs while satisfying certain aesthetic criteria. These criteria are often expressed in properties like edge complexity, number of edge crossings, angular resolutions, shapes of faces or graph symmetries and in general aim at creating a drawing of a graph that conveys the information to the reader in the best possible way. Graph drawing has applications in a wide variety of areas which include cartography, VLSI design and information visualization. In this thesis we consider several graph drawing problems. The first problem we address is rectilinear cartogram construction. A cartogram, also known as value-by-area map, is a technique used by cartographers to visualize statistical data over a set of geographical regions like countries, states or counties. The regions of a cartogram are deformed such that the area of a region corresponds to a particular geographic variable. The shapes of the regions depend on the type of cartogram. We consider rectilinear cartograms of constant complexity, that is cartograms where each region is a rectilinear polygon with a constant number of vertices. Whether a cartogram is good is determined by how closely the cartogram resembles the original map and how precisely the area of its regions describe the associated values. The cartographic error is defined for each region as jAc¡Asj=As, where Ac is the area of the region in the cartogram and As is the specified area of that region, given by the geographic variable to be shown. In this thesis we consider the construction of rectilinear cartograms that have correct adjacencies of the regions and zero cartographic error. We show that any plane triangulated graph admits a rectilinear cartogram where every region has at most 40 vertices which can be constructed in O(nlogn) time. We also present experimental results that show that in practice the algorithm works significantly better than suggested by the complexity bounds. In our experiments on real-world data we were always able to construct a cartogram where the average number of vertices per region does not exceed five. Since a rectangle has four vertices, this means that most of the regions of our rectilinear car tograms are in fact rectangles. Moreover, the maximum number vertices of each region in these cartograms never exceeded ten. The second problem we address in this thesis concerns cased drawings of graphs. The vertices of a drawing are commonly marked with a disk, but differentiating between vertices and edge crossings in a dense graph can still be difficult. Edge casing is a wellknown method—used, for example, in electrical drawings, when depicting knots, and, more generally, in information visualization—to alleviate this problem and to improve the readability of a drawing. A cased drawing orders the edges of each crossing and interrupts the lower edge in an appropriate neighborhood of the crossing. One can also envision that every edge is encased in a strip of the background color and that the casing of the upper edge covers the lower edge at the crossing. If there are no application-specific restrictions that dictate the order of the edges at each crossing, then we can in principle choose freely how to arrange them. However, certain orders will lead to a more readable drawing than others. In this thesis we formulate aesthetic criteria for a cased drawing as optimization problems and solve these problems. For most of the problems we present either a polynomial time algorithm or demonstrate that the problem is NP-hard. Finally we consider a combinatorial question in computational topology concerning three types of objects: closed curves in the plane, surfaces immersed in the plane, and surfaces embedded in space. In particular, we study casings of closed curves in the plane to decide whether these curves can be embedded as the boundaries of certain special surfaces. We show that it is NP-complete to determine whether an immersed disk is the projection of a surface embedded in space, or whether a curve is the boundary of an immersed surface in the plane that is not constrained to be a disk. However, when a casing is supplied with a self-intersecting curve, describing which component of the curve lies above and which below at each crossing, we can determine in time linear in the number of crossings whether the cased curve forms the projected boundary of a surface in space. As a related result, we show that an immersed surface with a single boundary curve that crosses itself n times has at most 2n=2 combinatorially distinct spatial embeddings and we discuss the existence of fixed-parameter tractable algorithms for related problems