Hoang, N., Linh, N. K., & Phu, H. X. (2024). Octagonal and hexadecagonal cut algorithms for finding the convex hull of finite sets with linear time complexity. Applied mathematics and computation, 481, 128931. https://doi.org/10.1016/j.amc.2024.128931
Citácia podle Chicago (17th ed.)Hoang, Nam-Dũng, Nguyen Kieu Linh, a Hoang Xuan Phu. "Octagonal and Hexadecagonal Cut Algorithms for Finding the Convex Hull of Finite Sets with Linear Time Complexity." Applied Mathematics and Computation 481 (2024): 128931. https://doi.org/10.1016/j.amc.2024.128931.
Citácia podľa MLA (8th ed.)Hoang, Nam-Dũng, et al. "Octagonal and Hexadecagonal Cut Algorithms for Finding the Convex Hull of Finite Sets with Linear Time Complexity." Applied Mathematics and Computation, vol. 481, 2024, p. 128931, https://doi.org/10.1016/j.amc.2024.128931.