From bfd9d79ddcc80285e9d520edc05e6b895eec733e Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Motiejus=20Jak=C5=A1tys?= Date: Fri, 7 May 2021 15:47:07 +0300 Subject: [PATCH] more prose changes --- IV/mj-msc.tex | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) diff --git a/IV/mj-msc.tex b/IV/mj-msc.tex index 5cd1315..735ceee 100644 --- a/IV/mj-msc.tex +++ b/IV/mj-msc.tex @@ -586,11 +586,11 @@ often hard to impossible: research methodologies, as well as algorithms themselves, are explained in prose, which, due to the nature of the non-machine language, lends itself to inexact interpretations. -This article, besides explaining the algorithm in prose, \emph{includes} the -program of the algorithm in a way that can be executed on reader's workstation. -On top of it, all the illustrations in this paper are generated using that -algorithm, from a predefined list of test geometries (test geometries were -explained in section~\ref{sec:automated-tests}). +This article, besides explaining the algorithm in prose, includes the program +of the algorithm in a way that can be executed on reader's workstation. On top +of it, all the illustrations in this paper are generated using that algorithm, +from a predefined list of test geometries (test geometries were explained in +section~\ref{sec:automated-tests}). Instructions how to re-generate all the visualizations are found in appendix~\ref{sec:code-regenerate}. The visualization code serves as a good @@ -602,7 +602,7 @@ TODO: list most of the functions defined in the algorithm and draw how they interact. Similar to "Flow chart of the prototype system" in the original paper. -\section{Description of the implementation} +\section{Algorithm implementation} Like alluded in section~\ref{sec:introduction}, {\WM} paper skims over certain details, which are important to implement the algorithm. This section