This is a project for Computational Geometry course in Brno University of Technology, Faculty of Information Technologies.
Project showcases 3 algorithms for computing convex hull in 3D. Quick hull, iterative algorithm and bruteforce algorithm. Iterative algorithm implementation was ported from Dung Han Lee's repository. All algorithms are visualized in Three.js.
You can try it here.
Josef Kotoun Jiří Vlasák Vít Tlustoš