A scheme for arbitrary nesting of algorithmic skeletons is explained which is based on the idea of groups in MPI. The scheme is part of a semi-automatic compilation system which generates parallel code for nested HOFs. Two skeletons were developed which run in a nested mode: a binary divide and conquer and a process farm for a parallel implementation of fold and map HOFs respectively. Examples ...

Programming models based on algorithmic skeletons promise to raise the level of abstraction perceived by programmers when implementing parallel applications, while guaranteeing good performance figures. At the same time, however, they restrict the freedom of programmers to implement arbitrary parallelism exploitation patterns. In fact, efficiency is achieved by restricting the parallelism explo...

Once thought of being useful primarily for planning the location of telecommunication antennas, it has become clear in the meantime that three-dimensional city models are of importance in their own right. This paper presents some of our latest results on the reconstruction of building models from laser scanning DSM’s and digital ground plans. First, we show how buildings can be reconstructed fr...