Results 1  10
of
236
Comprehensible Rendering of 3D Shapes
, 1990
"... We propose a new rendering technique that produces 3D images with enhanced visual comprehensibility. Shape features can be readily understood if certain geometric properties are enhanced. To achieve this, we develop drawing algorithms for discontinuities, edges, contour lines, and curved hatchin ..."
Abstract

Cited by 293 (0 self)
 Add to MetaCart
hatching. All of them are realized with 2D image processing operations instead of line tracking processes, so that they can be efficiently combined with conventional surface rendering algorithms. Data about the geometric properties of the surfaces are preserved as Geometric Buffers (Gbuffers). Each Gbuffer
The G²Buffer Framework
 In Simulation and Visualization
, 2004
"... The geometric buffer (Gbuffer) is a wellknown approach to implement imagebased rendering algorithms. We propose a framework that maps the Gbuffer concept and associated imagespace operations to the graphics processing unit (GPU). ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
The geometric buffer (Gbuffer) is a wellknown approach to implement imagebased rendering algorithms. We propose a framework that maps the Gbuffer concept and associated imagespace operations to the graphics processing unit (GPU).
Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers
"... We study packet buffering, a basic problem occurring in network switches. We construct an optimal 16/13competitive randomized online algorithm PB for the case of two input buffers of arbitrary sizes. Our proof is based on geometrical transformations which allow to identify the set of sequences incu ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We study packet buffering, a basic problem occurring in network switches. We construct an optimal 16/13competitive randomized online algorithm PB for the case of two input buffers of arbitrary sizes. Our proof is based on geometrical transformations which allow to identify the set of sequences
The PathBuffer
"... With a small modification the zbuffer can be made flexible enough to be used in global illumination algorithms traditionally handled only by ray casting, but still enjoy the benefits of zbuffer algorithms including predictable performance, memory coherence, and acceleration using specialized zbuf ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
meshing or perelement storage is needed, very large and complex models may be illuminated. Both diffuse and nondiffuse reflectance functions can be handled as well any complex geometric primitives which can be rasterized (e.g. displacementmapped spline surfaces). Second we show how the pathbuffer can
Volume Graphics
, 1993
"... this paper, is an emerging subfield of computer , s graphics concerned with the synthesis, manipulation, and rendering of volumetric objects tored in a volume buffer of voxels. Unlike volume visualization which focuses primarily on d g sampled and computed datasets, volume graphics is concerned prim ..."
Abstract

Cited by 173 (20 self)
 Add to MetaCart
/computed data (on the left) and geometric models (on the right). The ampled/computed input are 3D reconstructed to fill gaps of missing information and are then a g stored in the volume buffer. The geometric model in 3D continuous space is represented by eometric formula which is 3D scanconverted (voxelized
Offline sorting buffers on Line
, 2006
"... We consider the offline sorting buffers problem. Input to this problem is a sequence of requests, each specified by a point in a metric space. There is a “server” that moves from point to point to serve these requests. To serve a request, the server needs to visit the point corresponding to that re ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We consider the offline sorting buffers problem. Input to this problem is a sequence of requests, each specified by a point in a metric space. There is a “server” that moves from point to point to serve these requests. To serve a request, the server needs to visit the point corresponding
Aggregate GBuffer AntiAliasing
"... Figure 1: Large image rendered with Agregate GBuffer AntiAliasing (AGAA). The AGAA results (red outlines) shade only twice per pixel, give comparable results to the MSAA reference image shaded eight times per pixel, and use 33 % less memory. AGAA reduces aliasing by prefiltering the scene’s subpi ..."
Abstract
 Add to MetaCart
pixel geometric detail (foliage, thin railings, etc.) into an aggregate Gbuffer that models the distribution of geometry projecting into each pixel. We present Aggregate GBuffer AntiAliasing (AGAA), a new technique for efficient antialiased deferred rendering of complex geometry using modern graphics hardware
Evaluation of Buffer Queries in Spatial Databases
 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
, 2001
"... A class of commonly asked queries in a spatial database is known as buffer queries. An example of such a query is to find housepower line pairs that are within 50 meters of each other. A buffer query involves two spatial data sets and a distance d. The answer to this query are pairs of objects from ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
A class of commonly asked queries in a spatial database is known as buffer queries. An example of such a query is to find housepower line pairs that are within 50 meters of each other. A buffer query involves two spatial data sets and a distance d. The answer to this query are pairs of objects
Fast CSG Voxelization by Frame Buffer Pixel Mapping
, 2000
"... This paper describes a fast algorithm for the volume conversion and rendering of CSG models constructed from both geometric and volumetric primitives. Using 3D texture mapping and frame buffer pixel operations, the algorithm can interactively generate a binary volume of the CSG model. The result can ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
This paper describes a fast algorithm for the volume conversion and rendering of CSG models constructed from both geometric and volumetric primitives. Using 3D texture mapping and frame buffer pixel operations, the algorithm can interactively generate a binary volume of the CSG model. The result
Performance Analysis of Multiserver ATM Buffers Routing Multimedia Traffics with Geometric Service Time
"... In this article we analyze the performance of discretetime multiserver ATM buffers with batch arrivals, geometric service time and priority scheduling. Such systems can be applied to the detailed performance evaluation of ATM multiplexers and ATM switching elements with dedicated buffer output que ..."
Abstract
 Add to MetaCart
In this article we analyze the performance of discretetime multiserver ATM buffers with batch arrivals, geometric service time and priority scheduling. Such systems can be applied to the detailed performance evaluation of ATM multiplexers and ATM switching elements with dedicated buffer output
Results 1  10
of
236