Computing a Compact Spline Representation of the Medial Axis Transform of a 2D Shape

We present a full pipeline for computing the medial axis transform of an arbitrary 2D shape. The instability of the medial axis transform is overcome by a pruning algorithm guided by a user-defined Hausdorff distance threshold. The stable medial axis transform is then approximated by spline curves in 3D to produce a smooth and compact representation. These spline curves are computed by minimizing the approximation error between the input shape and the shape represented by the medial axis transform. Our results on various 2D shapes suggest that our method is practical and effective, and yields faithful and compact representations of medial axis transforms of 2D shapes.Comment: GMP14 (Geometric Modeling and Processing

Application of quasi-homogeneous anisotropic laminates in grid-stiffened panel design

Composite laminates are derived for standard configurations with quasi-homogeneous anisotropic properties, whereby in-plane and out-of-plane stiffness properties are concomitant. Dimensionless parameters, and their relationship to the well-known ply- orientation-dependent lamination parameters, are also developed from which the elements of the extensional and bending stiffness matrices are readily calculated for any fiber/resin properties. The definitive list of laminate configurations for up to 21 plies is presented, together with graphical representations of the lamination parameter design space for standard ply orientations +45, -45, 0 and 90 degrees. Finally, the potential of quasi-homogeneous anisotropic laminates as an optimum design solution for anisogid structures is explored for cases where buckling and strength constraints are both active

Ordered Statistics Vertex Extraction and Tracing Algorithm (OSVETA)

We propose an algorithm for identifying vertices from three dimensional (3D) meshes that are most important for a geometric shape creation. Extracting such a set of vertices from a 3D mesh is important in applications such as digital watermarking, but also as a component of optimization and triangulation. In the first step, the Ordered Statistics Vertex Extraction and Tracing Algorithm (OSVETA) estimates precisely the local curvature, and most important topological features of mesh geometry. Using the vertex geometric importance ranking, the algorithm traces and extracts a vector of vertices, ordered by decreasing index of importance.Comment: Accepted for publishing and Copyright transfered to Advances in Electrical and Computer Engineering, November 23th 201

Thermal inertia of hollow wall blocks: actual behavior and myths

In the context of growing requirements to save energy in buildings and high objectives for Net Zero Energy Buildings (NZEBs) in Europe, strong emphasis is placed on the thermal performance of building envelopes, and in particular on thermal inertia to save cooling energy. High thermal inertia of outer walls leads to a mitigation of the daily heat wave, reducing cooling peak load and energy demand. Moreover, building envelopes with high heat capacity act as heat storages, increasing the effectiveness of natural ventilation for thermal comfort through a night-day energy shifting. Even though there are some papers available in the open literature on dynamic heat transfer through hollow bricks, yet common calculation methods are applicable to homogeneous layers only. That is the case of ISO 13786 regulation "Thermal performance of building components - Dynamic thermal characteristics - Calculation methods", for example. On the other hand, hollow blocks are very commonly used in building envelopes. Thus, available methods are not suitable for prediction of dynamic thermal performances. On the other hand, the widely common assumption that high mass means high thermal inertia leads to the use of higher mass blocks or bricks. Yet, numerical and experimental studies on thermal inertia of hollow envelope-components have not confirmed this general assumption, even though no systematic analysis has been found in the open literature. In this framework, numerical simulations of the thermal performance of hollow bricks have been done with a specifically-developed finite-difference computational code. Three common basic shapes with different void fraction and thermal properties have been analyzed with a triangular pulse solicitation, in order to highlight the relevance of front mass and other parameters on the thermal inertia, measured through heat wave delay. Results show that wall front mass is often misleading as thickness, number of cavities and clay thermal diffusivity are more important

New indication for a dichotomy in the interior structure of Uranus and Neptune from the application of modified shape and rotation data

Since the Voyager fly-bys of Uranus and Neptune, improved gravity field data have been derived from long-term observations of the planets' satellite motions, and modified shape and solid-body rotation periods were suggested. A faster rotation period (-40 min) for Uranus and a slower rotation period (+1h20) of Neptune compared to the Voyager data were found to minimize the dynamical heights and wind speeds. We apply the improved gravity data, the modified shape and rotation data, and the physical LM-R equation of state to compute adiabatic three-layer structure models, where rocks are confined to the core, and homogeneous thermal evolution models of Uranus and Neptune. We present the full range of structure models for both the Voyager and the modified shape and rotation data. In contrast to previous studies based solely on the Voyager data or on empirical EOS, we find that Uranus and Neptune may differ to an observationally significant level in their atmospheric heavy element mass fraction Z1 and nondimensional moment of inertia, nI. For Uranus, we find Z1 < 8% and nI=0.2224(1), while for Neptune Z1 < 65% and nI=0.2555(2) when applying the modified shape and rotation data, while for the unmodified data we compute Z1 < 17% and nI=0.230(1) for Uranus and Z1 < 54% and nI=0.2410(8) for Neptune. In each of these cases, solar metallicity models (Z1=0.015) are still possible. The cooling times obtained for each planet are similar to recent calculations with the Voyager rotation periods: Neptune's luminosity can be explained by assuming an adiabatic interior while Uranus cools far too slowly. More accurate determinations of these planets' gravity fields, shapes, rotation periods, atmospheric heavy element abundances, and intrinsic luminosities are essential for improving our understanding of the internal structure and evolution of icy planets.Comment: accepted to Planet. Space Sci., special editio

Methods and Procedures

published or submitted for publicatio

Hierarchical morphological segmentation for image sequence coding

This paper deals with a hierarchical morphological segmentation algorithm for image sequence coding. Mathematical morphology is very attractive for this purpose because it efficiently deals with geometrical features such as size, shape, contrast, or connectivity that can be considered as segmentation-oriented features. The algorithm follows a top-down procedure. It first takes into account the global information and produces a coarse segmentation, that is, with a small number of regions. Then, the segmentation quality is improved by introducing regions corresponding to more local information. The algorithm, considering sequences as being functions on a 3-D space, directly segments 3-D regions. A 3-D approach is used to get a segmentation that is stable in time and to directly solve the region correspondence problem. Each segmentation stage relies on four basic steps: simplification, marker extraction, decision, and quality estimation. The simplification removes information from the sequence to make it easier to segment. Morphological filters based on partial reconstruction are proven to be very efficient for this purpose, especially in the case of sequences. The marker extraction identifies the presence of homogeneous 3-D regions. It is based on constrained flat region labeling and morphological contrast extraction. The goal of the decision is to precisely locate the contours of regions detected by the marker extraction. This decision is performed by a modified watershed algorithm. Finally, the quality estimation concentrates on the coding residue, all the information about the 3-D regions that have not been properly segmented and therefore coded. The procedure allows the introduction of the texture and contour coding schemes within the segmentation algorithm. The coding residue is transmitted to the next segmentation stage to improve the segmentation and coding quality. Finally, segmentation and coding examples are presented to show the validity and interest of the coding approach.Peer ReviewedPostprint (published version