diff --git a/README.md b/README.md
index f4f840b..ce00454 100644
--- a/README.md
+++ b/README.md
@@ -23,7 +23,7 @@ Constructs a Voronoi diagram for a collection of points
 
 Author: Mikola Lysenko
 
-### [`half-edge`](http://en.wikipedia.org/wiki/Doubly_connected_edge_list)
+### [`half-edge-3d`](https://github.com/melanz/half-edge-3d)
 
 The half-edge data structure. This data structure provides efficient manipulation of the topological information associated with the objects in question (vertices, edges, faces).