A generalization of the z-buffer algorithm is given that allows for dynamic updates of a screen image without the necessity of re-drawing the entire scene. It is based on the notion of equivalent classes of pixels, that is groups of pixels that are covered by the same set of polygons. A data structure for representing these equivalence classes in an efficient manner is discussed
Shadows are important in enhancing both the realism and the intelligibility of synthetic 2D images o...
This paper describes two algorithms and implicit data structures to display 3D scenes composed of po...
This paper presents algorithms for object-space parallel polygon rendering on hypercube-connected mu...
A generalization of the z-buffer algorithm is given that allows for dynamic updates of a screen imag...
This paper describes a new perspective on a fundamental algorithm of three-dimensional computer grap...
An ideal visibility algorithm should a) quickly reject most of the hidden geometry in a model and b)...
1 Introduction Existing rendering algorithms offer only the un-pleasant choice between low quality a...
A new algorithm for image-space CSG rendering is presented, based on subtraction of convex objects i...
The wide availability of hardwired Z-buffer has sparked an explosion in the number of applications o...
In many applications such as computer-aided design (CAD), drafting, descriptive geometry, geometric ...
A new algorithm for image-space CSG rendering is presented, based on subtraction of convex objects i...
With a small modification the z-buffer can be made flexible enough to be used in global illumination...
The wide availability of hardwired Z-buffer has sparked an explosion in the number of applications o...
This paper deals with the implementation of algorithms in the specific domain of image processing. A...
International audienceThis paper describes the parallel implementation of the Zbuffer algorithm on d...
Shadows are important in enhancing both the realism and the intelligibility of synthetic 2D images o...
This paper describes two algorithms and implicit data structures to display 3D scenes composed of po...
This paper presents algorithms for object-space parallel polygon rendering on hypercube-connected mu...
A generalization of the z-buffer algorithm is given that allows for dynamic updates of a screen imag...
This paper describes a new perspective on a fundamental algorithm of three-dimensional computer grap...
An ideal visibility algorithm should a) quickly reject most of the hidden geometry in a model and b)...
1 Introduction Existing rendering algorithms offer only the un-pleasant choice between low quality a...
A new algorithm for image-space CSG rendering is presented, based on subtraction of convex objects i...
The wide availability of hardwired Z-buffer has sparked an explosion in the number of applications o...
In many applications such as computer-aided design (CAD), drafting, descriptive geometry, geometric ...
A new algorithm for image-space CSG rendering is presented, based on subtraction of convex objects i...
With a small modification the z-buffer can be made flexible enough to be used in global illumination...
The wide availability of hardwired Z-buffer has sparked an explosion in the number of applications o...
This paper deals with the implementation of algorithms in the specific domain of image processing. A...
International audienceThis paper describes the parallel implementation of the Zbuffer algorithm on d...
Shadows are important in enhancing both the realism and the intelligibility of synthetic 2D images o...
This paper describes two algorithms and implicit data structures to display 3D scenes composed of po...
This paper presents algorithms for object-space parallel polygon rendering on hypercube-connected mu...