Results 1  10
of
4,082
A survey of generalpurpose computation on graphics hardware
, 2007
"... The rapid increase in the performance of graphics hardware, coupled with recent improvements in its programmability, have made graphics hardware acompelling platform for computationally demanding tasks in awide variety of application domains. In this report, we describe, summarize, and analyze the l ..."
Abstract

Cited by 545 (18 self)
 Add to MetaCart
The rapid increase in the performance of graphics hardware, coupled with recent improvements in its programmability, have made graphics hardware acompelling platform for computationally demanding tasks in awide variety of application domains. In this report, we describe, summarize, and analyze the latest research in mapping generalpurpose computation to graphics hardware. We begin with the technical motivations that underlie generalpurpose computation on graphics processors (GPGPU) and describe the hardware and software developments that have led to the recent interest in this field. We then aim the main body of this report at two separate audiences. First, we describe the techniques used in mapping generalpurpose computation to graphics hardware. We believe these techniques will be generally useful for researchers who plan to develop the next generation of GPGPU algorithms and techniques. Second, we survey and categorize the latest developments in generalpurpose application development on graphics hardware.
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning under uncertainty, sensorbased planning, visibility, decisiontheoretic planning, game theory, information spaces, reinforcement learning, nonlinear systems, trajectory planning, nonholonomic planning, and kinodynamic planning.
Geometry Compression
"... This paper introduces the concept of Geometry Compression, allowing 3D triangle data to be represented with a factor of 6 to 10 times fewer bits than conventional techniques, with only slight losses in object quality. The technique is amenable to rapid decompression in both software and hardware imp ..."
Abstract

Cited by 355 (0 self)
 Add to MetaCart
This paper introduces the concept of Geometry Compression, allowing 3D triangle data to be represented with a factor of 6 to 10 times fewer bits than conventional techniques, with only slight losses in object quality. The technique is amenable to rapid decompression in both software and hardware implementations; if 3D rendering hardware contains a geometry decompression unit, application geometry can be stored in memory in compressed format. Geometry is first represented as a generalized triangle mesh, a data structure that allows each instance of a vertex in a linear stream to specify an average of two triangles. Then a variable length compression is applied to individual positions, colors, and normals. Delta compression followed by a modified Huffman compression is used for positions and colors; a novel tablebased approach is used for normals. The table allows any useful normal to be represented by an 18bit index, many normals can be represented with index deltas of 8 bits or less. Geometry compression is a general spacetime tradeoff, and offers advantages at every level of the memory/interconnect hierarchy: less storage space is needed on disk, less transmission time is needed on networks.
Imagebased visual hulls
 IN PROCEEDINGS OF ACM SIGGRAPH 2000
, 2000
"... In this paper, we describe an efficient imagebased approach to computing and shading visual hulls from silhouette image data. Our algorithm takes advantage of epipolar geometry and incremental computation to achieve a constant rendering cost per rendered pixel. It does not suffer from the computati ..."
Abstract

Cited by 342 (18 self)
 Add to MetaCart
In this paper, we describe an efficient imagebased approach to computing and shading visual hulls from silhouette image data. Our algorithm takes advantage of epipolar geometry and incremental computation to achieve a constant rendering cost per rendered pixel. It does not suffer from the computation complexity, limited resolution, or quantization artifacts of previous volumetric approaches. We demonstrate the use of this algorithm in a realtime virtualized reality application running off a small number of video streams.
Interactive Rendering of CSG Models
, 1996
"... We describe a CSG rendering algorithm that requires no evaluation of the CSG tree beyond normalization and pruning. It renders directly from the normalized CSG tree and primitives described (to the graphics system) by their facetted boundaries. It behaves correctly in the presence of user defined, ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
We describe a CSG rendering algorithm that requires no evaluation of the CSG tree beyond normalization and pruning. It renders directly from the normalized CSG tree and primitives described (to the graphics system) by their facetted boundaries. It behaves correctly in the presence of user defined
of Complex CSG Models
"... We present a system for fast and accurate display of CSG (constructive solid geometry) models. Such models have as primitives, polyhedra and solids whose boundaries can be represented using rational spline surfaces. As a part of preprocessing, we compute the Brep (boundary representation) from the ..."
Abstract
 Add to MetaCart
We present a system for fast and accurate display of CSG (constructive solid geometry) models. Such models have as primitives, polyhedra and solids whose boundaries can be represented using rational spline surfaces. As a part of preprocessing, we compute the Brep (boundary representation) from
CST: Constructive Solid Trimming for Rendering BReps and CSG
 IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS
"... To eliminate the need to evaluate the intersection curves in explicit representations of surface cutouts or of trimmed faces in BReps of CSG solids, we advocate using Constructive Solid Trimming (CST). A CST face is the intersection of a surface with a Blist representation of a trimming CSG volume ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
To eliminate the need to evaluate the intersection curves in explicit representations of surface cutouts or of trimmed faces in BReps of CSG solids, we advocate using Constructive Solid Trimming (CST). A CST face is the intersection of a surface with a Blist representation of a trimming CSG
A shadow algorithm for CSG
 Computers and Graphics
, 1991
"... An algorithm is presented for constructing shadow volumes for CSG objects. For each primitive solid, the algorithm calculates a tree of shadow volumes to model the shadows generated by the shadowgenerating parts of the boundary of the primitive. The shadow of the complete CSG object is the union of ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
An algorithm is presented for constructing shadow volumes for CSG objects. For each primitive solid, the algorithm calculates a tree of shadow volumes to model the shadows generated by the shadowgenerating parts of the boundary of the primitive. The shadow of the complete CSG object is the union
Representation and Fast Display of Complex CSG Models
"... : We present a system for fast and accurate display of CSG (constructive solid geometry) models. Such models have as primitives, polyhedra and solids whose boundaries can be represented using rational spline surfaces. As part of preprocessing, we compute the Brep (boundary representation) from th ..."
Abstract
 Add to MetaCart
: We present a system for fast and accurate display of CSG (constructive solid geometry) models. Such models have as primitives, polyhedra and solids whose boundaries can be represented using rational spline surfaces. As part of preprocessing, we compute the Brep (boundary representation) from
Applications of algebraic tools to CSG . . .
 ACS ALGORITHMS FOR COMPLEX SHAPES WITH CERTIFIED NUMERICS AND TOPOLOGY
, 2008
"... ..."
Results 1  10
of
4,082