From 24b9a4a627c6a8941e4360699ff3a750f5eae29f Mon Sep 17 00:00:00 2001
From: Antti H S Laaksonen <ahslaaks@cs.helsinki.fi>
Date: Tue, 21 Feb 2017 22:19:29 +0200
Subject: [PATCH] References

---
 luku30.tex | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/luku30.tex b/luku30.tex
index c0876fb..c582e2a 100644
--- a/luku30.tex
+++ b/luku30.tex
@@ -217,9 +217,9 @@ Using such structures, processing each event
 takes $O(\log n)$ time, so the total running
 time of the algorithm is $O(n \log n)$.
 
-\section{Nearest points}
+\section{Closest pair problem}
 
-\index{nearest points}
+\index{closest pair}
 
 Given a set of $n$ points, our next problem is
 to find two points whose distance is minimum.
@@ -338,7 +338,7 @@ because we go through $n$ points and
 find for each point the nearest point to the left
 in $O(\log n)$ time.
 
-\section{Convex hull}
+\section{Convex hull problem}
 
 A \key{convex hull} is the smallest convex polygon
 that contains all points of a given set.
@@ -391,7 +391,7 @@ the convex hull is as follows:
 
 \index{Andrew's algorithm}
 
-\key{Andrew's algorithm} provides
+\key{Andrew's algorithm} \cite{and79} provides
 an easy way to
 construct the convex hull for a set of points
 in $O(n \log n)$ time.