Rasterization Algorithm Research Articles

Computer graphics: principles and practice

1. Introduction. Image Processing as Picture Analysis. The Advantages of Interactive Graphics. Representative Uses of Computer Graphics. Classification of Applications. Development of Hardware and Software for Computer Graphics. Conceptual Framework for Interactive Graphics. 2. Programming in the Simple Raster Graphics Package (SRGP)/. Drawing with SRGP/. Basic Interaction Handling/. Raster Graphics Features/. Limitations of SRGP/. 3. Basic Raster Graphics Algorithms for Drawing 2d Primitives. Overview. Scan Converting Lines. Scan Converting Circles. Scan Convertiing Ellipses. Filling Rectangles. Fillign Polygons. Filling Ellipse Arcs. Pattern Filling. Thick Primiives. Line Style and Pen Style. Clipping in a Raster World. Clipping Lines. Clipping Circles and Ellipses. Clipping Polygons. Generating Characters. SRGP_copyPixel. Antialiasing. 4. Graphics Hardware. Hardcopy Technologies. Display Technologies. Raster-Scan Display Systems. The Video Controller. Random-Scan Display Processor. Input Devices for Operator Interaction. Image Scanners. 5. Geometrical Transformations. 2D Transformations. Homogeneous Coordinates and Matrix Representation of 2D Transformations. Composition of 2D Transformations. The Window-to-Viewport Transformation. Efficiency. Matrix Representation of 3D Transformations. Composition of 3D Transformations. Transformations as a Change in Coordinate System. 6. Viewing in 3D. Projections. Specifying an Arbitrary 3D View. Examples of 3D Viewing. The Mathematics of Planar Geometric Projections. Implementing Planar Geometric Projections. Coordinate Systems. 7. Object Hierarchy and Simple PHIGS (SPHIGS). Geometric Modeling. Characteristics of Retained-Mode Graphics Packages. Defining and Displaying Structures. Modeling Transformations. Hierarchical Structure Networks. Matrix Composition in Display Traversal. Appearance-Attribute Handling in Hierarchy. Screen Updating and Rendering Modes. Structure Network Editing for Dynamic Effects. Interaction. Additional Output Features. Implementation Issues. Optimizing Display of Hierarchical Models. Limitations of Hierarchical Modeling in PHIGS. Alternative Forms of Hierarchical Modeling. 8. Input Devices, Interaction Techniques, and Interaction Tasks. Interaction Hardware. Basic Interaction Tasks. Composite Interaction Tasks. 9. Dialogue Design. The Form and Content of User-Computer Dialogues. User-Interfaces Styles. Important Design Considerations. Modes and Syntax. Visual Design. The Design Methodology. 10. User Interface Software. Basic Interaction-Handling Models. Windows-Management Systems. Output Handling in Window Systems. Input Handling in Window Systems. Interaction-Technique Toolkits. User-Interface Management Systems. 11. Representing Curves and Surfaces. Polygon Meshes. Parametric Cubic Curves. Parametric Bicubic Surfaces. Quadric Surfaces. 12. Solid Modeling. Representing Solids. Regularized Boolean Set Operations. Primitive Instancing. Sweep Representations. Boundary Representations. Spatial-Partitioning Representations. Constructive Solid Geometry. Comparison of Representations. User Interfaces for Solid Modeling. 13. Achromatic and Colored Light. Achromatic Light. Chromatic Color. Color Models for Raster Graphics. Reproducing Color. Using Color in Computer Graphics. 14. The Quest for Visual Realism. Why Realism? Fundamental Difficulties. Rendering Techniques for Line Drawings. Rendering Techniques for Shaded Images. Improved Object Models. Dynamics. Stereopsis. Improved Displays. Interacting with Our Other Senses. Aliasing and Antialiasing. 15. Visible-Surface Determination. Functions of Two Variables. Techniques for Efficient Visible-Surface Determination. Algorithms for Visible-Line Determination. The z-Buffer Algorithm. List-Priority Algorithms. Scan-Line Algorithms. Area-Subdivision Algorithms. Algorithms for Octrees. Algorithms for Curved Surfaces. Visible-Surface Ray Tracing. 16. Illumination And Shading. Illumination Modeling. Shading Models for Polygons. Surface Detail. Shadows. Transparency. Interobject Reflections. Physically Based Illumination Models. Extended Light Sources. Spectral Sampling. Improving the Camera Model. Global Illumination Algorithms. Recursive Ray Tracing. Radiosity Methods. The Rendering Pipeline. 17. Image Manipulation and Storage. What Is an Image? Filtering. Image Processing. Geometric Transformations of Images. Multipass Transformations. Image Compositing. Mechanisms for Image Storage. Special Effects with Images. Summary. 18. Advanced Raster Graphic Architecture. Simple Raster-Display System. Display-Processor Systems. Standard Graphics Pipeline. Introduction to Multiprocessing. Pipeline Front-End Architecture. Parallel Front-End Architectures. Multiprocessor Rasterization Architectures. Image-Parallel Rasterization. Object-Parallel Rasterization. Hybrid-Parallel Rasterization. Enhanced Display Capabilities. 19. Advanced Geometric and Raster Algorithms. Clipping. Scan-Converting Primitives. Antialiasing. The Special Problems of Text. Filling Algorithms. Making copyPixel Fast. The Shape Data Structure and Shape Algebra. Managing Windows with bitBlt. Page Description Languages. 20. Advanced Modeling Techniques. Extensions of Previous Techniques. Procedural Models. Fractal Models. Grammar-Based Models. Particle Systems. Volume Rendering. Physically Based Modeling. Special Models for Natural and Synthetic Objects. Automating Object Placement. 21. Animation. Conventional and Computer-Assisted Animation. Animation Languages. Methods of Controlling Animation. Basic Rules of Animation. Problems Peculiar to Animation. Appendix: Mathematics for Computer Graphics. Vector Spaces and Affine Spaces. Some Standard Constructions in Vector Spaces. Dot Products and Distances. Matrices. Linear and Affine Transformations. Eigenvalues and Eigenvectors. Newton-Raphson Iteration for Root Finding. Bibliography. Index. 0201848406T04062001

