melch/mt-polygon-simplification
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Change structure of chapter source files

Browse Source
This commit is contained in:
Alfred Melch 2019-07-22 14:24:59 +02:00
parent 3d818ed648
commit 8832e8d0ba
14 changed files with 43 additions and 34 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
thesis/Makefile Normal file
View File

@ -0,0 +1,6 @@
main.pdf:
make chapters.tex
pdflatex -synctex=1 -interaction=nonstopmode main.tex
chapters.tex:
./generate-chapters.sh

24
thesis/chapters.tex Normal file
View File

@ -0,0 +1,24 @@
\input{chapters/01-introduction.tex}
\newpage
\input{chapters/02-principles.tex}
\newpage
\input{chapters/03-algorithms.tex}
\newpage
\input{chapters/04-webassembly.tex}
\newpage
\input{chapters/05-benchmarking.tex}
\newpage
\input{chapters/06-integration.tex}
\newpage
\input{chapters/07-results.tex}
\newpage
\input{chapters/08-conclusion.tex}
\newpage

1
thesis/chapters/introduction.tex → thesis/chapters/01-introduction.tex
View File

@ -1,3 +1,4 @@
\section{Introduction}
% Introduction
% Fragestellung & Zielsetzung - aim & research objectives

1
thesis/chapters/chapter01.tex → thesis/chapters/02-principles.tex
View File

@ -1,3 +1,4 @@
\section{Principles}
% Principles
\subsection{Polygon basics}

1
thesis/chapters/chapter03.tex → thesis/chapters/03-algorithms.tex
View File

@ -1,3 +1,4 @@
\section{Algorithms}
Compression algorithms.
\subsection{n-th point algorithm}

2
thesis/chapters/chapter04.tex → thesis/chapters/04-webassembly.tex
View File

@ -1,3 +1,5 @@
\section[WebAssembly]{Running the algorithms on the web platform}
% The Web Platform

2
thesis/chapters/chapter05.tex → thesis/chapters/05-benchmarking.tex
View File

@ -1,3 +1,5 @@
\section[Benchmark]{Implementation of a performance benchmark}
% Performance benchmark
In this chapter i will explain the approach to improve the performance of a simplification algorithm in a web browser via WebAssembly. The go-to library for this kind of operation is Simplify.JS. It is the javascript implementation of the Douglas-Peucker algorithm with optional radial distance preprocessing. The library will be rebuilt in the C programming language and compiled to Webassembly with emscripten. A web page is built to produce benchmarking insights to compare the two approaches performance wise.

4
thesis/chapters/chapter06.tex → thesis/chapters/06-integration.tex
View File

@ -1,3 +1,7 @@
\section{Compiling an existing C++ library for use on the web}
\subsection{State of the art: psimpl}
\subsection{Compiling to webassembly}

0
thesis/chapters/results.tex → thesis/chapters/07-results.tex
View File

0
thesis/chapters/conclusion.tex → thesis/chapters/08-conclusion.tex
View File

4
thesis/chapters/chapter02.tex
View File

@ -1,4 +0,0 @@
LineString Simplification. Compression and Heuristics.
Compare compression analysis too image compression.

1
thesis/generate-chapters.sh Executable file
View File

@ -0,0 +1 @@
for i in $(ls chapters); do printf '\\input{chapters/%s}\n\\newpage\n\n' $i; done > chapters.tex

BIN
thesis/main.pdf
View File

Binary file not shown.

31
thesis/main.tex
View File

@ -75,36 +75,7 @@ Abstract goes here
\setcounter{page}{1}
\pagenumbering{arabic}
\section{Introduction}
\input{chapters/introduction}
\newpage
\section{Principles}
\input{chapters/chapter01}
\newpage
\section{Algorithms}
\input{chapters/chapter03}
\newpage
\section[WebAssembly]{Running the algorithms on the web platform}
\input{chapters/chapter04}
\newpage
\section[Benchmark]{Implementation of a performance benchmark}
\input{chapters/chapter05.tex}
\newpage
\section{Compiling an existing C++ library for use on the web}
\input{chapters/chapter06.tex}
\section{Results}
\input{chapters/results}
\newpage
\section{Conclusion}
\input{chapters/conclusion}
\newpage
\input{chapters.tex}
\lstlistoflistings
\newpage