A peridynamic theory for linear elastic shells

A state-based peridynamic formulation for linear elastic shells is presented. The emphasis is on introducing, possibly for the first time, a general surface based peridynamic model to represent the deformation characteristics of structures that have one physical dimension much smaller than the other two. A new notion of curved bonds is exploited to cater for force transfer between the peridynamic particles describing the shell. Starting with the three dimensional force and deformation states, appropriate surface based force, moment and several deformation states are arrived at. Upon application on the curved bonds, such states beget the necessary force and deformation vectors governing the motion of the shell. Correctness of our proposal on the peridynamic shell theory is numerically assessed against static deformation of spherical and cylindrical shells and flat plates

Discontinuities and collision of gravitational waves in string theory

We examine here discontinuities in the metric, the antisymmetric tensor and the dilaton field which are allowed by conformal invariance. We find that the surfaces of discontinuity must necessarily be null surfaces and shock and impulsive waves are both allowed. We employ our results for the case of colliding plane gravitational waves and we discuss the SL(2,R)XSU(2)/RXR WZW model in the present prespective. In particular, the singularities encountered in this model may be viewed as the result of the mutual focusing of the colliding waves.Comment: 15 pages, Late

Minimal-area metrics on the Swiss cross and punctured torus

The closed string field theory minimal-area problem asks for the conformal metric of least area on a Riemann surface with the condition that all non-contractible closed curves have length at least 2\pi. Through every point in such a metric there is a geodesic that saturates the length condition, and saturating geodesics in a given homotopy class form a band. The extremal metric is unknown when bands of geodesics cross, as it happens for surfaces of non-zero genus. We use recently proposed convex programs to numerically find the minimal-area metric on the square torus with a square boundary, for various sizes of the boundary. For large enough boundary the problem is equivalent to the "Swiss cross" challenge posed by Strebel. We find that the metric is positively curved in the two-band region and flat in the single-band regions. For small boundary the metric develops a third band of geodesics wrapping around it, and has both regions of positive and negative curvature. This surface can be completed to provide the minimal-area metric on a once-punctured torus, representing a closed-string tadpole diagram.Comment: 59 pages, 41 figures. v2: Minor edits and reference update

Part Description and Segmentation Using Contour, Surface and Volumetric Primitives

The problem of part definition, description, and decomposition is central to the shape recognition systems. The Ultimate goal of segmenting range images into meaningful parts and objects has proved to be very difficult to realize, mainly due to the isolation of the segmentation problem from the issue of representation. We propose a paradigm for part description and segmentation by integration of contour, surface, and volumetric primitives. Unlike previous approaches, we have used geometric properties derived from both boundary-based (surface contours and occluding contours), and primitive-based (quadric patches and superquadric models) representations to define and recover part-whole relationships, without a priori knowledge about the objects or object domain. The object shape is described at three levels of complexity, each contributing to the overall shape. Our approach can be summarized as answering the following question : Given that we have all three different modules for extracting volume, surface and boundary properties, how should they be invoked, evaluated and integrated? Volume and boundary fitting, and surface description are performed in parallel to incorporate the best of the coarse to fine and fine to coarse segmentation strategy. The process involves feedback between the segmentor (the Control Module) and individual shape description modules. The control module evaluates the intermediate descriptions and formulates hypotheses about parts. Hypotheses are further tested by the segmentor and the descriptors. The descriptions thus obtained are independent of position, orientation, scale, domain and domain properties, and are based purely on geometric considerations. They are extremely useful for the high level domain dependent symbolic reasoning processes, which need not deal with tremendous amount of data, but only with a rich description of data in terms of primitives recovered at various levels of complexity

A F.E. UPPER BOUND LIMIT ANALYSIS MODEL FOR MASONRY CURVED AND 3D STRUCTURES, WITH AND WITHOUT FRPREINFORCEMENT

The aim of this thesis is to propose a new efficient numerical tool, based on the kinematic theorem of limit analysis, for the study of masonry shell and 3D structures with or without FRP reinforcement. The approach consists of two steps. In step I unreinforced masonry strength domains are obtained with a FE limit analysis procedure applied to a representative element of volume constituted by a central brick interacting with its six neighbours by means of rigid plastic interfaces (mortar joint). In step II, the unreinforced strength domains are implemented in a novel upper bound FE limit analysis code for the analysis at collapse of entire masonry curved and 3D structures

