This paper presents a theoretical approach that has been developed to capture the
computational intensity and computing resource requirements of geographical data and …

This survey gives a brief overview of theoretically and practically relevant algorithms to
compute geodesic paths and distances on three-dimensional surfaces. The survey focuses …

Integrated spatio-temporal assessment and modelling of complex social–ecological systems
is required to address global environmental challenges. However, the computational …

MODerate resolution atmospheric TRANsmission (MODTRAN) is a commercial remote
sensing (RS) software package that has been widely used to simulate radiative transfer of …

This article presents a simple yet effective method for computing geodesic distances on
triangle meshes. Unlike the popular window propagation methods that partition mesh edges …

Proposed algorithms for calculating the shortest paths such as Dijikstra and Flowd-
Warshall's algorithms are limited to small networks due to computational complexity and …

The Intelligent Map Agents (IMA) is an agent-based framework aimed at providing access to,
and support for the manipulation of, spatial information. The IMA is designed as an open …

In this paper we discuss the problem of determining a meeting point of a set of scattered
robots R={r1, r2,..., rs} in a weighted terrain P which has n> s triangular faces. Our …

In response to the problem of how to give geographic information system (GIS) high-
performance capabilities for certain specific GIS applications, a new GIS research direction …

This chapter shows the results of the parallel computation of the potential visual exposure
(PVE) for the whole area of Slovakia. We have developed a toolkit which uses the Viewshed …