Scanline rendering of parametric surfaces

Schweitzer, Dino; Cobb, Elizabeth S.

doi:10.1145/800064.801289

Cited by 13 publications

(4 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the other hand, it can be said that CPU processing on data underperform GPU processing, when data traffic increase. Because, according to the equation (1) and (2)), in 720p and 1080p, image generation time ratio (CPU/GPU) has increased 49% and 62% respectively. While, according to the equation (3), pixel computations ratio has increased 125% in both resolutions.…”

Section: -Resultsmentioning

confidence: 99%

Optimizing Raytracing Algorithm Using CUDA

Razian

MahvashMohammadi

2017

IJSE

View full text Add to dashboard Cite

Now, there are many codes to generate images using raytracing algorithm, which can run on CPU or GPU in single or multi-thread methods. In this paper, an optimized algorithm has been designed to generate image using raytracing algorithm to run on CPU or GPU in multi-thread algorithm. This algorithm employs light with depth of 8 to generate images. It is optimized by changing pixel travel priority and ray of light to thread, dedicating depth function to empty threads, and using optimized functions from MSDN library. Its code has been written in C++ and CUDA. In addition, we do the following to show its performance: comparing implementation in different compiler mode, changing thread number, examining different resolution, and investigating data bandwidth. The results show that one can generate at least 11 frames per second in HD (720p) resolution by GPU processor and GT 840M graphic card, using trace method. If better graphic card employ, this algorithm and program can be used to generate real-time animation.

show abstract

Section: -Resultsmentioning

confidence: 99%

Optimizing Raytracing Algorithm Using CUDA

Razian

MahvashMohammadi

2017

IJSE

View full text Add to dashboard Cite

show abstract

“…The number of segments changes in the planes containing the minimum and maximum. 3. The curve's slope is not continuous (Figure 1, c); it contains a vertex.…”

Section: The Algorithmmentioning

confidence: 99%

“…The number of active regions (regions intersected by the current scan plane) is constant in the band. 3. Pairs of points to be interpolated of the exact intersection planes are connected by curves of continuous slope.…”

Section: The Algorithmmentioning

confidence: 99%

A Parametric-Space-Based Scan-Line Algorithm for Rendering Bicubic Surfaces

Pueyo

Brunet

1987

IEEE Comput. Grap. Appl.

View full text Add to dashboard Cite

In recent years hidden-surface-removal algorithms have been proposed to render curved surfaces, especially bicubic (or bipolynomial) patches. Most of these algorithms use the scan-line principle to determine the scene visibility. Lane, Carpenter, Whitted, and Blinn' proposed three different methods. The first algorithm is a subdivision method that stops when a desired degree of surface flatness is achieved. Then subpatches are approximated by polygons processed by a polygonoriented algorithm. Whitted's method computes the exact intersection of some curves in the patch with every scan plane and approximates the patch's intersection with the plane by a polygonal line defined by these points. The exact intersection curves are the cubics defining the boundaries of the patch, isoparametric curves in the patch, and cubic approximations of the silhouettes. Finally, Blinn proposes a method that is essentially a z-buffer algorithm in which numerical problems are simplified using the intersection of the scan planes with the boundaries and the silhouettes of the patch.Lane and Carpenter2 later improved and generalized their algorithm, and Schweitzer and Cobb3 proposed an algorithm similar to Whitted's method that offered higher quality silhouettes. Some methods compute curved-surface visibility in parametric space. These algorithms use different techniques employed in polygon-oriented methods. Strasser4 and Forest5 use a z-buffer algorithm; Griffiths'5'7 and Ohno's8 algorithms are based on depth comparison between points of a grid defined in the patch and some subpatches; Hornung et al.9 simply compute the boundaries of constant visibility areas in the patch.Griffiths'°has proposed a scan-line algorithm that does some work in the parametric plane. This algorithm obtains an approximation of the patch silhouettes in the parametric space. Griffiths' method approximates the intersection of the scan plane and the patch with chains of straight segments instead of considering the segments separately, as other algorithms do. In this way his method speeds up the visibility calculation considerably.We will present a new scan-line algorithm for curved surfaces that does most of the computations in the para-

show abstract

“…Rendering of parametric surfaces has a long history [1]. Early approaches consist of direct scanline rasterization of the parametric surface [2]. Modern GPUs have the ability to transform, light, rasterize surfaces composed of primitives like triangles and more recently also to tessellate them.…”

Section: Introductionmentioning

confidence: 99%

Semi-uniform, 2-Different Tessellation of Triangular Parametric Surfaces

Amresh

Fünfzig

2010

Advances in Visual Computing

View full text Add to dashboard Cite

With a greater number of real-time graphics applications moving over to parametric surfaces from the polygonal domain, there is an inherent need to address various rendering bottlenecks that could hamper the move. Scaling the polygon count over various hardware platforms becomes an important factor. Much control is needed over the tessellation levels, either imposed by the hardware limitations or by the application. Developers like to create applications that run on various platforms without having to switch between polygonal and parametric versions to satisfy the limitations. In this paper, we present SD-2 (Semi-uniform, 2-Different), an adaptive tessellation algorithm for triangular parametric surfaces. The algorithm produces well distributed and semi-uniformly shaped triangles as a result of the tessellation. The SD-2 pattern requires new approaches for determining the edge tessellation factors, which can be fractional and change continuously depending on view parameters. The factors are then used to steer the tessellation of the parametric surface into a collection of triangle strips in a single pass. We compare the tessellation results in terms of GPU performance and surface quality by implementing SD-2 on PN patches.

show abstract

Scanline rendering of parametric surfaces

Cited by 13 publications

References 4 publications

Optimizing Raytracing Algorithm Using CUDA

Optimizing Raytracing Algorithm Using CUDA

A Parametric-Space-Based Scan-Line Algorithm for Rendering Bicubic Surfaces

Semi-uniform, 2-Different Tessellation of Triangular Parametric Surfaces

Contact Info

Product

Resources

About