Stream Computation of 3D Approximate Convex Hulls with an FPGA
Authors: 
Tatsuma Mori, Daiki Furukawa, Keigo Motoyoshi, Haruto Ikehara, Kaito Ohira, Taito Manabe, Yuichiro Shibata, Tomohiro Ueno, Kentaro SanoAuthors Info & Claims
Tatsuma Mori, Daiki Furukawa, Keigo Motoyoshi, Haruto Ikehara, Kaito Ohira, Taito Manabe, Yuichiro Shibata, Tomohiro Ueno, Kentaro SanoAuthors Info & ClaimsPages 69 - 75
Abstract
The convex hull is the minimum convex set which encloses a given point set. A problem to find convex hulls is not only one of the most fundamental algorithms in computer geometry, but also has a wide variety of practical applications such as robotics and geographic informatics. This paper proposes and evaluates an efficient pipelined FPGA implementation of approximate convex hull computing for 3D points. The proposed architecture does not require the input points to be sorted in advance, and can execute the algorithm in a pipelined manner without storing all the points in memory. We implemented the architecture on an Intel Stratix 10 FPGA to reveal the tradeoff relationship among its performance, resource usage, and approximation accuracy. As a result, we demonstrated 9 to 115 times faster performance compared to the convex hull software library Qhull, which was run on the Intel Core i9-9900K. The accuracy assessment revealed that the approximation error normalized to the diameters of point sets was only 0.037% to 3.173%, which was acceptably small for practical use cases.
References
[1]
A. M. Andrew. 1979. Another Efficient Algorithm for Convex Hulls in Two mensions. Inform. Process. Lett. 9, 5 (1979), 216–219.
[2]
C. B. Barber, D. P. Dobkin, and H. T. Huhdanpaa. 1996. The Quickhull Algorithm for Convex Hulls. ACM Trans. Math. Software 22, 4 (1996), 469–483.
[3]
J. L. Bentley, G. M. Faust, and F. P. Preparata. 1982. Approximation Algorithms for Convex Hulls. Commun. ACM 25, 1 (1982), 64–68.
[4]
W. Eddy. 1977. A New Convex Hull Algorithm for Planar Sets. ACM Trans. Math. Software 3, 4 (1977), 398–403.
[5]
M. Gao, T. T. Cao, A. Nanjappa, and T. S. Tan. 2013. gHull: a GPU Algorithm for 3D Convex Hull. ACM Trans. Math. Software 40, 3 (2013), 1–19.
[6]
GIT accessed Jan. 20, 2022. GIT Large Geometry Models Archive. https://www.cc.gatech.edu/projects/large_models/
[7]
M. Z. Hossain and M. A. Amin. 2013. On Constructing Approximate Convex Hull. American Journal of Computational Mathematics 3, 1A(2013), 11–17.
[8]
Z. Hussain. 1988. A Fast Approximation to a Convex Hull. Pattern Recognition Letters 8 (1988), 289–294.
[9]
K. Kanazawa, K. Kemmotsu, Y. Mori, N. Aibe, and M. Yasunaga. 2015. High-Speed Calculation of Convex Hull in 2D Images Using FPGA. Proc. International Conference on Parallel Computing (ParCo) (2015), 532–542.
[10]
S. Katz and A. Tal. 2015. On the Visibility of Point Clouds. In 2015 IEEE International Conference on Computer Vision (ICCV). 1350–1358.
[11]
S. Katz, A. Tal, and R. Basri. 2007. Direct Visibility of Point Sets. ACM Transactions on Graphics 26, 3 (2007), 24.
[12]
L. Kavan, I. Kolingerova, and J. Zara. 2006. Fast Approximation of Convex Hull. Proc. IASTED International Conference on Advances in Computer Science and Technology (2006), 101–104.
[13]
G. Mei. 2016. CudaChain: An Alternative Algorithm for Finding 2D Convex Hulls on the GPU. SpringerPlus 5(2016), 1–26.
[14]
T. Mori, T. Manabe, and Y. Shibata. 2020. Fast and Memory Efficient Approximated Convex Hull Computation with FPGA. Proc. International Symposium on Computing and Networking (CANDAR) (2020), 174–180.
[15]
T. Mori, T. Manabe, and Y. Shibata. 2022. A Hardware Oriented Approximate Convex Hull Algorithm and its FPGA Implementation. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E105-A, 3 (2022), 459–467.
[16]
The Geometry Center Home Page. 1996. Qhull code for Convex Hull, Delaunay Triangulation, Voronoi Diagram, and Halfspace Intersection about a Point. http://qhull.org/.
[17]
J. Qin, G. Mei, S. Cuomo, S. Guo, and Y. Li. 2019. CudaCHPre2D: A Straightforward Preprocessing Approach for Accelerating 2D Convex Hull Computations on the GPU. Concurrency and Computation Practice and Experience 32, 4(2019), 1–12.
[18]
S. Ramaswami. 1993. Convex Hulls: Complexity and Applications (a survey). University of Pennsylvania Technical Report MS-CIS-93-97 (1993).
[19]
R. M. Silva, C. Esperança, and A. Oliveira. 2012. Efficient HPR-Based Rendering of Point Clouds. Proc. Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI) (2012), 126–133.
[20]
D. Srikanth, P. Reddy, K. Kothapalli, R. Govindarajulu, and P. J. Narayanan. 2009. Parallelizing Two Dimensional Convex Hull on NVIDIA GPU and Cell BE. Proc. International Conference on High Performance Computing (2009), 1–5.
[21]
Stanford accessed Jan. 20, 2022. The Standford 3D Scanning Repository. http://www.graphics.stanford.edu/data/3Dscanrep/
[22]
A. Stein and J. El-Sana E. Geva. 2012. CudaHull: Fast parallel 3D convex hull on the GPU. Computers and Graphics 36 (2012), 265–271.
[23]
M. Tang, J. Zhao, R. Tong, and D. Manocha. 2012. GPU accelerated convex hull computation. Computers and Graphics 36, 5 (2012), 498–506.
[24]
S. Tzeng and J. D. Owens. 2012. arXiv preprint arXiv:1201.2936(2012).
[25]
J. M. White and K. A. Wortman. 2012. Divide-and-conquer 3D Convex Hulls on the GPU. arXiv preprint arXiv:1205.1171(2012).
Recommendations
Convex hulls of spheres and convex hulls of disjoint convex polytopes
Given a set @S of spheres in E^d, with d>=3 and d odd, having a constant number of m distinct radii @r"1,@r"2,...,@r"m, we show that the worst-case combinatorial complexity of the convex hull of @S is @Q(@__ __"1"=<"i"<>"j"=<"mn"in"j^@__ __^d^2^@__ __), ...
Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes
SoCG '11: Proceedings of the twenty-seventh annual symposium on Computational geometryGiven a set Σ of spheres in Ed, with d≥3 and d odd, having a fixed number of m distinct radii ρ1,ρ2,...,ρm, we show that the worst-case combinatorial complexity of the convex hull CHd(Σ) of Σ is Θ(Σ{1≤i≠j≤m}ninj⌊ d/2 ⌋), where ni is the number of ...
-Concave hull, a generalization of convex hull
Bounding hulls such as convex hull, -shape, -hull, concave hull, crust, etc. offer a wide variety of useful applications. In this paper, we explore another bounding hull, namely -concave hull, as a generalization of convex hull. The parameter determines ...
Comments
Information & Contributors
Information
Published In
June 2022
114 pages
ISBN:9781450396608
DOI:10.1145/3535044
Copyright © 2022 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 09 June 2022
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
HEART2022
HEART2022: International Symposium on Highly-Efficient Accelerators and Reconfigurable Technologies
June 9 - 10, 2022
Tsukuba, Japan
Acceptance Rates
HEART '22 Paper Acceptance Rate 10 of 21 submissions, 48%;
Overall Acceptance Rate 22 of 50 submissions, 44%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 258Total Downloads
- Downloads (Last 12 months)158
- Downloads (Last 6 weeks)17
Reflects downloads up to 27 Jul 2024
Other Metrics
Citations
View Options
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML FormatGet Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in