A survey of techniques for solving geometric problems in parallel is given, both for shared memory parallel machines and for networks of processors. Open problems are also discussed, as well a s directions for future research. 'This work was supported by the office oi Naval Research under Contracts N00014-84-K-0502 and N00014-86-K-0689, the Air Force Office of Scientific Research under Grant AF...

Zuni´c. On the maximal number of edges of convex digital polygons included into a square grid. A simplex variant solving an m ×d linear program in O (min(m 2 , d 2)) expected number of pivot steps. A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension. 12 P. K. Agarwal. A deterministic algorithm for partitioning arrangements of lin...

Many problems in document image analysis can be couched in geometric terms. We outline recent advances in computational geometry that contribute to many aspects of the document analysis process and we provide pointers to a selection of the computational geometry literature where the most relevant results can be found.

Let E(k, l) denote the smallest integer such that any set of at least E(k, l) points in the plane, no three on a line, contains either an empty convex polygon with k vertices or an empty pseudo-triangle with l vertices. The existence of E(k, l) for positive integers k, l ≥ 3, is the consequence of a result proved by Valtr [Discrete and Computational Geometry, Vol. 37, 565–576, 2007]. In this pa...

in this article, stress analysis and energy estimation during cold-roll forming of symmetrical channel sections have been discussed. geometry of sheet strip is pre-estimated by a shape function. then longitudinal, transversal and shear strains have been calculated. using both the levy-mises and the prandtl reuss equations, and also considering the bauschinger effect, stress distributions have b...

This thesis presents a new class of surface patches for the creation of sculptured surfaces in mechanical engineering applications of computer aided design. Ideas from differential geometry are used to create principal patches whose edges are lines of curvature. This is done by ensuring that the sides obey two equations called the frame matching and position matching conditions. It is shown tha...

In this paper we describe some problems arising in practical implementation of algorithms from computational geometry. Going to robust algorithms needs to solve issues such as rounding errors and degeneracies. Most of the problems are closely related to the incompatibility between on one side algorithms designed for continuous data and on the other side the discrete nature of the data and the c...