This paper presents a new multiresolution model based exclusively on the triangle strip primitive. The model is independent of the initial set of triangle strips and the simplification method used to obtain the lower resolution versions of the original model. The information stored in the data structures is sorted to minimise the time needed to recover a Level of Detail (LoD). The orientation o...

In this paper, we present a simple and practical method for determining the front-facing polygons for static, dynamic, and deformable objects. The object space is considered a set of open-frustum regions. A bit string associated with each region records polygons for their extended positive half space intersecting the corresponding region. For a given viewpoint, the bit string of the set of the ...

For a continuous-time Bienaymé–Galton–Watson process, X, with immigration and culling, 0 as an absorbing state, call Xq the process that results from killing X at rate q∈(0,∞), followed by stopping it on extinction or explosion. Then explicit identification of relevant harmonic functions allows to determine Laplace transforms (at argument q) first passage times downwards explosion time for X. S...

We present a technique to perform occlusion culling for hierarchical terrains at run-time. The algorithm is simple to implement and requires minimal pre-processing and additional storage, yet leads to 4-6 times improvement in framerate for views with high degrees of occlusion. Our method is based on the well-known occlusion horizon algorithm. We show how to adapt the algorithm for use with hier...

Large quantities of simulated cosmological particle data cause considerable problems when it comes to real-time visualization. In this paper, an efficient approach to solve visualization problems on a single desktop workstation is considered. The approach proposed in this paper consists of two phases: a data preprocessing and its visualization. During the preprocessing, the cosmological data is...