Click here to Skip to main content
14,773,364 members
Articles » General Programming » Algorithms & Recipes » Algorithms » Revisions

Stats

14.3K views
108 downloads
16 bookmarked

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

,
Rate me:
Please Sign up or sign in to vote.
5.00/5 (7 votes)
28 Feb 2018CPOL
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.

Revisions


  

Compare Revision Minor Date Status Editor
23 - publicly available Yes 14-May-18 11:30 Available Eric Ouellet
Fixed information about the first appearance of the algorithm article. Added some  clarifications,
1 No 28-Feb-18 11:31 Available Chris Maunder
Updates in content.

License

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

Share

About the Authors

Eric Ouellet
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!

Omar Saad (IREQ)
Engineer
Canada Canada
No Biography provided

Comments and Discussions