Results 11  20
of
1,010
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 Algorithms for Curved Surfaces
"... Computing the visible portions of curved surfaces from a given viewpoint is of great interest in many applications. It is closely related to the hidden surface removal problem in computer graphics and machining applications in manufacturing. Most of the earlier work has focused on discrete methods b ..."
Abstract
 Add to MetaCart
Computing the visible portions of curved surfaces from a given viewpoint is of great interest in many applications. It is closely related to the hidden surface removal problem in computer graphics and machining applications in manufacturing. Most of the earlier work has focused on discrete methods
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
The Object Complexity Model For HiddenSurface Removal
, 1998
"... We define a new model of complexity, called object complexity, for measuring the performance of hiddensurface removal algorithms. This model is more appropriate for predicting the performance of these algorithms on current graphics rendering systems than the standard measure of scene complexity ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We define a new model of complexity, called object complexity, for measuring the performance of hiddensurface removal algorithms. This model is more appropriate for predicting the performance of these algorithms on current graphics rendering systems than the standard measure of scene complexity
Parallel ObjectSpace Hidden Surface Removal
, 1990
"... A parallel objectspace hidden surface removal algorithm for polyhedral scenes is presented. The uniform grid technique is used to achieve parallelism for the hidden line removal. A conflictdetection and backoff strategy is then used to obtain parallelism for the visible region reconstruction from ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
A parallel objectspace hidden surface removal algorithm for polyhedral scenes is presented. The uniform grid technique is used to achieve parallelism for the hidden line removal. A conflictdetection and backoff strategy is then used to obtain parallelism for the visible region reconstruction
OutputSensitive Hidden Surface Elimination for Rectangles
, 1988
"... We present an algorithm for the wellknown hiddensurface elimination problem for rectangles, which is also known as the window rendering problem. The time complexity of our algorithm is sensitive to the size of the output. Specifically, it runs in time that is O(n1mS + k), where k is the size of th ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present an algorithm for the wellknown hiddensurface elimination problem for rectangles, which is also known as the window rendering problem. The time complexity of our algorithm is sensitive to the size of the output. Specifically, it runs in time that is O(n1mS + k), where k is the size
Efficient Binary Space Partitions for HiddenSurface Removal and Solid Modeling
, 1990
"... We consider schemes for recursively dividing a set of geometric objects by hyperplanes until all objects are separated. Such a binary space partition, or BSP, is naturally considered as a binary tree where each internal node corresponds to a division. The goal is to choose the hyperplanes properly ..."
Abstract

Cited by 103 (0 self)
 Add to MetaCart
applications of efficient BSPs are given. The first is an O(n²)sized data structure for implementing a hiddensurface removal scheme of Fuchs et al. [6]. The second application is in solid modeling: given a polyhedron described by its n faces, we show how to generate an O(n²)sized CSG (constructive
CS 4731: Computer Graphics Lecture 17: Hidden Surface Removal Emmanuel AguHidden surface Removal
"... Drawing polygonal faces on screen consumes CPU cycles We cannot see every surface in scene To save time, draw only surfaces we see Surfaces we cannot see and their elimination methods: Occluded surfaces: hidden surface removal (visibility) ..."
Abstract
 Add to MetaCart
Drawing polygonal faces on screen consumes CPU cycles We cannot see every surface in scene To save time, draw only surfaces we see Surfaces we cannot see and their elimination methods: Occluded surfaces: hidden surface removal (visibility)
GPUAccelerated HighQuality Hidden Surface Removal
"... Highquality offline rendering requires many features not natively supported by current commodity graphics hardware: wide smooth filters, high sampling rates, orderindependent transparency, spectral opacity, motion blur, depth of field. We present a GPUbased hiddensurface algorithm that implemen ..."
Abstract
 Add to MetaCart
Highquality offline rendering requires many features not natively supported by current commodity graphics hardware: wide smooth filters, high sampling rates, orderindependent transparency, spectral opacity, motion blur, depth of field. We present a GPUbased hiddensurface algorithm
Results 11  20
of
1,010