commit 4a80c7ec167b0f2d23248dfd53403fd8cc81a3c3 (tree) parent 98cf944a0a62f3628b5b6182121a9d1eb9ed920f Author: Motiejus Jakštys <motiejus@uber.com> Date: Sat, 17 Apr 2021 20:27:29 +0300 remove previous ASCII art Diffstat:
| M | IV/mj-msc.tex | | | 14 | -------------- |
1 file changed, 0 insertions(+), 14 deletions(-)
diff --git a/IV/mj-msc.tex b/IV/mj-msc.tex @@ -449,20 +449,6 @@ figure~\onpage{fig:selfcrossing-1-non-neighbor}. \label{fig:selfcrossing-1-non-neighbor} \end{figure} - -\begin{figure}[h] - \centering - \begin{BVerbatim} - \ \ - B\ | _ __ - | | / \ / \ - | |___/ \___/A | - \_________________| - \end{BVerbatim} - \caption{A baseline crossing non-neighboring in-between bends} - \label{fig:ascii-selfcross} -\end{figure} - Naively implemented, checking every bend with every bend is costs $O(n^2)$. It is possible to optimize this step and skip checking some of the bends. Only