From 1f5fc02ee7d7d8c5160d51e1a5cfaf1ce0a3dbe3 Mon Sep 17 00:00:00 2001
From: Daniel Melanz <daniel.melanz@gmail.com>
Date: Mon, 18 Nov 2013 23:19:18 -0600
Subject: [PATCH] Update README.md

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

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).