From b141362ff6473209f1c970f8b9af05e9b194333d Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Motiejus=20Jak=C5=A1tys?= <desired.mta@gmail.com>
Date: Thu, 21 May 2020 14:21:15 +0300
Subject: [PATCH] refs

---
 II/Referatas/bib.bib          | 61 +++++++++++++++++++++++++++++++++++
 II/Referatas/mj-referatas.tex | 11 +++++--
 2 files changed, 70 insertions(+), 2 deletions(-)

diff --git a/II/Referatas/bib.bib b/II/Referatas/bib.bib
index 8c9b383..9638fe0 100644
--- a/II/Referatas/bib.bib
+++ b/II/Referatas/bib.bib
@@ -23,3 +23,64 @@
     month={Dec},
     pages={477}
 }
+
+// algorithms for generalization, not reaching satisfactory results
+@inproceedings{monmonier1986toward,
+  title={Toward a practicable model of cartographic generalisation.},
+  author={Monmonier, Mark},
+  booktitle={Auto Carto London. Proc. conference, 1986. Vol. 2},
+  pages={257--266},
+  year={1986},
+  organization={distributed Royal Institution of Chartered Surveyors}
+}
+@inproceedings{mcmaster1993spatial,
+  title={A spatial-object level organization of transformations for cartographic generalization},
+  author={McMaster, RB and Barnett, Leone},
+  booktitle={AUTOCARTO-CONFERENCE-},
+  pages={386--386},
+  year={1993},
+  organization={Citeseer}
+}
+@inproceedings{jiang2003line,
+  title={Line simplification using self-organizing maps},
+  author={Jiang, Bin and Nakos, Byron},
+  booktitle={Proceedings of the ISPRS Workshop on Spatial Analysis and Decision Making, Hong Kong, China},
+  pages={3--5},
+  year={2003}
+}
+@article{dyken2009simultaneous,
+  title={Simultaneous curve simplification},
+  author={Dyken, Christopher and D{\ae}hlen, Morten and Sevaldrud, Thomas},
+  journal={Journal of geographical systems},
+  volume={11},
+  number={3},
+  pages={273--289},
+  year={2009},
+  publisher={Springer}
+}
+@article{mustafa2006dynamic,
+  title={Dynamic simplification and visualization of large maps},
+  author={Mustafa, Nabil and Krishnan, Shankar and Varadhan, Gokul and Venkatasubramanian, Suresh},
+  journal={International Journal of Geographical Information Science},
+  volume={20},
+  number={3},
+  pages={273--302},
+  year={2006},
+  publisher={Taylor \& Francis}
+}
+@article{nollenburg2008morphing,
+  title={Morphing polylines: A step towards continuous generalization},
+  author={N{\"o}llenburg, Martin and Merrick, Damian and Wolff, Alexander and Benkert, Marc},
+  journal={Computers, Environment and Urban Systems},
+  volume={32},
+  number={4},
+  pages={248--260},
+  year={2008},
+  publisher={Elsevier}
+}
+@inproceedings{stanislawski2012automated,
+  title={Automated metric assessment of line simplification in humid landscapes},
+  author={Stanislawski, Lawrence V and Raposo, Paulo and Howard, Michael and Buttenfield, Barbara P},
+  booktitle={Proceedings of the AutoCarto},
+  year={2012}
+}
diff --git a/II/Referatas/mj-referatas.tex b/II/Referatas/mj-referatas.tex
index ec24a23..4765a7a 100644
--- a/II/Referatas/mj-referatas.tex
+++ b/II/Referatas/mj-referatas.tex
@@ -46,12 +46,19 @@ Cartographic generalization is one of the key processes of creating large-scale
 maps: how can one approximate object features, without losing its main
 cartographic properties?
 
-Linear generalization algorithms are well studied, tested and implemented.
+Generalization algorithms are well studied, tested and implemented, but they
+expose deficiencies in large-scale reduction (\cite{monmonier1986toward},
+\cite{mcmaster1993spatial}, \cite{jiang2003line}, \cite{dyken2009simultaneous},
+\cite{mustafa2006dynamic}, \cite{nollenburg2008morphing}).
 
 There are two main approaches to generalize lines in a map: geometric and
 cartographic.
 
-\subsection{
+\cite{stanislawski2012automated} studied different types of metric assessments,
+such as Hausdorff distance, segment length, vector shift, surface displacement,
+and tortuosity for the generalization of linear geographic elements. Their
+research can provide references to the appropriate settings of the line
+generalization parameters for the maps at various scales.
 
 \section{The Problem}
 \label{sec:the_problem}