% þ‰ß ꉑþ‰Û ũ‰Þ‰ũ‰‚ý Ĩ þ‰Ũ •‰‘þ‰‘öũ‰‘õ‰‚ Ļ‰ī  “‰‘ Ļ‰ĩ‰Ô‰‘Ēų Ĩ ꉑĪĻ‰ü—‰Ũ —‰ú‰ƒ‰‚
% Š‰Āų Ļ‰ī. —‰›‰‚ ‰ƒ‰Ā  þ‰ß •‰‘þ‰‘öũ‰‘õ‰‚ “‰Âý Ēũ‰Č‰Ú‰‘ų Ž‰€‰ã‰ĩ‰ü Š‰Âþ‰Ó
% õ‰‘Ēų Š‰Āų Ļ‰ī; øó‰ü “‰‚ Ļ‰‘Ēð‰ü “‰‘ —‰į‰ƒ‰ƒ‰Â ꉑþ‰Û \InE{}sharifth.sty\EnE{} õ‰ü—‰ö
% ö Ī “‰Âý Ēũ‰Č‰Ú‰‘ųû‰‘ý Ēþ‰Ú‰Â ũ‰ƒ‰Ã “‰‚ Ī “‰ÂĒ. )—‰€‰ú‰‘ ę‰ü Ļ‰ī  ꉁũ‰ī
% õ‰Â“‰Ŋ “‰‚ Īô Ēũ‰Č‰Ú‰‘ų —‰į‰ƒ‰ƒ‰Â ‰Ā.(
%
% —‰›‰‚ ‰ƒ‰Ā  “‰‚ ä‰Ü‰ī Ÿ‰đ‰Ý Ĩþ‰‘Ē ø Ī䉑þ‰ī î‰ģ‰üĪþ‰ī, ė‰Æ‰Þ‰īû‰‘ý Ž‰Ü‰ü þ‰ß
% •‰‘þ‰‘öũ‰‘õ‰‚ Ÿ‰Áé Š‰Āų Ļ‰ī; øó‰ü Ļ‰‘Ą‰ĩ‰‘Ī î‰Ü‰ü ö Ÿ‰Ô‰Ð Š‰Āų Ļ‰ī.
%
% “‰Ā ũ‰ƒ‰Æ‰ī “‰Āũ‰ƒ‰Ā  î‰Û þ‰ß •‰‘þ‰‘öũ‰‘õ‰‚ )ĒĪ 021 Ž‰Ô‰―‰‚( “‰‘ Ļ‰ĩ‰Ô‰‘Ēų Ĩ õ‰Ø‰‘ũ‰‘–
% ꉑĪĻ‰ü—‰Ũ ĒĪ ωü 01 ĪøĨ —‰ú‰ƒ‰‚ Š‰Āų Ļ‰ī!
%

\documentstyle[farsi, sharifth]{freport}
% “‰‚ Ļ‰ĩ‰Ô‰‘Ēų Ĩ \InE{}freport\EnE{} “‰‚ ›‰‘ý \InE{}report\EnE{} Ēė‰ī ‰ƒ‰Ā.
\input{header}      % ꉑþ‰Û \InE{}header\EnE{} Š‰‘õ‰Û “‰ã‰Ė‰ü —‰ã‰‘Īþ‰Ó Ļ‰ī  ĒĪ •‰‘þ‰‘öũ‰‘õ‰‚
                      % “‰‚ Ī Īę‰ĩ‰‚ Ļ‰ī.
%\includeonly{intro,history}
                      % “‰‘ Ļ‰ĩ‰Ô‰‘Ēų Ĩ ĒĻ‰ĩ‰Ī \InE{}includeonly\EnE{} õ‰ü—‰ö —‰€‰ú‰‘ ė‰Æ‰Þ‰ĩ‰ü
                      % Ĩ õ‰ĩ‰ß Ī Ÿ‰Âøę‰ŧ‰ƒ‰€‰ü î‰ÂĒ. þ‰ß ĒĻ‰ĩ‰Ī ĒĪ Ÿ‰ƒ‰ß —‰ú‰ƒ‰‚ý
                      % ð‰ÃĪĐû‰‘ý “‰ÃĪï  Š‰‘õ‰Û ę‰Ę‰Ûû‰‘ý õ‰ŋ‰ĩ‰Ü‰Ó û‰Æ‰ĩ‰€‰Ā Ī“‰ÂĒ
                      % ĒĪĒ. “‰Âý “‰‚ ĒĻ‰ī øĪĒö Ï‰…䉑– “‰ƒ‰Č‰ĩ‰Â ĒĪ þ‰ß õ‰ĪĒ
                      % “‰‚ î‰ĩ‰‘’ Īû‰€‰Þ‰‘ý \InE{}LaTeX\EnE{} õ‰Â›‰ã‰‚ ‰ƒ‰Ā.


\begin{document}

\title{—‰‘ų—‰Âþ‰ß õ‰Æ‰ƒ‰Â ĒĪ Ļ‰Î‰ž ũ‰‘õ‰€‰Ņ‰Ý õ‰·‰Ü‰ķ“‰€‰Āý Š‰Āų}
\author{õ‰―‰Þ‰Ā õ‰ú‰Āþ‰‘ö}
\degree{ĪŠ‰€‰‘Ļ‰ü ũ‰Âôę‰ÃĪ õ‰ģ‰ƒ‰—‰Â}
\thesisdate{“‰‘öõ‰‘ų 6731}
\supervisor{Ēî‰ĩ‰Â õ‰―‰Þ‰Ā ė‰ĀĻ‰ü}
\department{õ‰ú‰€‰ĀĻ‰ü õ‰ģ‰ƒ‰—‰Â}

\maketitle                    % Ž‰Ô‰―‰‚ý øņ )䉀‰ö( —‰ó‰ƒ‰Ā õ‰üŠ‰Ē.
\begin{acknowledgementpage}   % Ž‰Ô‰―‰‚ý ė‰ĀĪĒũ‰ü
ĒĪ þ‰ß›‰‘ „Ĩô Ļ‰ī Ĩ î‰Ü‰ƒ‰‚ý ę‰ÂĒý  õ‰Â ĒĪ ũ‰đ‰‘ô þ‰ß •‰ÂøĶų î‰Þ‰Ũ ũ‰Þ‰Ēųũ‰Ā,
Ą‰Ę‰Ž‰\nasb ‘ Ļ‰ĩ‰‘Ē ð‰Âõ‰ü ė‰‘ý Ēî‰ĩ‰Â õ‰―‰Þ‰Ā ė‰ĀĻ‰ü  ĒĪ —‰Þ‰‘ô õ‰ÂŸ‰Û ũ‰đ‰‘ô þ‰ß
•‰ÂøĶų “‰‘ õ‰Æ‰‘ä‰Ā–û‰‘ ø Īû‰€‰Þ‰‘þ‰üû‰‘ý “‰üĒĪþ‰æ Ą‰Ē õ‰Â þ‰‘Īý î‰ÂĒũ‰Ā, —‰Č‰Ø‰Â ‰Ý.
\end{acknowledgementpage}
\begin{abstractpage}          % Ž‰Ô‰―‰‚ý ‰Ø‰ƒ‰Āų
þ‰Ø‰ü Ĩ õ‰Æ‰‘Ž‰Ü‰ü  ĒĪ û‰€‰ĀĻ‰‚ý õ‰―‰‘Ļ‰ą‰‘—‰ü ø Ļ‰ƒ‰Æ‰ĩ‰Ýû‰‘ý \InE{}GIS\EnE{} õ‰Î‰Âž õ‰üŠ‰Ē, •‰ƒ‰Ā
î‰ÂĒö —‰‘ų—‰Âþ‰ß õ‰Æ‰ƒ‰Â “‰ƒ‰ß Ēø ũ‰Ö‰Î‰‚ Ĩ þ‰Ũ Ļ‰Î‰ž Ļ‰ī.
û‰Āé Ĩ þ‰ß •‰ÂøĶų, “‰ÂĪĻ‰ü ó‰Ú‰Īþ‰ĩ‰Ýû‰‘ý õ‰ŋ‰ĩ‰Ü‰Ó —‰‘ų—‰Âþ‰ß õ‰Æ‰ƒ‰Â “‰Â Īøý þ‰Ø‰ü Ĩ 
õ‰Āņû‰‘ý Ļ‰Î‰ž, þ‰ã‰€‰ü Ļ‰Î‰ž ũ‰‘õ‰€‰Ņ‰Ý õ‰·‰Ü‰ķ“‰€‰Āý Š‰Āų )\InE{}TIN\EnE{}( ø •‰ƒ‰‘ĒųĻ‰‘Ĩý “‰ÂĄ‰ü Ĩ þ‰ß 
ó‰Ú‰Īþ‰ĩ‰Ýû‰‘Ļ‰ī. ĒĪ þ‰ß •‰ÂøĶų “‰ú‰ĩ‰Âþ‰ß ó‰Ú‰Īþ‰ĩ‰Ý Ēė‰ƒ‰Õ õ‰›‰Ē •‰ƒ‰‘ĒųĻ‰‘Ĩý Š‰Āų Ļ‰ī ø 
þ‰Ũ ó‰Ú‰Īþ‰ĩ‰Ý —‰Ö‰Âþ‰ą‰ü Ļ‰Âþ‰â—‰Â ũ‰ƒ‰Ã “‰Âý þ‰ß õ‰Æ‰ĸ‰Ü‰‚ •‰ƒ‰Č‰€‰ú‰‘Ē Š‰Āų Ļ‰ī.
\keywords{û‰€‰ĀĻ‰‚ý õ‰―‰‘Ļ‰ą‰‘—‰ü, \InE{}GIS\EnE{}, —‰‘ų—‰Âþ‰ß õ‰Æ‰ƒ‰Â, Š‰ą‰Ø‰‚û‰‘ý ũ‰‘õ‰€‰Ņ‰Ý õ‰·‰Ü‰ķ“‰€‰Āý Š‰Āų
)\InE{}TIN\EnE{}(}
\end{abstractpage}

\setcounter{page}{1}  % Š‰Þ‰‘Īųý Ž‰Ô‰―‰‚ Ĩ 1 Š‰Âøá õ‰üŠ‰Ē.
\tableofcontents        % ę‰ú‰ÂĻ‰ī õ‰€‰Ā›‰‘– Ī —‰ó‰ƒ‰Ā õ‰ü‰Ā.
%%%\listoffigures          % 󉃉Ɖī Š‰Ø‰‘ņ Ī —‰ó‰ƒ‰Ā õ‰ü‰Ā.

\include{intro}       % ę‰Ę‰Û 1: õ‰Ö‰Āõ‰‚
\include{tin}         % ę‰Ę‰Û 2: Ļ‰Î‰ž ũ‰‘õ‰€‰Ņ‰Ý õ‰·‰Ü‰ķ“‰€‰Āý Š‰Āų
\include{history}     % ę‰Ę‰Û 3: —‰‘Īþ‰ŋ‰ŧ‰‚ý õ‰Æ‰‘þ‰Û —‰‘ų—‰Âþ‰ß õ‰Æ‰ƒ‰Â
\include{algor}       % ę‰Ę‰Û 4: —‰Č‰Âþ‰ž “‰ÂĄ‰ü Ĩ ó‰Ú‰Īþ‰ĩ‰Ýû‰‘
\include{implemen}    % ę‰Ę‰Û 5: •‰ƒ‰‘ĒųĻ‰‘Ĩý ó‰Ú‰Īþ‰ĩ‰Ý
\include{proposed}    % ę‰Ę‰Û 6: ó‰Ú‰Īþ‰ĩ‰Ý •‰ƒ‰Č‰€‰ú‰‘Ēý
\include{conclude}    % ę‰Ę‰Û 7: Ą‰…Ž‰‚ ø ũ‰ĩ‰ƒ‰đ‰‚ð‰ƒ‰Âý

\appendix               % •‰ƒ‰Ļ‰īû‰‘:

\include{source}      % õ‰ĩ‰ß “‰Âũ‰‘õ‰‚ý Ž‰Ü‰ü
\include{approx}      % õ‰ĩ‰ß “‰Âũ‰‘õ‰‚ý —‰Ö‰Âþ‰ą‰ü
\include{datagen}     % õ‰ĩ‰ß “‰Âũ‰‘õ‰‚ý —‰ó‰ƒ‰Ā ĒĒų

\include{dic1}        % øĶųũ‰‘õ‰‚ ꉑĪĻ‰ü “‰‚ ũ‰Ú‰Ü‰ƒ‰Æ‰ü
\include{dic2}        % øĶųũ‰‘õ‰‚ ũ‰Ú‰Ü‰ƒ‰Æ‰ü “‰‚ ꉑĪĻ‰ü
\include{bib}         % õ‰Â›‰â

\english
\oddsidemargin=1.5cm
\englishtitle{Shortest Path Problem in Triangulated Irregular Networks}
\englishauthor{Mohammad Mahdian}
\englishdegree{Bachelor of Science \\ in \\ Computer Engineering (Software)}
\englishthesisdate{November 1997}
\englishsupervisor{Dr. Mohammad Ghodsi}
\englishdepartment{Computer Engineering Department}
\begin{englishabstract}
One of the problems in the field of computational geometry and GIS, 
is the problem of finding the shortest path between two points on
a surface. In this project, we will review different algorithms for
finding the shortest path between two points on a Triangulated Irregular
Network (TIN), which is one of the models of a surface. The most
efficient known algorithm is implemented and a more efficient 
approximate scheme for this problem is introduced.
\englishkeywords{Computational Geometry, GIS, Shortest Path, Triangulated
Irregular Network (TIN)}
\end{englishabstract}
\makeenglishtitle
\end{document}