Almost 2x performance improvement — check out the updated numbers! ⚡️⚡️⚡️
Introduces a hash table for storing edges of the advancing convex hull, an idea I got from this paper. The edges are hashed by the angle between their start point and the seed center, and this is used during the sweep process to quickly find a visible edge from each point.
lukasmartinelli
commented
7 years ago 
Almost 2x performance improvement — check out the updated numbers! ⚡️⚡️⚡️
Introduces a hash table for storing edges of the advancing convex hull, an idea I got from this paper. The edges are hashed by the angle between their start point and the seed center, and this is used during the sweep process to quickly find a visible edge from each point.
cc @mbostock