motiejus/stud
1
Fork 0
Code Releases Activity

refs

Browse Source
This commit is contained in:
Motiejus Jakštys
2020-05-21 14:21:15 +03:00
parent bba95a5901
commit b141362ff6
2 changed files with 70 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
II/Referatas/mj-referatas.tex
View File

@@ -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}