Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지

A PARALLEL ALGORITHM FOR CONSTRUCTING THE CONVEX-HULL OF A SIMPLE POLYGON

  • Published : 1999.03.01

⟨ Previous Next ⟩

Abstract

Given n points in the plane the planar convex hull prob-lem in that of finding which of these points belong to the perimeter of the smallest convex region (a polygon) containing all n points. Here we suggest two kinds of methods. First we present a new sequential method for constructing the pla-nar convex hull O(1.5n) time in the quadratic decision tree model. Second using the sequential method we suggest a new parallel algo-rithm which solve the planar convex hull O(1.5n/p) time on a maspar Machine (CREW-PRAM) with O(n) processors. Also when we run on a maspar Machine we achieved a 37. 156-fold speedup with 64 pro-cessor.

Keywords

References

  1. IEEE Trans. Comput. v.21 no.2 Concavity on a Rectilinear Mosaic Sklansky,J.
  2. Ph. D. dissertation, Computer Science Department, Yale University Problems in Computational Geometry Shamos. M
  3. Problems in Computational Geometry Ph. D. dissertation, Computer Science Deparment, Yale University Shamos.M
  4. Inform. Process. Letter v.9 A Linear Algorithm for Finding the Convex Hull of a Simple Polygon McCallum,D.;Avis,D.
  5. Journal of Algorithms v.1 no.4 Finding the Convex Hull of a Simple Polygon Graham,R.L.;Yao,F.F.
  6. International Journal of Computer and Information Science v.12 no.2 On Finding the Convex Hull of a Simple Polygon Lee,D.T.
  7. Inform. Process. Letter v.7 Convex Hull of a Finite Set of Points in Two Dimensions Bykat,A.
  8. Efficient parallel techniques for computational geometry Ph. D. dissertation, Purdue University Goodrich;Michael Truman
  9. Technical Report, LSU A Simplified Optimal Algorithm for Constructing the Convex Hull of a Simple Polygon Liu,Jigang;Zheng,Si-Qing
  10. Inform. Process. Letter Computational Geometry: An Introduction Preparata,F.P.;Shamos,M.A.