Results 1  10
of
12,324
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
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
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
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
Repetitive Hidden Surface Removal for Polyhedra
 J. Algorithms
, 1995
"... The repetitive hiddensurfaceremoval problem can be rephrased as the problem of finding the most compact representation of all views of a polyhedral scene that allows efficient online retrieval of a single view. We assume that a polyhedral scene in 3space is given in advance and is preprocesse ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
The repetitive hiddensurfaceremoval problem can be rephrased as the problem of finding the most compact representation of all views of a polyhedral scene that allows efficient online retrieval of a single view. We assume that a polyhedral scene in 3space is given in advance
Repetitive HiddenSurfaceRemoval for Polyhedra
, 1993
"... The repetitive hiddensurfaceremoval problem can be rephrased as the problem of finding the most compact representation of all views of a polyhedral scene that allows efficient online retrieval of a single view. In this paper we present a novel approach to this problem. We assume that a polyhedral ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The repetitive hiddensurfaceremoval problem can be rephrased as the problem of finding the most compact representation of all views of a polyhedral scene that allows efficient online retrieval of a single view. In this paper we present a novel approach to this problem. We assume that a
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
Dynamic Binary Space Partitioning for Hidden Surface Removal
"... This paper describes a new technique for dynamic binary space partitioning with applications to the dynamic hidden surface removal problem of polygons. The dynamic hidden surface removal problem is to determine and maintain visible surfaces in 3D set of polygons from a given viewpoint under changes ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
This paper describes a new technique for dynamic binary space partitioning with applications to the dynamic hidden surface removal problem of polygons. The dynamic hidden surface removal problem is to determine and maintain visible surfaces in 3D set of polygons from a given viewpoint under
Results 1  10
of
12,324