The extrusion of section from round billet poses a great challenge for theoretical modeling of the process using upper bound method. The greatest difficulty in three-dimensional upper bound method is to determine kinematically admissible velocity field. The SERR (Spatial Elementary Rigid Region) technique is fairly applicable for analyzing extrusion of sections having re-entrant corners. A modi...

A deflated polygon is a polygon with no visibility crossings. We answer a question posed by Devadoss et al. () by presenting a polygon that cannot be deformed via continuous visibility-decreasing motion into a deflated polygon. We show that the least n for which there exists such an n-gon is seven. In order to demonstrate non-deflatability, we use a new combinatorial structure for polygons,...

An algorithm is presented for computing geodesic furthest neighbors for all the vertices of a simple polygon, where geodesic denotes the fact that distance between two points of the polygon is defined as the length of an Euclidean shortest path connecting them within the polygon. The algorithm runs in O(n log n) time and uses O(n) space; n being the number of vertices of the polygon. As a corol...