Fast two dimensional convex hull on the GPU

Proceedings - 25th IEEE International Conference on Advanced Information Networking and Applications Workshops, WAINA 2011

Volumn , Issue , 2011, Pages 7-12

  Srungarapu, Srikanth ^a   Reddy, Durga Prasad ^a   Kothapalli, Kishore ^a   Narayanan, P J ^a  

^a INTERNATIONAL INSTITUTE OF INFORMATION TECHNOLOGY   (India)

Author keywords

convex hull; divide and conquer; GPGPU

Indexed keywords

COMPUTATIONAL POWER; CONVEX HULL; CONVEX HULL ALGORITHM; DATA PARALLEL ALGORITHMS; DIVIDE-AND-CONQUER; GENERAL PURPOSE PROGRAMMING; GPGPU; GRAPHICS PROCESSING UNIT; IRREGULAR DATA; MULTITHREADED ARCHITECTURE; PARALLEL COMPUTING; POINT SET; PRACTICAL ISSUES; RANDOM POINTS;

ALGORITHMS; COMPUTER SYSTEMS PROGRAMMING; PARALLEL ARCHITECTURES; PROGRAM PROCESSORS; TWO DIMENSIONAL;

COMPUTATIONAL GEOMETRY;

EID: 79957571146     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WAINA.2011.64     Document Type: Conference Paper

References (28)

1. S.G. Akl, A Constant-Time Parallel Algorithm for Computing Convex Hulls, BIT, Vol. 22, pages 130 134, 1982.
2. E.Anderson, J. Brooks, C. Grassl and S. Scott, Performance of the CRAY T3E Multiprocessor. Proc. Supercomputing 97, 1997.
3. Barber, C. B., Dobkin, D. P., Huhdanpaa,H. T., The Quickhull algorithm for convexhull, GCG53, The Geometry Center,Minneapolis, 1993.
4. I. Buck. GPU Computing with NVIDIA CUDA. In SIGGRAPH 07: , page 6, 2007.
5. A.L. Chow, Parallel Algorithm for Determining Convex Hull of Sets of Points in Two Dimension, Proc. Annual Allerton Conf. on Communication, Control and Computing, pages 214-223, 1981.
6. Cinque L, Di Maggio C. A BSP realization of Jarvis'algorithm [J]. Pattern Recognition Letters, 2001, 22 : 147 55.
7. Cormen, T., Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Second Edition. Section 33.3.
8. L. Devroye and G.T. Toussaint A note on linear expected time algorithms for finding convex hulls, In Computing, vol. 26, pp. 361-366,1981.
9. F. Dehne, A. Fabri and A. Rau-Chaplin, Scalable Parallel Geometric Algorithms for Coarse Grained Multicomputers. ACM Symposium on Computational Geometry, 1993.
10. M. Diallo, A. Ferreira, A. Rau-Chaplin and S. Ubda, Scalable 2D convex hull and triangulation algorithms for coarse grain multicomputers. J. Par. Dist. Comp. 56, 1999, pp. 4770.
11. Y. Dotsenko, N. Govindaraju, P. Sloan,C. Boyd, and J. Manferdelli. Fast Scan Algorithms on Graphics Processors.In Proc. ICS, pages 205213.
12. Freeman, H., and Shapira. R. Determining the minimum area incasing rectangle for an arbitrary closed curve. Comm. ACM, 409-413, 1975.
13. GilBert , E.N., and Pollak, H. Steiner minimal trees. SIAM J. Appl. Math. 16, (1968), 1-29.
14. J.A. Gonzalez, C. Leon, C. Rodriguez, F. Sande, A Model to Integrate Message Passing and Shared Memory Programming, In Proc. PVM/MPI, pages 114-225, 2001.
15. N. Govindaraju and D. Manocha. Cache-Efficient Numerical Algorithms using Graphics Hardware. Parallel Computing, 33(10-11):663-684, 2007. (Pubitemid 350064315)
16. N. K. Govindaraju, S. Larsen, J. Gray, and D. Manocha. A Memory Model for Scientific Algorithms on Graphics Processors. In Proc. ACM/IEEE SC, page 89.
17. Graham, R.L. (1972). An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set. IPL 1, 132-133.
18. Hardwick Jonathan C. Implementation and evaluation of an efficient 2D parallel Delaunay triangulation algorithm. In Proc. ACM SPAA, 1997.
19. Harris, M., Sengupta, S., and Owens, J.D. Parallel Prefix Sum (Scan) with CUDA.GPU Gems 3,2007, ch. 39.
20. JaJa, J. Introduction to Parallel Algorithms. Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, USA, 1992.
21. Jarvis, R. A. (1973). "On the identification of the convex hull of a finite set of points in the plane". IPL 2,18-21.
22. Jyothish Soman, K. Kothapalli, P. J. Narayanan, Fast GPU Algorithms for Graph Connectivity, Proc. LSPP, 2010.
23. Kirkpatrick, David G.; Seidel, Raimund (1986). "The ultimate planar convex hull algorithm". SIAM J. Comp. 15 (1): 287-299.
24. Nickolls, J., Buck, I., Garland, M., and S Kadron, K. Scalable Parallel Programming with CUDA. ACM Queue 6, 2008, 40-53.
25. F.P.Preparata and S.J.Hong.Convex hulls of finite set of points in two and three dimensions. Commun. ACM, 20:87-93,1977.
26. Rehman, M. S., Kothapalli, K., and Narayanan, P. J. Fast and Scalable List Ranking on the GPU. In Proc. ICS (2009), pp. 152-160.
27. S. Sengupta, M. Harris, Y. Zhang, and J. D. Owens. Scan Primitives for GPU Computing. In GH 07: pages 97-106, 2007.
28. Sklansky, J. Measuring concavity on a rectangular mosaic, IEEE Trans. Comptrs. C-21 (Dec. 1972), 1355-1364.