We present hierarchical occlusion maps (HOM) for visibility culling on complex models with
high depth complexity. The culling algorithm uses an object space bounding volume …

We present an algorithm and a system for accelerated display of massive static and dynamic
environments using hierarchical simplification. Given a geometric dataset, we represent it …

Visualization of very complex scenes can be significantly accelerated using occlusion
culling. In this paper we present a visibility preprocessing method which efficiently computes …

The past two decades have witnessed an explosion in the deployment of large-scale
distributed simulations and distributed virtual environments in different domains, including …

We present a new output-sensitive rendering algorithm, the randomized z-buffer algorithm. It
renders an image of an arbitrary three-dimensional scene consisting of triangular primitives …

We present an OpenGL-assisted visibility culling algorithm to improve the rendering
performance of large polygonal models. Using a combination of hierarchical model-space …

In a process for rendering a 3-dimensional graphics Scene made up of a plurality of Static
and/or dynamic objects composed of geometrical elements, a method for obviating …

The authors describe a software system supporting interactive visualization of large terrains
in a resource-limited environment, ie a low-end client computer accessing a large terrain …

Visibility computation is crucial for computer graphics from its very beginning. The first
visibility algorithms aimed to determine visible lines or surfaces in a synthesized image of a …

We describe a novel algorithm for visibility ordering among non-overlapping geometric
objects in complex and dynamic environments. Our algorithm rearranges the objects in a …