Search

The paper proposes a method to solve geometrically nonlinear bending problems for thin orthotropic shallow shells and plates interacting with a Winkler-Pasternak foundation under transverse loading. This method is based on Ritz's variational method and the R-function method. The developed algorithm and software are used to solve a number of test problems and to study complex-shaped shells. The effect of the shape of shells, the boundary conditions, the stiffness of the foundation, and the load distribution on the behavior of isotropic and orthotropic shells undergoing geometrically nonlinear bending is studied [ABSTRACT FROM AUTHOR]

Abstract: Shape skeletons are fundamental concepts for describing the shape of geometric objects, and have found a variety of applications in a number of areas where geometry plays an important role. Two types of skeletons commonly used in geometric computations are the straight skeleton of a (linear) polygon, and the medial axis of a bounded set of points in the -dimensional Euclidean space. However, exact computation of these skeletons of even fairly simple planar shapes remains an open problem. In this paper we propose a novel approach to construct exact or approximate (continuous) distance functions and the associated skeletal representations (a skeleton and the corresponding radius function) for solid 2D semi-analytic sets that can be either rigid or undergoing topological deformations. Our approach relies on computing constructive representations of shapes with R-functions that operate on real-valued halfspaces as logic operations. We use our approximate distance functions to define a new type of skeleton, i.e, the C-skeleton, which is piecewise linear for polygonal domains, generalizes naturally to planar and spatial domains with curved boundaries, and has attractive properties. We also show that the exact distance functions allow us to compute the medial axis of any closed, bounded and regular planar domain. Importantly, our approach can generate the medial axis, the straight skeleton, and the C-skeleton of possibly deformable shapes within the same formulation, extends naturally to 3D, and can be used in a variety of applications such as skeleton-based shape editing and adaptive motion planning. [Copyright &y& Elsevier]

Normalized equations for regular no-gons translated nd times in a regular nb-gon are set up based on coordinate transformations that allow translating geometric objects on segments. Such approaches are especially important in solving automation problems in solid modeling, geometric design, and boundary-value problems of mathematical physics. [ABSTRACT FROM AUTHOR]

We present a new and efficient algorithm to accurately polygonize an implicit surface generated by multiple Boolean operations with globally deformed primitives. Our algorithm is special in the sense that it can be applied to objects with both an implicit and a parametric representation, such as superquadrics, supershapes, and Dupin cyclides. The input is a Constructive Solid Geometry tree (CSG tree) that contains the Boolean operations, the parameters of the primitives, and the global deformations. At each node of the CSG tree, the implicit formulations of the subtrees are used to quickly determine the parts to be transmitted to the parent node, while the primitives' parametric definition are used to refine an intermediary mesh around the intersection curves. The output is both an implicit equation and a mesh representing its solution. For the resulting object, an implicit equation with guaranteed differential properties is obtained by simple combinations of the primitives' implicit equations using R-functions. Depending on the chosen R-function, this equation is continuous and can be differentiable everywhere. The primitives' parametric representations are used to directly polygonize the resulting surface by generating vertices that belong exactly to the zero-set of the resulting implicit equation. The proposed approach has many potential applications, ranging from mechanical engineering to shape recognition and data compression. Examples of complex objects are presented and commented on to show the potential of our approach for shape modeling. [ABSTRACT FROM AUTHOR]