Surface and Volumetric Segmentation of Complex 3-D Objects Using Parametric Shape Models

The problem of part definition, description, and decomposition is central to the shape recognition systems. In this dissertation, we develop an integrated framework for segmenting dense range data of complex 3-D scenes into their constituent parts in terms of surface and volumetric primitives. Unlike previous approaches, we use geometric properties derived from surface, as well as volumetric models, to recover structured descriptions of complex objects without a priori domain knowledge or stored models. To recover shape descriptions, we use bi-quadric models for surface representation and superquadric models for object-centered volumetric representation. The surface segmentation uses a novel approach of searching for the best piecewise description of the image in terms of bi-quadric (z = f(x,y)) models. It is used to generate the region adjacency graphs, to localize surface discontinuities, and to derive global shape properties of the surfaces. A superquadric model is recovered for the entire data set and residuals are computed to evaluate the fit. The goodness-of-fit value based on the inside-outside function, and the mean-squared distance of data from the model provide quantitative evaluation of the model. The qualitative evaluation criteria check the local consistency of the model in the form of residual maps of overestimated and underestimated data regions. The control structure invokes the models in a systematic manner, evaluates the intermediate descriptions, and integrates them to achieve final segmentation. Superquadric and bi-quadric models are recovered in parallel to incorporate the best of the coarse-to-fine and fine-to-coarse segmentation strategies. The model evaluation criteria determine the dimensionality of the scene, and decide whether to terminate the procedure, or selectively refine the segmentation by following a global-to-local part segmentation approach. The control module generates hypotheses about superquadric models at clusters of underestimated data and performs controlled extrapolation of the part-model by shrinking the global model. As the global model shrinks and the local models grow, they are evaluated and tested for termination or further segmentation. We present results on real range images of scenes of varying complexity, including objects with occluding parts, and scenes where surface segmentation is not sufficient to guide the volumetric segmentation. We analyze the issue of segmentation of complex scenes thoroughly by studying the effect of missing data on volumetric model recovery, generating object-centered descriptions, and presenting a complete set of criteria for the evaluation of the superquadric models. We conclude by discussing the applications of our approach in data reduction, 3-D object recognition, geometric modeling, automatic model generation. object manipulation, and active vision

Non-smooth developable geometry for interactively animating paper crumpling

International audienceWe present the first method to animate sheets of paper at interactive rates, while automatically generating a plausible set of sharp features when the sheet is crumpled. The key idea is to interleave standard physically-based simulation steps with procedural generation of a piecewise continuous developable surface. The resulting hybrid surface model captures new singular points dynamically appearing during the crumpling process, mimicking the effect of paper fiber fracture. Although the model evolves over time to take these irreversible damages into account, the mesh used for simulation is kept coarse throughout the animation, leading to efficient computations. Meanwhile, the geometric layer ensures that the surface stays almost isometric to its original 2D pattern. We validate our model through measurements and visual comparison with real paper manipulation, and show results on a variety of crumpled paper configurations

New constraints on data-closeness and needle map consistency for shape-from-shading

This paper makes two contributions to the problem of needle-map recovery using shape-from-shading. First, we provide a geometric update procedure which allows the image irradiance equation to be satisfied as a hard constraint. This not only improves the data closeness of the recovered needle-map, but also removes the necessity for extensive parameter tuning. Second, we exploit the improved ease of control of the new shape-from-shading process to investigate various types of needle-map consistency constraint. The first set of constraints are based on needle-map smoothness. The second avenue of investigation is to use curvature information to impose topographic constraints. Third, we explore ways in which the needle-map is recovered so as to be consistent with the image gradient field. In each case we explore a variety of robust error measures and consistency weighting schemes that can be used to impose the desired constraints on the recovered needle-map. We provide an experimental assessment of the new shape-from-shading framework on both real world images and synthetic images with known ground truth surface normals. The main conclusion drawn from our analysis is that the data-closeness constraint improves the efficiency of shape-from-shading and that both the topographic and gradient consistency constraints improve the fidelity of the recovered needle-map