Parallel scanline algorithm for rapid rasterization of vector geographic data

With the expansion of complex geographic calculations and the increase of spatial data types involved in the spatial analysis of large areas, the need becomes urgent for fast rasterization of massive multi-source geographic vector data. A parallel scanline algorithm is proposed for rapid rasterization. It provides a systematic solution to solve the complicated situation in parallel processing (cross-processor boundaries, common boundaries, and tiny polygons), thus ensuring the accuracy of the parallel scanline algorithm. The relationship of parallel speedup with the number of processors, the data partition pattern, and the raster grid size is discussed. Massive vector geographic data (approximately 0.7 million polygons) used in the experiment were effectively processed, thereby dramatically reducing the processing time and getting good speedup.

매니코어 프로세서를 이용한 벡터 기반 래스터화 알고리즘 구현 및 성능평가

In this paper, we implemented and evaluated the performance of a vector-based rasterization algorithm of 3D graphics using a SIMD-based many-core processor that consists of 4,096 processing elements. In addition, we compared the performance and efficiency of the rasterization algorithm using the many-core processor and commercial GPU (Graphics Processing Unit) system which consists of 7 GPUs and each of which have 512 cores. Experimental results showed that the SIMD-based many-core processor outperforms the commercial GPU system in terms of execution time (3.13x speedup), energy efficiency (17.5x better), and area efficiency (13.3x better). These results demonstrate that the SIMD-based many-core processor has potential as an embedded mobile processor.

Evaluation and Improvement of GPU Ray Tracing with a Thread Migration Technique

Ray tracing is a computer graphics rendering technique. Different from the traditional rasterization algorithm, the ray tracing algorithm simulate the real vision process. Being able to deliver highly realistic graphics effects, it has been considered as the fundamental graphics rendering mechanism for high-end applications and is also likely to be adopted as the work-horse of future graphics hardware. However, the high computational effort is the major stumbling block for ray tracing to be deployed in real-time applications. In this paper we present a detailed characterization of the ray tracing algorithm by focusing on ray tracing algorithm based on BVH acceleration structure. Using a state of art graphics processor unit (GPU) simulator, we are able to provide key insight on improving the performance of ray tracing on GPUs. We propose thread migration technique to reduce the cache miss rate and enhance the processing throughput of primary and secondary rays. 

Real-Time Web GIS Analysis Using WebGL

Parallel processing methods in Geographic Information Systems (GIS) are traditionally used to accelerate the calculation of large data volumes with sophisticated spatial algorithms. Such kinds of acceleration can also be applied to provide real-time GIS applications to improve the responsiveness of user interactions with the data. This paper presents a method to enable this approach for Web GIS applications. It uses the JavaScript 3D graphics API (WebGL) to perform client-side parallel real-time computations of 2D or 2.5D spatial raster algorithms on the graphics card. The potential of this approach is evaluated using an example implementation of a hillshade algorithm. Performance comparisons of parallel and sequential computations reveal acceleration factors between 25 and 100, mainly depending on mobile or desktop environments.

