𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Visibility analysis on a massively data-parallel computer

✍ Scribed by Germain, Daniel; Laurendeau, Denis; Vézina, Guy

Publisher
John Wiley and Sons
Year
1996
Tongue
English
Weight
737 KB
Volume
8
Category
Article
ISSN
1040-3108

No coin nor oath required. For personal study only.

✦ Synopsis

Visibility analysis algorithms use digital elevation models OEMs), which represent terrain topography, to determine visibility at each point on the terrain from a given location in space. This analysis can be computationally very demanding, particularly when manipulating high resolution DEMs accurately at interactive response rates. Massively data-parallel computers offer high computing capabilities and are very well-suited to handling and processing large regular spatial data structures. In the paper, the authors present a new scanline-based data-parallel algorithm for visibility analysis. Results from an implementation onto a MasPar massively data-parallel SIMD computer are also presented.

📜 SIMILAR VOLUMES

Ordinary linear model estimation on a ma
Ordinary linear model estimation on a massively parallel SIMD computer
✍ Kontoghiorghes, Erricos John 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 220 KB 👁 2 views

Dedicated to the late M. R. B. Clarke SUMMARY Efficient algorithms for estimating the coefficient parameters of the ordinary linear model on a massively parallel SIMD computer are presented. The numerical stability of the algorithms is ensured by using orthogonal transformations in the form of House

Analysis of Multigrid Algorithms on Mass
Analysis of Multigrid Algorithms on Massively Parallel Computers: Architectural Implications
✍ Lesley R. Matheson; Robert E. Tarjan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 234 KB

We study the potential performance of multigrid algorithms running on massively parallel computers with the intent of discovering whether currently envisioned machines will provide an efficient platform for such algorithms. These algorithms substantially improve the performance of iterative methods

A new direct MP2 gradient algorithm with
A new direct MP2 gradient algorithm with implementation on a massively parallel computer
✍ Ida M.B. Nielsen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 464 KB

A new direct second-order Moller-Plesset gradient algorithm is presented. By avoiding generation of molecular orbital integrals with three virtual indices, the memory requirement for a calculation with n basis functions and o occupied orbitals is reduced to on 2, and overall computational savings ar