A scalable cluster-based parallel simplification framework for height fields

  • Authors:
  • V. Gouranton;S. Limet;S. Madougou;E. Melin

  • Affiliations:
  • Laboratoire d'Informatique Fondamentale d'Orléans, Orléans, France;Laboratoire d'Informatique Fondamentale d'Orléans, Orléans, France;Laboratoire d'Informatique Fondamentale d'Orléans, Orléans, France and Bureau de Recherches Minières et Géologiques, France;Laboratoire d'Informatique Fondamentale d'Orléans, Orléans, France

  • Venue:
  • EG PGV'04 Proceedings of the 5th Eurographics conference on Parallel Graphics and Visualization
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we present a method to interactively render 3D large datasets on a PC Cluster. Classical methods use simplification to fill up the gap between such models and graphics card capabilities. Unfortunatelly, simplification algorithms are time and memory consuming and they allow real-time interaction only for a restricted size of models. This work focuses on parallelizing Rottger's simplification algorithm for height fields but the main ideas can be generalized to other scientific areas. The method benefits from the scalable computating power of clusters. As our results show it, this permits us to achieve a data scaling while maintaining an acceptable frame rate with real-time interaction. Moreover, the scheme can take avantage of tiled-display environments.