Parameterization‐Aware MIP‐Mapping

AbstractWe present a method of generating mipmaps that takes into account the distortions due to the parameterization of a surface. Existing algorithms for generating mipmaps assume that the texture is isometrically mapped to the surface and ignore the actual surface parameterization. Our method correctly downsamples warped textures by assigning texels weights proportional to their area on a surface. We also provide a least‐squares approach to filtering over these warped domains that takes into account the postfilter used by the GPU. Our method improves texture filtering for most models but only modifies mipmap generation, requires no modification of art assets or rasterization algorithms, and does not affect run‐time performance.

전방향 구조광 영상을 위한 Bresenham 래스터 알고리즘 기반 영상 탐색 방법

In this paper, we proposed a search method for structured light pixels of omnidirectional structured light image. Since the omnidirectional structured light image is composed of several circular arc segments, the proposed algorithm searches the structured light pixels in radial direction rather than horizontal or vertical directions. The proposed search algorithm is based on the well-known Bresenham raster algorithm for line drawing in discrete integer space, thereby computation of the algorithm is very efficient. Comparison results between the proposed search algorithm and the conventional horizontal search are presented in experiments.

A Fast Line Rasterization Algorithm Based on Pattern Decomposition

A Fast Line Rasterization Algorithm Based on Pattern Decomposition

Method and Algorithm for Rasterization of Point Graphic Objects

Method and Algorithm for Rasterization of Point Graphic Objects

Forward rasterization

We describe forward rasterization, a class of rendering algorithms designed for small polygonal primitives. The primitive is efficiently rasterized by interpolation between its vertices. The interpolation factors are chosen to guarantee that each pixel covered by the primitive receives at least one sample which avoids holes. The location of the samples is recorded with subpixel accuracy using a pair of offsets which are then used to reconstruct/resample the output image. Offset reconstruction has good static and temporal antialiasing properties. We present two forward rasterization algorithms, one that renders quadrilaterals and is suitable for scenes modeled with depth images like in image-based rendering by 3D warping, and one that renders triangles and is suitable for scenes modeled conventionally. When compared to conventional rasterization, forward rasterization is more efficient for small primitives and has better temporal antialiasing properties.

Interactive Rendering with Coherent Ray Tracing

For almost two decades researchers have argued that ray tracing will eventually become faster than the rasterization technique that completely dominates todays graphics hardware. However, this has not happened yet. Ray tracing is still exclusively being used for off-line rendering of photorealistic images and it is commonly believed that ray tracing is simply too costly to ever challenge rasterization-basedalgorithms for interactive use. However, there is hardly any scientific analysis that supports either point of view. In particular there is no evidence of where the crossover point might be, at which ray tracing would eventually become faster, or if such a point does exist at all. This paper provides several contributions to this discussion: We fir st present a highly optimized implementationof a ray tracer that improves performance by more than an order of magnitude compared to currently available ray tracers. The new algorithm makes better use of computational resources such as caches and SIMD instructions and better exploits image and object space coherence. Secondly, we show that this software implementation can challenge and even outperform high-end graphics hardware in interactive rendering performance for complex environments. We also provide an brief overview of the benefits of ray tracing over rasterization algorithms and point out the potential of interactive ray tracing both in hardware and software.

Algorithms for Tetrahedral Network(ten) generation

The Tetrahedral Network(TEN) is a powerful 3-D vector structure in GIS, which has a lot of advantages such as simple structure, fast topological relation processing and rapid visualization. The difficulty of TEN application is automatic creating data structure. Although a raster algorithm has been introduced by some authors, the problems in accuracy, memory requirement, speed and integrity are still existent. In this paper, the raster algorithm is completed and a vector algorithm is presented after a 3-D data model and structure of TEN have been introducted. Finally, experiment, conclusion and future work are discussed.

Chinese TrueType font support in X window

It is of great significance to provide Chinese TrueType font support in X Window. This paper describes the work of adding a Chinese TrueType font renderer under X's font support mechanism. First, the origin of the idea is introduced, followed by a brief study of TrueType font and its rasterization algorithm, then the font support mechanism in X Window is discussed. Finally, an overall illustration of the Chinese TrueType font renderer is given.

Superscalar RISC machines, straight-line programs, and graphics

