Computational geometry: an introduction
Computational geometry: an introduction
Information Processing Letters
Efficient parallel solutions to some geometric problems
Journal of Parallel and Distributed Computing
Parallel algorithms for regular architectures: meshes and pyramids
Parallel algorithms for regular architectures: meshes and pyramids
Graph Problems on a Mesh-Connected Processor Array
Journal of the ACM (JACM)
Multidimensional divide-and-conquer
Communications of the ACM
Sorting on a mesh-connected parallel computer
Communications of the ACM
Determining the minimum-area encasing rectangle for an arbitrary closed curve
Communications of the ACM
Introduction to VLSI Systems
Parallel algorithms for the convex hull problem in two dimensions
CONPAR '81 Proceedings of the Conference on Analysing Problem Classes and Programming for Parallel Computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A lower bound to finding convex hulls
A lower bound to finding convex hulls
Computational geometry.
Efficient Parallel Convex Hull Algorithms
IEEE Transactions on Computers
Dynamic computational geometry on parallel computers
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Computational geometry on hypercube computers
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Inheritance and synchronization with enabled-sets
OOPSLA '89 Conference proceedings on Object-oriented programming systems, languages and applications
Vector prefix addition on sub-bus mesh computers
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Prefix Computations on a Generalized Mesh-Connected Computer with Multiple Buses
IEEE Transactions on Parallel and Distributed Systems
Constructing Euclidean Minimum Spanning Trees and All Nearest Neighbors on Reconfigurable Meshes
IEEE Transactions on Parallel and Distributed Systems
Constant Time Algorithms for Computational Geometry on the Reconfigurable Mesh
IEEE Transactions on Parallel and Distributed Systems
The Mesh with Hybrid Buses: An Efficient Parallel Architecture for Digital Geometry
IEEE Transactions on Parallel and Distributed Systems
A Fast Algorithm for k-Nearest Neighbor Problem on a Reconfigurable Mesh Computer
Journal of Intelligent and Robotic Systems
A Fast Parallel Algorithm for Convex Hull Problem of Multi-Leveled Images
Journal of Intelligent and Robotic Systems
A Sliding Memory Plane Array Processor
IEEE Transactions on Parallel and Distributed Systems
Efficient Mappings of Pyramid Networks
IEEE Transactions on Parallel and Distributed Systems
Square Meshes Are Not Optimal for Convex Hull Computation
IEEE Transactions on Parallel and Distributed Systems
Fast median-finding on mesh-connected computers with segmented buses
Nordic Journal of Computing
IEEE Transactions on Parallel and Distributed Systems
Efficient parallel geometric algorithms on a mesh of trees
ACM-SE 33 Proceedings of the 33rd annual on Southeast regional conference
| Hi-index | 14.98 |
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 algorithms are given for identifying the convex hull and smallest enclosing box of each figure. Given two such figures, a Theta (n/sup 1/2/驴-time algorithm is given to decide if the two figures are linearly separable. Given n or fewer planar points, Theta (n/sup 1/2/驴-time algorithms are given to solve the all-nearest neighbor problems for points and for sets of points. Given n or fewer circles, convex figures, hyperplanes, simple polygons, orthogonal polygons, or iso-oriented rectangles, Theta (n/sup 1/2/驴-time algorithms are given to solve a variety of area and intersection problems. Since any serial computer has worst-case time of Omega (n) when processing n points, these algorithms show that the mesh computer provides significantly better solutions to these problems.