Dariusz Dalecki
Bogdan Wiszniewski
ABSTRACT
The paper presents final results of the project aimed at interactive visualisation of a terrain based on real spatial data, which was one of the tasks of the CLUSTERIX project. Practical aspects of various performance issues are addressed in particular to verify adequacy of using PC-clusters in graphical applications.
- Hoppe, H.: Smooth View-Dependent Level-of-Detail Control and its Application to Terrain Rendering. research.microsoft.com/hoppe/svdlod.pdfGoogle Scholar
- Lebiedz, J., Mieloszyk, K.: Real Terrain Visualisation on the Basis of GIS Data. In: Bolc, L., Michalewicz, Z., Nishida, T. (eds.) IMTCI 2004. LNCS (LNAI), vol. 3490, pp. 40-49. Springer, Heidelberg (2005). Google ScholarDigital Library
- Lebiedz, J., Mieloszyk, K., Wiszniewski, B.: Real Terrain Visualisation with a Distributed PC-Cluster. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Wasniewski, J. (eds.) PPAM 2005. LNCS, vol. 3911, pp. 349-356. Springer, Heidelberg (2006). Google ScholarDigital Library
- Duchaineau, M., Wolinsky, M., Sigeti, D.E., Miller, M.C.: Aldrich Ch., and Mineev-Weinstein M.B. ROAMing Terrain: Real-time Optimally Adapting Meshes, http://www.llnl.gov/graphics/ROAMGoogle Scholar
- Garland, M., Hecbert, P.S.: Fast Polygonal Approximatio of Terrains and Height Fields. gpraphics.cs.uiuc.edu/garland/CMU/scape/scape.pdfGoogle Scholar
- Wyrzykowski, R., Meyer, N., Stroinski, M.: Clusterix: National Cluster of Linux Systems (2002), http://www.clusterix.plGoogle Scholar
- Shuttle Radar Topography Mission. NASA, http://www2.jpl.nasa.gov/srtmGoogle Scholar
Recommendations
Optimizing star-coordinate visualization models for effective interactive cluster exploration on big data
Interactive visual cluster analysis is the most intuitive way for finding clustering patterns, validating algorithmic clustering results, understanding data clusters with domain knowledge, and refining cluster definitions. The most challenging step is ...
Simplification of unstructured tetrahedral meshes by point sampling
VG'05: Proceedings of the Fourth Eurographics / IEEE VGTC conference on Volume GraphicsTetrahedral meshes are widely used in scientific computing for representing three-dimensional scalar, vector, and tensor fields. The size and complexity of some of these meshes can limit the performance of many visualization algorithms, making it hard ...
Mesh simplification algorithm based on n-edge mesh collapse
ICAT'06: Proceedings of the 16th international conference on Advances in Artificial Reality and Tele-ExistenceThis paper presents a method for dividing the triangle mesh into n-edge mesh and puts forward a new mesh simplification algorithm based on n-edge mesh collapse. An n-edge mesh can be in the form of an edge, a triangle or a quadrangle, it depends on the ...
Comments