Articles by Omar Saad (IREQ) (Articles: 3)

Desktop Programming
WPF	First and Extremely fast Online 2D Convex Hull Algorithm in O(Log h) per point 28 Feb 2018 Updated: 28 Feb 2018 Rating: 5.00/5 Votes: 7 Popularity: 4.23 Licence: CPOL Views: 22,819 Bookmarked: 17 Downloaded: 150 Please Sign up or sign in to vote. Ouellet Convex Hull is currently the only ‘Online’ Convex Hull in O(log h) per point, where 'Online' stands for dynamically add one point at a time. Based on our own test against many other algorithm implementations, including Chan and Voronoi/Delaunay, it appears to be the fastest one.
	Fast and improved 2D Convex Hull algorithm and its implementation in O(n log h) 13 Oct 2017 Updated: 1 Mar 2018 Rating: 4.98/5 Votes: 45 Popularity: 8.24 Licence: CPOL Views: 89,488 Bookmarked: 57 Downloaded: 954 Please Sign up or sign in to vote. Many improvements over a pretty new and unknown very fast 2D Convex Hull algorithm and much more.
Programming Languages
C#	A Convex Hull Algorithm and its implementation in O(n log h) 20 May 2014 Updated: 1 Mar 2018 Rating: 4.93/5 Votes: 60 Popularity: 8.72 Licence: CPOL Views: 187,506 Bookmarked: 123 Downloaded: 5,207 Please Sign up or sign in to vote. A very fast Convex Hull algorithm and its implementation in O (n log h)