First and Extremely fast Online 2D Convex Hull Algorithm in O(Log h) per point

Eric Ouellet, Omar Saad (IREQ)

Rate me:

5.00/5 (7 votes)

28 Feb 2018CPOL26 min read

22.7K

150

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.

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

Eric Ouellet

Software Developer IREQ - Hydro-Quebec

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

Omar Saad (IREQ)

Engineer

Canada

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

First and Extremely fast Online 2D Convex Hull Algorithm in O(Log h) per point

Views

Downloads

License

Comments and Discussions