Iterative algorithms for the planar convex hull problem on mesh-connected arrays

Parallel Computing

Volumn 18, Issue 3, 1992, Pages 281-296

  Andrew Holey, J ^a   Ibarra, Oscar H ^b  

^a Global Business Leadership Department   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Computational geometry; convex hull; iterative algorithms; mesh connected arrays; parallel algorithms

Indexed keywords

MATHEMATICAL TECHNIQUES--ITERATIVE METHODS;

COMPUTATIONAL GEOMETRY; PARALLEL ALGORITHMS; PLANAR CONVEX HULL PROBLEM;

COMPUTER SYSTEMS, DIGITAL;

EID: 0026832178     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-8191(92)90097-Q     Document Type: Article

References (18)

1. Parallel computational geometry
2. Another efficient algorithm for convex hulls in two dimensions
3. Efficient parallel solutions to some geometric problems
4. Computational geometry on a systolic chip
5. Deterministic sorting in nearly logarithmic time on the hypercube and related computers
6. An efficient algorithm for determining the convex hull of a finite planar set
7. An efficient implementation of batcher's odd-even merge algorithm and its application in parallel sorting schemes
8. Geometric problems on two-dimensional array processors
9. Efficient parallel convex hull algorithms
10. Mesh computer algorithms for computational geometry
11. Bitonic sort on a mesh-connected parallel computer
12. Maintenance of configurations in the plane
13. Computational Geometry
14. Parallel computational geometry
15. Computational geometry on a hypercube
16. Sorting on a mesh-connected parallel computer