Περίληψη:
This paper presents an implementation of a parallel numerical - searching algorithm,
which is used for the insetting procedure in cartography. The main idea was to
optimize the existing searching algorithm to find the maximum inset on the map
from the area we choose. The calculation time of the above procedure is very long
due to the fact that the datasets in cartography are maps with large and very large resolution.
The purpose of this proposal is to reduce the calculation time in a multicore
machine with shared memory. The proposed algorithm and the performance tests are
developed in Matlab Parallel Toolbox.