GPU accelerated convex hull computation

Computers and Graphics (Pergamon)

Volumn 36, Issue 5, 2012, Pages 498-506

  Tang, Min ^a   Zhao, Jie Yi ^a   Tong, Ruo Feng ^a   Manocha, Dinesh ^b  

^a ZHEJIANG UNIVERSITY   (China)

^b UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

Convex hull computation; GPU; Interior point culling filter

Indexed keywords

DEFORMATION; GRAPHICS PROCESSING UNIT; PROGRAM PROCESSORS;

CONVEX HULL COMPUTATIONS; FILTERING ALGORITHM; GPU-ACCELERATED; HIGH-DIMENSIONAL; HIGHER-DIMENSIONAL; HYBRID ALGORITHMS; INTERIOR POINT CULLING FILTERS; ORDERS OF MAGNITUDE;

COMPUTATIONAL GEOMETRY;

EID: 84860719613     PISSN: 00978493     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cag.2012.03.015     Document Type: Conference Paper

References (26)

1. F.P. Preparata, and M.I. Shamos Computational geometry: an introduction 1985 Springer-Verlag New York, Inc. New York, NY, USA
2. Hoff KE, III, Keyser J, Lin M, Manocha D, Culver T. Fast computation of generalized voronoi diagrams using graphics hardware. In: Proceedings of the 26th annual conference on computer graphics and interactive techniques, SIGGRAPH 99; 1999. p. 277-86.
3. qhull.org, Qhull 2010.1; 2010 〈 http://www.qhull.org/ 〉.
4. Amato NM, Preparata FP. An NC parallel 3D convex hull algorithm. In: Proceedings of the ninth annual symposium on computational geometry, SCG 93; 1993. p. 289-97.
5. C.B. Barber, D.P. Dobkin, and H. Huhdanpaa The QuickHull algorithm for convex hulls ACM Trans Math Softw 22 1996 469 483 (Pubitemid 126417394)
6. T.M. Chan Optimal output-sensitive convex hull algorithms in two and three dimensions Discrete Comput Geometry 16 1996 361 368
7. F.P. Preparata, and S.J. Hong Convex hulls of finite sets of points in two and three dimensions Commun. ACM 20 1977 87 93
8. Amato NM, Goodrich MT, Ramos EA. Parallel algorithms for higher-dimensional convex hulls. In: Proceedings of the 34th IEEE Symposium on Foundations of Computer Science (FOCS); 1994. p. 683-94.
9. N. Gupta, and S. Sen Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima J. Parallel Distributed Comput 63 4 2003 488 500 (Pubitemid 36809651)
10. Dehne F, Deng X, Dymond P, Fabri A, Khokhar AA. A randomized parallel 3D convex hull algorithm for coarse grained multicomputers. In: Proceedings of the seventh annual ACM symposium on parallel algorithms and architectures, SPAA 95; 1995. p. 27-33.
11. Clarkson KL, Shor PW. Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental. In: Proceedings of the fourth annual symposium on computational geometry, SCG 88; 1988. p. 12-7.
12. Srungarapu S, Reddy DP, Kothapalli K, Narayanan PJ. Fast two dimensional convex hull on the GPU. In: Proceedings of AINA Workshops11; 2011. p. 7-12.
13. Edelsbrunner H, Mücke EP. Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. In: Proceedings of the fourth annual symposium on computational geometry, SCG 88; 1988. p. 118-33.
14. Srikanth D, Kothapalli K, Govindarajulu R, Narayanan P. Parallelizing two dimensional convex hull on NVIDIA GPU and Cell BE. In: International conference on high performance computing (HiPC) 2009, Students research symposium, Cochin, India; 2009. p. 1-5.
15. Gao M, Cao T-T, Tan T-S, Huang Z. ghull: a three-dimensional convex hull algorithm for graphics hardware. In: Symposium on interactive 3D graphics and games, I3D 11; 2011. p. 204.
16. Qi M, Cao T-T, Tan T-S. Computing two-dimensional constrained Delaunay triangulation using graphics hardware; 2012 〈 http://www.comp.nus.edu.sg/ ∼tants/cdt.html 〉.
17. I. Fischer, and C. Gotsman Fast approximation of high-order voronoi diagrams and distance transforms on the GPU J Garph Tools 11 4 2006 39 60
18. Sud A, Govindaraju N, Gayle R, Manocha D. Interactive 3d distance field computation using linear factorization. In: Proceedings of the 2006 symposium on interactive 3D graphics and games, I3D 06; 2006. p. 117-24.
19. Cao T-T, Tang K, Mohamed A, Tan T-S. Parallel banding algorithm to compute exact distance transform with the GPU. In: Proceedings of the 2010 ACM SIGGRAPH symposium on interactive 3D graphics and games, I3D 10, 2010. p. 83-90.
20. Grünbaum B. Measure of symmetry for convex sets. In: Proceedings of the 7th symposium in pure mathematics of the American mathematical society, symposium on convexity; 1961. p. 233-70.
21. M. Harris, S. Sengupta, and J. Owens Parallel prefix sum (scan) with CUDA H. Nguyen, GPU Gems 3 2008 Addison-Wesley 851 876
22. S. Akl, and G. Toussaint A fast convex hull algorithm Inf Process Lett 7 1978 219 222
23. Jurkiewicz T, Danilewski P. Efficient quicksort and 2D convex hull forCUDA, and MPRAM as a realistic model of massively parallel computations, Max Planck Institute for Informatics; 2010.
24. Tzeng S, Owens JD. Finding convex hulls using Quickhull on the GPU, Technical Report, University of California, Davis; 2012 〈 http://arxiv.org/abs/1201.2936 〉.
25. Stein A, Geva E, El-Sana J. CudaHull: Fast parallel 3D convex hull on the GPU, Comput Graph, http://dx.doi.org/10.1016/j.cag.2012.02.012, in press.
26. Tang M, Manocha D, Lin J, Tong R. Collision-streams: Fast GPU-based collision detection for deformable models. In: I3D 11: Proceedings of the 2011 ACM SIGGRAPH symposium on interactive 3D Graphics and Games; 2011. p. 63-70.