Click here to Skip to main content
15,886,199 members
Articles / Desktop Programming / WPF

Fast and improved 2D Convex Hull algorithm and its implementation in O(n log h)

,
Rate me:
Please Sign up or sign in to vote.
4.98/5 (45 votes)
1 Mar 2018CPOL58 min read 89.2K   954   57  
Many improvements over a pretty new and unknown very fast 2D Convex Hull algorithm and much more.
This article is about a relatively new and unknown Convex Hull algorithm and its implementation. This new algorithm has great performance and this article present many implementation variations and/or optimizations of it. This article contains detailed explanation, code and benchmark in order for the reader to easily understand and compare results with most regarded and popular actual convex hull algorithms and their implementation. You will find real working and tested code here. This article combines: code, algorithms and mathematical. It is a little bit specialized, but I hope you will find something interesting here.

Views

Daily Counts

Downloads

Weekly Counts

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)


Written By
Software Developer IREQ - Hydro-Quebec
Canada Canada
Hi,

I'm a french Canadian software developer.
Work at Hydro-Quebec / IREQ.
Live in Sainte-Julie, Quebec, Canada (South shore of Montreal)

WebPage: http://www.ericouellet.com
GMail: ericouellet2

Salut!

Written By
Engineer
Canada Canada
This member has not yet provided a Biography. Assume it's interesting and varied, and probably something to do with programming.

Comments and Discussions