Vibration of symmetrically laminated thick super elliptical plates

This paper reports a free vibration analysis of thick plates with rounded corners subject to a free, simply-supported or clamped boundary condition. The plate perimeter is defined by a super elliptic function with a power defining the shape ranging from an ellipse to a rectangle. To incorporate transverse shear deformation, the Reddy third-order plate theory is employed. The energy integrals incorporating shear deformation and rotary inertia are formulated and the p-Ritz procedures are used to derive the governing eigenvalue equation. Numerical examples for plates with different shapes and boundary conditions are solved and their frequency parameters, where possible, are compared with known results. Parametric studies are carried out to show the sensitivities of frequency parameters by varying the geometry, fibre stacking sequence, and boundary condition. (C) 1999 Academic Press.

Expansion-based algorithms for finding single pair shortest path on surface

Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path planning system, and surface nearest neighbor query in spatial database, etc. Currently, to solve the problem, existing algorithms must traverse the entire polyhedral surface. With the rapid advance in areas like Global Positioning System (CPS), Computer Aided Design (CAD) systems and laser range scanner, surface models axe becoming more and more complex. It is not uncommon that a surface model contains millions of polygons. The single pair shortest path problem is getting harder and harder to solve. Based on the observation that the single pair shortest path is in the locality, we propose in this paper efficient methods by excluding part of the surface model without considering them in the search process. Three novel expansion-based algorithms are proposed, namely, Naive algorithm, Rectangle-based Algorithm and Ellipse-based Algorithm. Each algorithm uses a two-step approach to find the shortest path. (1) compute an initial local path. (2) use the value of this initial path to select a search region, in which the global shortest path exists. The search process terminates once the global optimum criteria are satisfied. By reducing the searching region, the performance is improved dramatically in most cases.