Results 1  10
of
35
FAST VOLUME RENDERING USING A SHEARWARP FACTORIZATION OF THE VIEWING TRANSFORMATION
, 1995
"... Volume rendering is a technique for visualizing 3D arrays of sampled data. It has applications in areas such as medical imaging and scientific visualization, but its use has been limited by its high computational expense. Early implementations of volume rendering used bruteforce techniques that req ..."
Abstract

Cited by 542 (2 self)
 Add to MetaCart
family of volume rendering algorithms that reduces rendering times to one second. First we present a scanlineorder volume rendering algorithm that exploits coherence in both the volume data and the image. We show that scanlineorder algorithms are fundamentally more efficient than commonlyused ray
ScanlineOrder Image Warping using ErrorControlled Adaptive Piecewise Polynomial Approximation
, 2002
"... A general class of realtime imagewarping algorithms is based upon adaptively approximating the warping function on each scanline with piecewise polynomials, and rendering each piece by forward differencing, to yield a 310X improvement in speed over traditional techniques. The error is strictly bo ..."
Abstract
 Add to MetaCart
A general class of realtime imagewarping algorithms is based upon adaptively approximating the warping function on each scanline with piecewise polynomials, and rendering each piece by forward differencing, to yield a 310X improvement in speed over traditional techniques. The error is strictly
Marching cubes: A high resolution 3D surface construction algorithm
 COMPUTER GRAPHICS
, 1987
"... We present a new algorithm, called marching cubes, that creates triangle models of constant density surfaces from 3D medical data. Using a divideandconquer approach to generate interslice connectivity, we create a case table that defines triangle topology. The algorithm processes the 3D medical d ..."
Abstract

Cited by 2696 (4 self)
 Add to MetaCart
data in scanline order and calculates triangle vertices using linear interpolation. We find the gradient of the original data, normalize it, and use it as a basis for shading the models. The detail in images produced from the generated surface models is the result of maintaining the inter
A maximum likelihood stereo algorithm
 Computer Vision and Image Understanding
, 1996
"... A stereo algorithm is presented that optimizes a maximum likelihood cost function. The maximum likelihood cost function assumes that corresponding features in the left and right images are Normally distributed about a common true value and consists of a weighted squared error term if two features ar ..."
Abstract

Cited by 234 (2 self)
 Add to MetaCart
are matched or a ( xed) cost if a feature is determined to be occluded. The stereo algorithm nds the set of correspondences that maximize the cost function subject to ordering and uniqueness constraints. The stereo algorithm is independent of the matching primitives. However, for the experiments described
Forward Image Warping
, 1999
"... We present a new forward image warping algorithm, which speeds up perspective warping  as in texture mapping. It processes the source image in a special scanline order instead of the normal raster scanline order. This special scanline has the property of preserving parallelism when projecting to t ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We present a new forward image warping algorithm, which speeds up perspective warping  as in texture mapping. It processes the source image in a special scanline order instead of the normal raster scanline order. This special scanline has the property of preserving parallelism when projecting
Stereo without disparity gradient smoothing: A Bayesian sensor fusion solution
 in Proc. British Machine Vision Conf
, 1992
"... A maximum likelihood stereo algorithm is presented that avoids the need for smoothing based on disparity gradients, provided that the common uniqueness and monotonic ordering constraints are applied. A dynamic programming algorithm allows matching of the two epipolar lines of length N and M respecti ..."
Abstract

Cited by 33 (5 self)
 Add to MetaCart
A maximum likelihood stereo algorithm is presented that avoids the need for smoothing based on disparity gradients, provided that the common uniqueness and monotonic ordering constraints are applied. A dynamic programming algorithm allows matching of the two epipolar lines of length N and M
Forward image mapping
 In Proceedings of IEEE Visualization
, 1999
"... We present a new forward image mapping algorithm, which speeds up perspective warping – as in texture mapping. It processes the source image in a special scanline order instead of the normal raster scanline order. This special scanline has the property of preserving parallelism when projecting to th ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present a new forward image mapping algorithm, which speeds up perspective warping – as in texture mapping. It processes the source image in a special scanline order instead of the normal raster scanline order. This special scanline has the property of preserving parallelism when projecting
Forward Image Warping
, 1999
"... We present a new forward image warping algorithm, which speeds up perspective warping  as in texture mapping. It processes the source image in a special scanline order instead of the normal raster scanline order. This special scanline has the property of preserving parallelism when projecting to t ..."
Abstract
 Add to MetaCart
We present a new forward image warping algorithm, which speeds up perspective warping  as in texture mapping. It processes the source image in a special scanline order instead of the normal raster scanline order. This special scanline has the property of preserving parallelism when projecting
An Object Oriented Approach for Teaching Visibility Computation Algorithms
, 1995
"... In this paper we present an approach for teaching visibility computation algorithms. Its suitability for undergraduate and graduate courses is discussed. The approach is based on the abstraction, during the first stages of the teaching process, of the order of the surfaces (planes, quadrics. . . ) o ..."
Abstract
 Add to MetaCart
In this paper we present an approach for teaching visibility computation algorithms. Its suitability for undergraduate and graduate courses is discussed. The approach is based on the abstraction, during the first stages of the teaching process, of the order of the surfaces (planes, quadrics
Genderen, “Delayed Frontal Solution for FiniteElement based Resistance Extraction
 In Proc. 32nd Design Automation Conf
, 1995
"... To save memory, layouttocircuit extractors that use the FiniteElement Method for resistance extraction usually solve the corresponding set of equations with a frontal solution method. We show that this method is inefficient when used with a scanline ordering of the elements. As an improvement, we ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
, we introduce the Delayed Frontal Solution algorithm, which allows us to replace the scanline ordering by the minimumdegree ordering. Thus, extraction times are reduced with more than one order of magnitude at a small cost of extra memory. 1
Results 1  10
of
35