Implementors of graphics application programming interfaces (APIs) and algorithms are often required to support a plethora of options for several stages at the back end of the geometry and rasterization pipeline. Implementing these options in high-level programming languages such as C leads to code with many branches and large object modules due to indiscriminate duplication of very similar code. This reduces the speed of execution of the program. This paper examines the problems of branches and code size in detail and presents techniques for transforming typical code sequences in graphics programs to reduce the number of branches and to reduce to the size of the program. A set of branch-free basis functions is defined first. The application of these functions to common geometric queries, geometry pipeline computations, rasterization, and pixel processing algorithms is then discussed.

Efficient Parallel Gouraud Shading and Linear Interpolation over Triangles

AbstractA parallel raster algorithm to draw Gouraud shaded triangles is presented. At the heart of the algorithm is a new constrained parallel edge‐traversal technique. This parallel traversal represents an increased level of parallelism compared to the existing solutions. Next, traditional algorithms take different amounts of time to advance from one horizontal span to another for the left edge and the right edge of the triangle when the slope of one of the edges is more than one and that of the other edge is less than one. This causes one processor to wait for another processor. The parallel constrained edge traversal technique removes this problem by directly jumping from one span to the next. It also ensures that adjacent triangles that share an edge do not share any pixels. Moreover, no cracks occur between adjacent polygons. Unlike some existing algorithms whose complexity depends on the size of the bounding box of the triangle, the complexity of our algorithm is solely dependenton the perimeter and area of the triangle.Due to the above features, the algorithm presented here exposes a greater degree of parallelism at considerably lesser cost and achieves better processor utilization, compared to existing algorithms for this problem1, 2, 3, 4, 5, 6. The algorithm is well suited for hardware implementation.

A parallel algorithm for polygon rasterization

A parallel algorithm for the rasterization of polygons is presented that is particularly well suited for 3D Z-buffered graphics implementations. The algorithm represents each edge of a polygon by a linear edge function that has a value greater than zero on one side of the edge and less than zero on the opposite side. The value of the function can be interpolated with hardware similar to hardware required to interpolate color and Z pixel values. In addition, the edge function of adjacent pixels may be easily computed in parallel. The coefficients of the "Edge function" can be computed from floating point endpoints in such a way that sub-pixel precision of the endpoints can be retained in an elegant way.

Line rasterization algorithms that satisfy the subset line property

In this paper two subset line properties are introduced; the difference concerns the domain of the end points of the line segments under consideration, viz. Q 2 and Z 2 respectively. For both properties, a recursive and a nonrecursive algorithm to generate raster line segments are derived. All algorithms use integer arithmetic only. The accuracy of the algorithms in representing lines will be discussed, as well as their time complexity.

A monolithic scan-line bit producer for real-time image rasterization

This paper presents the design and implementation on a single chip of a special purpose circuit used for real-time data rasterization based on the scan-line algorithm. The chip functions as a peripheral to the processor that runs the scan-line algorithm and, under processor control, produces the bit patterns to be stored in a bit-map memory. Utilization of the chip allows the processor to perform just a “write” operation, instead of a “read-modify-write” operation, for every scan-line of data. This results in substantial performance improvement in the application of the scan-line algorithm for data rasterization. The circuit has been implemented in 3μ CMOS technology, and its function was demonstrated with up to 15 MHz of throughput. The design allows the interconnection of many chips to facilitate applications with scan-lines of any size. The throughput, however, remains constant at 15 MHz, independent of the scan-line size.

A two-and-a-half-D motion-blur algorithm

Algorithms are presented for raster and vector motion blur, which produce images and masks suitable for combination by the 21/2-D compositing process. The raster algorithm is based on a "skew, blur, unskew" scheme, using a very efficient one-dimensional blurring algorithm. The vector algorithm extends the ideas of anti-aliased scan conversion to motion blur.

A raster-mode algorithm for interactive modification of line drawing data

Geographic data files are characteristically very large, given the high degree of precision needed for most cartographic production and analysis applications. As the ease of capturing large volumes of high-precision spatial data and the subsequent reliance on automated methods for handling such data increase, there is an increasing need for efficiency in terms of both storage space and speed. More and more graphic data are now being captured in raster instead of vector format. This means that raster methods for processing raster-formatted data need to be investigated as a means of increasing efficiency by avoiding the raster-vector-raster conversion process. Raster algorithms to perform a wide range of tasks already exist. One exception, however, is raster-mode update. This paper presents an algorithm for the modification of cartographic or any similar type of raster-formatted line drawing data which operates on rasters exclusively.