Results 1  10
of
1,010
A characterization of ten hiddensurface algorithms
 ACM Computing Surveys
, 1974
"... This paper discusses the h~ddensurface problem from the point of view of sorting. The various surfaces of an object to be shown in hiddensurface or h~ddenline form must be sorted to find out which ones are visible at various places on the screen. Surfaces may be sorted by lateral position in the ..."
Abstract

Cited by 227 (4 self)
 Add to MetaCart
This paper discusses the h~ddensurface problem from the point of view of sorting. The various surfaces of an object to be shown in hiddensurface or h~ddenline form must be sorted to find out which ones are visible at various places on the screen. Surfaces may be sorted by lateral position in the
Generalized Hidden Surface Removal
 COMPUT. GEOM. THEORY APPL
, 1993
"... In this paper we study the following generalization of the classical hidden surface removal problem: given a set S of objects, a view point and a point light source, compute which parts of the objects in S are visible, subdivided into parts that are lit and parts that are not lit. We prove ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
In this paper we study the following generalization of the classical hidden surface removal problem: given a set S of objects, a view point and a point light source, compute which parts of the objects in S are visible, subdivided into parts that are lit and parts that are not lit. We prove
The Abuffer, an Antialiased Hidden Surface Method
 IN COMPUTER GRAPHICS
, 1984
"... The Abuffer (antialiased, areaaveraged, accumulation buffer) is a general hidden surface mechanism suited to medium scale virtual memory computers. It resolves visibility among an arbitrary collection of opaque, transparent, and intersecting objects. Using an easy to compute Fourier window (box f ..."
Abstract

Cited by 175 (0 self)
 Add to MetaCart
The Abuffer (antialiased, areaaveraged, accumulation buffer) is a general hidden surface mechanism suited to medium scale virtual memory computers. It resolves visibility among an arbitrary collection of opaque, transparent, and intersecting objects. Using an easy to compute Fourier window (box
Spheres, Molecules, and Hidden Surface Removal
, 1996
"... We devise techniques to manipulate a collection of loosely interpenetrating spheres in threedimensional space. Our study is motivated by the representation and manipulation of molecular con gurations, modeled by a collection of spheres. We analyze the sphere model and point toitsfavorable properties ..."
Abstract

Cited by 47 (12 self)
 Add to MetaCart
properties that make it more easy to manipulate than an arbitrary collection of spheres. For this special sphere model we present e cient algorithms for computing its union boundary and for hidden surface removal. The e ciency and practicality of our approach are demonstrated by experiments on actual
A solution to the hidden surface problem
 In Proceedings of the ACM National Conference
, 1972
"... A method for producing halftone pictures by computer is presented. The basic method, which is very simple, works well in most cases, but does not handle all objects correctly. The extended method, which copes with all cases, is also described. The functions used for calculating the intensity of par ..."
Abstract

Cited by 53 (0 self)
 Add to MetaCart
WDRDS AND PHRASES: graphics, computeraided design, computer art, curved surfaces, hiddenline, hiddensurface, visiblesurface, halftone, greyscale, shading, raster scan, videodisc
Hidden surface Removal
"... � � After projection, several stages before objects drawn to screen � � These stages are non‐programmable ..."
Abstract
 Add to MetaCart
� � After projection, several stages before objects drawn to screen � � These stages are non‐programmable
Hidden Surface Removal Using Polygon Area Sorting
 Computer Graphics
, 1977
"... A polygon hidden surface and hidden line removal algorithm is presented. The algorithm recursively subdivides the image into polygon shaped windows until the depth order within the window is found. Accuracy of the input data is preserved. The approach is based on a twodimensional polygon clipper wh ..."
Abstract

Cited by 87 (0 self)
 Add to MetaCart
A polygon hidden surface and hidden line removal algorithm is presented. The algorithm recursively subdivides the image into polygon shaped windows until the depth order within the window is found. Accuracy of the input data is preserved. The approach is based on a twodimensional polygon clipper
Finite Resolution Hidden Surface Removal
"... We propose a hybrid imagespace/objectspace solution to the classical hidden surface removal problem: Given # disjoint triangles in IR and # sample points (\pixels") in the ##plane, determine the rst triangle directly behind each pixel. Our algorithm constructs the ####### ########## ### ..."
Abstract
 Add to MetaCart
We propose a hybrid imagespace/objectspace solution to the classical hidden surface removal problem: Given # disjoint triangles in IR and # sample points (\pixels") in the ##plane, determine the rst triangle directly behind each pixel. Our algorithm constructs
FiniteResolution Hidden Surface Removal
"... We propose a hybrid imagespace/objectspace solution to the classical hidden surface removal problem: Given n disjoint triangles in R³ and p sample points ("pixels") in the xyplane, determine the rst triangle directly behind each pixel. Our algorithm constructs the sampled visibility map ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We propose a hybrid imagespace/objectspace solution to the classical hidden surface removal problem: Given n disjoint triangles in R³ and p sample points ("pixels") in the xyplane, determine the rst triangle directly behind each pixel. Our algorithm constructs the sampled visibility
An Efficient Algorithm For Hidden Surface Removal
"... We give an efficient, randomized hidden surface removal algorithm, with the best time complexity so far. A distinguishing feature of this algorithm is that the expected time spent by this algorithm on junctions which are at the "obstruction level " 1, with respect to the viewer, is inverse ..."
Abstract
 Add to MetaCart
We give an efficient, randomized hidden surface removal algorithm, with the best time complexity so far. A distinguishing feature of this algorithm is that the expected time spent by this algorithm on junctions which are at the "obstruction level " 1, with respect to the viewer
Results 1  10
of
1,010