The thesis proposes a taxonomy of visibility (vis.) problems based on the dimension of the problem-relevant line set, i.e. set of lines forming the domain of the vis. problem. The taxonomy helps to identify relationships between vis. problems from various application areas by grouping together problems of similar complexity. The thesis presents a general concept of a vis. algorithm (alg.) suitable for solution of several classes of vis. problems. The concept is based on 3 main ideas: an approximate occlusion sweep, an occlusion tree and hierarchical vis. tests. The central idea of the concept is the occlusion tree representing an aggregated occlusion map by means of a hierarchical subdivision in line space. The thesis presents several appli...
Occlusion culling and level-of-detail rendering have become two powerful tools for accelerating the ...
Visibility problems are central to many computer graphics applications. The most common examples inc...
The most expensive geometric operation in image synthesis is visibility determination. Classically t...
This paper describes a new occlusion culling technique for efficient visibility determination in rea...
Virtual environments are rapidly growing in size and complexity. At the sametime, there is a strong ...
To pre-process a scene for the purpose of visibility culling during walkthroughs it is necessary to ...
To pre-process a scene for the purpose of visibility culling during walkthroughs it is necessary to ...
To pre-process a scene for the purpose of visibility culling during walkthroughs it is necessary to ...
This thesis describes techniques for computing conservative visibility exploiting viewpoint predicti...
AbstractEfficiently identifying polygons that are visible from a changing synthetic viewpoint is an ...
Occlusion culling and level-of-detail rendering have become two powerful tools for accelerating the ...
International audienceMany problems in computer graphics and computer vision require accurate global...
Efficiently identifying polygons that are visible from a dynamic synthetic viewpoint is an important...
AbstractEfficiently identifying polygons that are visible from a changing synthetic viewpoint is an ...
Visibility testing is an integral part of many computer graphics algorithms. For example, algorithms...
Occlusion culling and level-of-detail rendering have become two powerful tools for accelerating the ...
Visibility problems are central to many computer graphics applications. The most common examples inc...
The most expensive geometric operation in image synthesis is visibility determination. Classically t...
This paper describes a new occlusion culling technique for efficient visibility determination in rea...
Virtual environments are rapidly growing in size and complexity. At the sametime, there is a strong ...
To pre-process a scene for the purpose of visibility culling during walkthroughs it is necessary to ...
To pre-process a scene for the purpose of visibility culling during walkthroughs it is necessary to ...
To pre-process a scene for the purpose of visibility culling during walkthroughs it is necessary to ...
This thesis describes techniques for computing conservative visibility exploiting viewpoint predicti...
AbstractEfficiently identifying polygons that are visible from a changing synthetic viewpoint is an ...
Occlusion culling and level-of-detail rendering have become two powerful tools for accelerating the ...
International audienceMany problems in computer graphics and computer vision require accurate global...
Efficiently identifying polygons that are visible from a dynamic synthetic viewpoint is an important...
AbstractEfficiently identifying polygons that are visible from a changing synthetic viewpoint is an ...
Visibility testing is an integral part of many computer graphics algorithms. For example, algorithms...
Occlusion culling and level-of-detail rendering have become two powerful tools for accelerating the ...
Visibility problems are central to many computer graphics applications. The most common examples inc...
The most expensive geometric operation in image synthesis is visibility determination. Classically t...