Issue No.03 - March (1989 vol.38)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.21120
Asymptotically optimal parallel algorithms are presented for use on a mesh computer to determine several fundamental geometric properties of figures. For example, given multiple figures represented by the Cartesian coordinates of n or fewer planar vertices, distributed one point per processor on a two-dimensional mesh computer with n simple processing elements, Theta (n/sup 1/2/≤-time algori
mesh computer algorithms; asymptotically optimal parallel algorithms; computational geometry; Cartesian coordinates; two-dimensional mesh computer; convex hull; all-nearest neighbor problems; intersection problems; computational geometry; parallel algorithms.
R. Miller, Q.F. Stout, "Mesh Computer Algorithms for Computational Geometry", IEEE Transactions on Computers, vol.38, no. 3, pp. 321-340, March 1989, doi:10.1109/12.21120