bibin/cphb
1
0
Fork 0
Code Issues Pull requests Releases Wiki Activity

References etc.

Browse source
This commit is contained in:
Antti H S Laaksonen 2017-02-25 21:12:39 +02:00
parent 5877d1811f
commit b2b2975469
3 changed files with 25 additions and 8 deletions
Download patch file Download diff file Expand all files Collapse all files

6
chapter30.tex
View file

@ -270,7 +270,11 @@ we should find the following points:
This is another example of a problem
that can be solved in $O(n \log n)$ time
using a sweep line algorithm.
using a sweep line algorithm\footnote{Besides this approach,
there is also an
$O(n \log n)$ time divide-and-conquer algorithm \cite{sha75}
that divides the points into two sets and recursively
solves the problem for both sets.}.
We go through the points from left to right
and maintain a value $d$: the minimum distance
between two points seen so far.