The Comparison of Three 3D Graphics Raster Processors and the Design of Another

Total Page:16

File Type:pdf, Size:1020Kb

The Comparison of Three 3D Graphics Raster Processors and the Design of Another Rochester Institute of Technology RIT Scholar Works Theses 7-1-1999 The Comparison of three 3D graphics raster processors and the design of another Paul Brown Follow this and additional works at: https://scholarworks.rit.edu/theses Recommended Citation Brown, Paul, "The Comparison of three 3D graphics raster processors and the design of another" (1999). Thesis. Rochester Institute of Technology. Accessed from This Thesis is brought to you for free and open access by RIT Scholar Works. It has been accepted for inclusion in Theses by an authorized administrator of RIT Scholar Works. For more information, please contact [email protected]. The Comparison of Three 3D Graphics Raster Processors and the Design of Another by Paul M. Brown A Thesis Submitted III Partial Fulfillment of the Requirements for the Degree of Master of Science III Computer Engineering Approved by: Principle Advisor Roy S. Czernikowski, Professor, Computer Engineering Committee Member _ Hans-Peter Bischof, Assistant Professor, Computer Science Committee Member _ Robert S. Horton, IBM Senior Design Engineer Department of Computer Engineering Kate Gleason College of Engineering Rochester Institute of Technology Rochester, New York July 1999 Release Permission Form Rochester Institute of Technology The Heresy, Talisman, and Tayra 3D Architectures: A Comparison I, Paul M. Brown hereby grant permission to any individual or organization to reproduce this thesis in whole or in part for non-commercial and non-profit purposes only. Paul M. Brown Date Abstract There are a number of 3D graphics accelerator architectures on the market today. One of the largest issues concerning the design of a 3D accelerator is that of affordability for the home user while still delivering good performance. Three such architectures were analyzed: the Heresy architecture defined by Chiueh [2], the Talisman architecture defined by Torborg [7], and the Tayra architecture's specification by White [9]. Portions of these three architectures were used to create a new architecture taking advantage of as many of their features as possible. The advantage of chunking will be analyzed, along with the advantages of a single cycle z-buffering algorithm. It was found that Fast Phong Shading is not suitable for implementation in this pipeline, and that the clipping algorithm should be eliminated in favor of a scissoring algorithm. Contents List of Figures v Glossary . vii 1 Introduction 1 1.1 Heresy Architecture . .. 1 1.2 Talisman Architecture .... .. 2 1.2.1 Composited Image Layers .. 2 1.2.2 Image Compression . 3 1.2.3 Chunking 3 1.2.4 Multi-pass Rendering 3 1.3 Tayra Architecture 3 1.4 Hardware Specific Stuff 4 1.4.1 Heresy Architecture 4 1.4.2 Talisman Architecture . .4 1.4.3 Tayra Architecture .. ... 4 1.5 Display Traversal ... 5 1.5.1 Heresy Architecture 6 1.5.2 Talisman Architecture 6 1.5.3 Tayra Architecture . 6 1.5.4 Comparison .... .... 7 1.6 Modeling Transformation 7 1.6.1 Heresy Architecture 7 1.6.2 Talisman Architecture 7 1.6.3 Tayra Architecture . 7 1.6.4 Comparison 7 1.7 Trivial Accept/Reject Classification ... 7 1.7.1 Heresy Architecture 8 1.7.2 Talisman Architecture 8 1.7.3 Tayra Architecture . 8 1.7.4 Comparison 8 1.8 Lighting 8 1.8.1 Phong Lighting . 8 1.8.2 Cook and Torrance Lighting Model 11 1.8.3 BAGS Lighting Model 12 1.8.4 Heresy Architecture 13 1.8.5 Talisman Architecture 13 1.8.6 Tayra Architecture 13 1.8.7 Comparison 14 1.9 Viewing Transformation 14 1.9.1 Heresy Architecture 14 1.9.2 Talisman Architecture 14 1.9.3 Tayra Architecture 14 1.9.4 Comparison . .... 14 1.10 Clipping 14 1.10.1 Sutherland Hodgman Polygon Clipping 15 1.10.2 Heresy Architecture 16 1.10.3 Talisman Architecture 16 1.10.4 Tayra Architecture 16 1.10.5 Comparison 16 1.11 Division by w and Mapping to 3D Viewport . ... 16 1.11.1 Heresy Architecture 16 1.11.2 Talisman Architecture 17 1.11.3 Tayra Architecture . 17 1.11.4 Comparison 17 1.12 Rasterization 17 1.12.1 Heresy Architecture . 17 1.12.2 Talisman Architecture ... 17 1.12.3 Tayra Architecture . 18 1.13 Scan Conversion .... 20 1.13.1 Heresy Architecture 20 1.13.2 Talisman Architecture .... .. 20 1.13.3 Tayra Architecture . 20 1.13.4 Comparison 21 1.14 Visible-Surface Determination 21 1.14.1 Z-buffer 21 1.14.2 Heresy Architecture 22 1.14.3 Talisman Architecture 22 1.14.4 Tayra Architecture . 23 1.14.5 Comparison 23 1.15 Shading 23 1.15.1 Gouraud Shading 23 1.15.2 Phong Shading 24 1.15.3 Fast Phong Shading 24 1.15.4 Heresy Architecture 26 1.15.5 Talisman Architecture 26 1.15.6 Tayra Architecture 26 1.15.7 Comparison 26 1.16 Texture Mapping 26 1.16.1 Mapping 26 1.16.2 Texture Filtering 28 n 1.16.3 Mip-Mapping 28 1.16.4 Heresy Architecture 28 1.16.5 Talisman Architecture 29 1.16.6 Tayra Architecture 29 1.16.7 Comparison 30 1.17 Antialiasing 30 1.17.1 Averaging 30 1.17.2 A-buffer 30 1.17.3 Modified A-buffer 31 1.17.4 Heresy Architecture 31 1.17.5 Talisman Architecture 31 1.17.6 Tayra Architecture 31 1.17.7 Comparison 31 1.18 Alpha Blending . 32 1.18.1 Heresy Architecture 32 1.18.2 Talisman Architecture . 32 1.18.3 Tayra Architecture 32 1.18.4 Comparison 32 1.19 Additional Information 33 1.19.1 Talisman Architecture 33 1.20 Conclusions 33 2 Pipeline Overview 35 3 Geometric Transforms 36 3.1 Modeling Transformation .... 36 3.1.1 Matrix Transformations . 37 3.1.2 Complexity 40 3.2 Trivial Accept/Reject . 40 3.2.1 Complexity 40 3.3 Lighting 40 3.3.1 Lighting Equations 41 3.3.2 Applying the Lighting Equations 42 3.3.3 Complexity 42 3.4 Viewing Transformation 42 3.4.1 Performing the Viewing Transformation 43 3.4.2 Applying the Viewing Transformation Matrix 44 3.4.3 Complexity 44 3.5 Clipping 45 3.5.1 Transforming the View Volume 46 3.5.2 Performing the Clipping Operation 47 3.5.3 Complexity 49 3.6 3D to 2D Transformations and Division by w 50 3.6.1 Division by u; 50 3.6.2 Mapping to Viewport 50 111 3.6.3 Complexity 51 4 Rasterization 52 4.1 Active Primitive Determination 52 4.1.1 Chunking 53 4.1.2 Complexity 53 4.2 Depth Check 54 4.2.1 Creating the Depth Chunk 54 4.2.2 Complexity ... .. 55 4.3 Texture Level Determination 55 4.3.1 Finding the Level and Fraction .... ... 56 4.3.2 Complexity . 57 4.4 Gouraud Shading . 57 4.4.1 Gouraud Shading a Chunk 57 4.4.2 Complexity 58 4.5 Fast Phong Shading 58 4.5.1 Shading with Fast Phong 59 4.5.2 Complexity 59 4.6 Anti-Aliasing 60 4.6.1 Coverage Mask 60 4.6.2 Complexity ... 61 4.7 Texture Mapping . .... 61 4.7.1 Mapping a Texture 62 4.7.2 Complexity 62 4.8 Alpha Blending 63 4.8.1 Adding Transparent Values 63 4.8.2 Complexity 64 4.9 Frame Buffer 64 5 Comparison 65 6 Future Work 68 IV List of Figures 1.1 Standard Graphics Pipeline 1 1.2 Heresy Architecture Overview 4 1.3 Talisman Architecture Overview ... 5 1.4 Tayra Architecture Overview 5 1.5 Specular Reflection . .... 10 1.6 Sutherland Hodgman Clipping Rules . .. 15 1.7 Heresy Lazy Shading Algorithm Data Flow ... 18 1.8 Talisman Polygon Object Processor . 19 1.9 Talisman Image Layer Compositor . 19 1.10 Tayra Scan Conversion Module . 20 1.11 Heresy Speculative z-buffer Cell 22 2.1 Pipeline Overview Diagram 35 3.1 Geometric Transforms Pipeline Stages 36 3.2 Modeling Transformation Stage 37 3.3 Lighting Stage 41 3.4 Viewing Transformation Pipeline Stage 42 3.5 View Reference Coordinate System Reference Points 43 3.6 Clipping Pipeline Stage .... 45 3.7 View Volume .... 45 3.8 View Volume After PRP Translation 46 3.9 View Volume after X-Y Shear .. 47 3.10 View Volume after Scale . 48 3.11 Homogeneous View Volume 48 3.12 3D to 2D Transformation Pipeline Stage 50 3.13 View Volume after Divide by w 51 4.1 Active Primitive Determination Pipeline Stage 52 4.2 Chunking of Primitives 53 4.3 Depth Check Pipeline Stage 54 4.4 Texture Level Determination Pipeline Stage 55 4.5 MIP-Mapping Level Sizes 56 4.6 Texture and Primitive Triangles 56 4.7 Gouraud Shading Pipeline Stage 58 4.8 Fast Phong Shading Pipeline Stage 59 4.9 Anti-Aliasing Pipeline Stage 60 4.10 Coverage Mask 61 4.11 Texture Mapping Pipeline Stage 62 4.12 Alpha Blending Pipeline Stage 63 5.1 Example 1 65 5.2 Example 2 66 5.3 Example 3 67 5.4 Example 4 ... 67 VI Glossary Affine Transformation pages 2, 6 A transformation that maintains the angles between lines. Mip-Map pages 3, 18, 28, 61 Multum in parvo. A method of prefiltering textures, so that textures of the appropriate size can be selected for a given primitive. Texel page 28 A texture element. A color value that is stored in a texture map specifically used in adding detail to the surface of primitives. TREC page 29 Texture and Rendering Engine Compression. A Microsoft developed tex ture compression format, specifically for use in high speed rendering appli cations.
Recommended publications
  • Parallel Image Generation Using the J-Buffering
    -PARALLEL IMAGE GENERATION USING THE J-BUFFERING... -... ALGORITHM ON A MEDIUM GRAINED DISTRIBUTED MEMORY MODEL COMPUTER By ERIC MARTIN BLAZEK Bachelor of Science Oklahoma State University Stillwater, Oklahoma 1988 Submitted to the Faculty of the Graduate College of the Oklahoma State University in partial fulfillment of the requirements for the Degree of MASTER OF SCIENCE July, 1991 OJ.clahoma State Univ.. Library PARALLEL IMAGE GENERATION USING THE Z-BUFFERING ALGORITHM ON A MEDIUM GRAINED DISTRIBUTED MEMORY MODEL COMPUTER Thesis Approved: Thesis .d;Z. [ ~-~ Dean of the Graduate College ii ACKNOWLEDGMENTS I wlsh to express my gratitude to Dr. Blayne E. Mayfield for his constant advice and suggestions from the very beginning of this thesis. My thanks also go to Dr. K.M. George and Dr. George Hedrick for serving on my graduate committee. Lastly, I acknowledge the help of Dr. Keith Teague and Dr. David Miller for their assistance. All of thelr suggestions and help was much appreciated. To all of my family, but especially my parents, Larry and Marietta Jo, my heartfelt thanks for all the many years of love and support. My thanks go to Larry Kraemer also for his time and experience in the many hours of proofing and typing. And flnally, to Laura Wardius, soon to be my wife, my eternal thanks for her patience and companionship these last five years. iii TABLE OF CONTENTS Chapter Page I. INTRODUCTION. 1 Two Goals of Computer Graphics .... 1 Z-Buffering Is The Answer . 3 Parallel Z-Buffer1ng, A Better Answer . 3 Overview. , . 4 II. BACKGROUND ..... 6 Scene Components .
    [Show full text]
  • An Advanced Path Tracing Architecture for Movie Rendering
    RenderMan: An Advanced Path Tracing Architecture for Movie Rendering PER CHRISTENSEN, JULIAN FONG, JONATHAN SHADE, WAYNE WOOTEN, BRENDEN SCHUBERT, ANDREW KENSLER, STEPHEN FRIEDMAN, CHARLIE KILPATRICK, CLIFF RAMSHAW, MARC BAN- NISTER, BRENTON RAYNER, JONATHAN BROUILLAT, and MAX LIANI, Pixar Animation Studios Fig. 1. Path-traced images rendered with RenderMan: Dory and Hank from Finding Dory (© 2016 Disney•Pixar). McQueen’s crash in Cars 3 (© 2017 Disney•Pixar). Shere Khan from Disney’s The Jungle Book (© 2016 Disney). A destroyer and the Death Star from Lucasfilm’s Rogue One: A Star Wars Story (© & ™ 2016 Lucasfilm Ltd. All rights reserved. Used under authorization.) Pixar’s RenderMan renderer is used to render all of Pixar’s films, and by many 1 INTRODUCTION film studios to render visual effects for live-action movies. RenderMan started Pixar’s movies and short films are all rendered with RenderMan. as a scanline renderer based on the Reyes algorithm, and was extended over The first computer-generated (CG) animated feature film, Toy Story, the years with ray tracing and several global illumination algorithms. was rendered with an early version of RenderMan in 1995. The most This paper describes the modern version of RenderMan, a new architec- ture for an extensible and programmable path tracer with many features recent Pixar movies – Finding Dory, Cars 3, and Coco – were rendered that are essential to handle the fiercely complex scenes in movie production. using RenderMan’s modern path tracing architecture. The two left Users can write their own materials using a bxdf interface, and their own images in Figure 1 show high-quality rendering of two challenging light transport algorithms using an integrator interface – or they can use the CG movie scenes with many bounces of specular reflections and materials and light transport algorithms provided with RenderMan.
    [Show full text]
  • Representing and Rendering Surfaces with Points Jaroslav Krivˇ Anek´
    Postgraduate Study Report DC-PSR-2003-03 Representing and Rendering Surfaces with Points Jaroslav Krivˇ anek´ Supervisor: Jirˇ´ı Zˇara´ February 2003 Department of Computer Science and Engineering email: [email protected] Faculty of Electrical Engineering WWW: http://www.cgg.cvut.cz/˜xkrivanj/ Czech Technical University Karlovo nam.´ 13 121 35 Prague 2 Czech Republic This report was prepared as a part of the project Geometry Modeling with Point Sampling This research has been supported by a grant of the Ministry of Education of the Czech Republic number 2159/2002. .................. ......... Jaroslav Krivˇ anek´ Jirˇ´ı Zˇara´ postgraduate student supervisor ii Table of Contents 1 Introduction 1 1.1 Report Scope ....................................... 2 1.2 Report Organization .................................... 2 2 Chronological Overview of Point-Based Modeling and Rendering 3 3 Point-Based Rendering 5 3.1 Point Sample Attributes .................................. 5 3.2 Point Rendering Pipeline ................................. 6 3.3 Visibility and Image Reconstruction ........................... 6 3.3.1 Ignoring Holes .................................. 7 3.3.2 Separate Visibility and Image Reconstruction .................. 7 3.3.3 Splatting ..................................... 10 3.3.4 Up-sampling ................................... 17 3.3.5 Discussion .................................... 18 3.4 Visibility Culling ..................................... 20 3.4.1 View Frustum Culling .............................. 20 3.4.2 Back-Face
    [Show full text]
  • Cameron,Justin-2006.Pdf
    University of Southern Queensland Faculty of Engineering & Surveying Next-generation 3D Graphics Engine Design A dissertation submitted by J. Cameron in fulfilment of the requirements of ENG4112 Research Project towards the degree of Bachelor of Engineering and Bachelor of Information Technology Submitted: November, 2006 Abstract 3D engines, software used to render images from 3D data, for the most part vary little in the technology utilised. All engines commercially available employ the same basic techniques for rasterisation. An alternative approach to that commonly used will be presented, which provides a cleaner result with comparable efficiency. The history of 3D engines dates back before the era of personal computers. With such limited resources of the time, only basic routines could be used. As technology improved, these same methods were improved to eventually form what we now use today. While some of the modern adaptations are innovative, it is put forward that a change in technique from the standard practice is warranted to be more inline with the demanding requirements of modern applications. Currently, all engines use polygons. Polygons consist of 3 points in space, which are joined together by line segments. A plane which passes through all 3 points is then clipped by these lines to form a triangle. Several alternative approaches to this ageing technology were analysed to determine viability on current hardware. Research was limited to approaches which do not use polygons. Several promising methods were found: • Scanline rendering of curves • Forward differencing of curves • ‘3D pixels’ • Micropolygons ii From these alternatives, it was determined the most viable was forward differencing of curves.
    [Show full text]
  • Appendix: Graphics Software Took
    Appendix: Graphics Software Took Appendix Objectives: • Provide a comprehensive list of graphics software tools. • Categorize graphics tools according to their applications. Many tools come with multiple functions. We put a primary category name behind a tool name in the alphabetic index, and put a tool name into multiple categories in the categorized index according to its functions. A.I. Graphics Tools Listed by Categories We have no intention of rating any of the tools. Many tools in the same category are not necessarily of the same quality or at the same capacity level. For example, a software tool may be just a simple function of another powerful package, but it may be free. Low4evel Graphics Libraries 1. DirectX/DirectSD - - 248 2. GKS-3D - - - 278 3. Mesa 342 4. Microsystem 3D Graphic Tools 346 5. OpenGL 370 6. OpenGL For Java (GL4Java; Maps OpenGL and GLU APIs to Java) 281 7. PHIGS 383 8. QuickDraw3D 398 9. XGL - 497 138 Appendix: Graphics Software Toois Visualization Tools 1. 3D Grapher (Illustrates and solves mathematical equations in 2D and 3D) 160 2. 3D Studio VIZ (Architectural and industrial designs and concepts) 167 3. 3DField (Elevation data visualization) 171 4. 3DVIEWNIX (Image, volume, soft tissue display, kinematic analysis) 173 5. Amira (Medicine, biology, chemistry, physics, or engineering data) 193 6. Analyze (MRI, CT, PET, and SPECT) 197 7. AVS (Comprehensive suite of data visualization and analysis) 211 8. Blueberry (Virtual landscape and terrain from real map data) 221 9. Dice (Data organization, runtime visualization, and graphical user interface tools) 247 10. Enliten (Views, analyzes, and manipulates complex visualization scenarios) 260 11.
    [Show full text]
  • Design for Scalability in 3D Computer Graphics Architectures
    Design for Scalability in 3D Computer Graphics Architectures Ph.D. thesis by Hans Holten-Lund, M.Sc. Computer Science and Technology Informatics and Mathematical Modelling Technical University of Denmark http://www.imm.dtu.dk/cst/ July, 2001 This thesis has been submitted in partial fulfillment of the conditions for ac- quiring the Ph.D. degree at the Technical University of Denmark. The Ph.D. study has been carried out at the Section for Computer Systems and Technology at the Department of Informatics and Mathematical Modelling, supervised by Associate Professors Steen Pedersen and Jan Madsen. Copenhagen, July 2001 Hans Holten-Lund ii Abstract This thesis describes useful methods and techniques for designing scalable hybrid parallel rendering architectures for 3D computer graphics. Various techniques for utilizing parallelism in a pipelined system are analyzed. During the Ph.D. study a prototype 3D graphics architecture named Hybris has been developed. Hybris is a prototype rendering architecture which can be tailored to many specific 3D graphics applications and implemented in various ways. Parallel software im- plementations for both single and multi-processor Windows 2000 systems have been demonstrated. Working hardware/software codesign implementations of Hy- bris for standard-cell based ASIC (simulated) and FPGA technologies have been demonstrated, using manual co-synthesis for translation of a Virtual Prototyping architecture specification written in C into both optimized C source for software and into to a synthesizable VHDL specification for hardware implementation. A flexible VRML 97 3D scene graph engine with a Java interface and C++ interface has been implemented to allow flexible integration of the rendering technology into Java and C++ applications.
    [Show full text]
  • 1Dv438 Teori Contents
    1dv438 Teori Contents 1 Math 1 1.1 Basis (linear algebra) ......................................... 1 1.1.1 Definition ........................................... 1 1.1.2 Expression of a basis ..................................... 2 1.1.3 Properties .......................................... 2 1.1.4 Examples ........................................... 3 1.1.5 Extending to a basis ..................................... 3 1.1.6 Example of alternative proofs ................................ 3 1.1.7 Ordered bases and coordinates ................................ 4 1.1.8 Related notions ........................................ 4 1.1.9 Proof that every vector space has a basis ........................... 5 1.1.10 See also ............................................ 6 1.1.11 Notes ............................................. 6 1.1.12 References .......................................... 6 1.1.13 External links ......................................... 6 1.2 Multiplication of vectors ........................................ 6 1.2.1 See also ............................................ 7 1.3 Identity matrix ............................................. 7 1.3.1 See also ............................................ 7 1.3.2 Notes ............................................. 7 1.3.3 External links ......................................... 7 1.4 Translation (geometry) ........................................ 8 1.4.1 Matrix representation ..................................... 8 1.4.2 Translations in physics .................................... 9 1.4.3
    [Show full text]
  • Tesis (1.354Mb)
    DISEÑO Y DESARROLLO DE UN DEMO DE UN JUEGO MULTIMEDIA PARA EL AUTOAPRENDIZAJE DEL PROYECTO EDUCATIVO INSTITUCIONAL DE LA UNIVERSIDAD AUTÓNOMA DE BUCARAMANGA YESID ALBERTO CARO YESIKA LABORDE FORERO UNIVERSIDAD AUTÓNOMA DE BUCARAMANGA FACULTAD DE INGENIERÍA DE SISTEMAS BUCARAMANGA 2007 1 DISEÑO Y DESARROLLO DE UN DEMO DE UN JUEGO MULTIMEDIA PARA EL AUTOAPRENDIZAJE DEL PROYECTO EDUCATIVO INSTITUCIONAL DE LA UNIVERSIDAD AUTÓNOMA DE BUCARAMANGA YESID ALBERTO CARO YESIKA LABORDE FORERO Trabajo de grado para optar al título de Ingeniero de sistemas Director MsC. Román Eduardo Sarmiento Porras UNIVERSIDAD AUTÓNOMA DE BUCARAMANGA FACULTAD DE INGENIERÍA DE SISTEMAS BUCARAMANGA 2007 2 Nota de Aceptación __________________________________ __________________________________ __________________________________ __________________________________ Firma del Jurado __________________________________ Firma del Jurado __________________________________ Firma del Director Bucaramanga, 4 Febrero de 2008 3 TABLA DE CONTENIDO Pág. INTRODUCCIÓN 15 1. ANTECEDENTES 16 2. MARCO CONCEPTUAL 19 2.1 PROYECTO EDUCATIVO INSTITUCIONAL (PEI) 19 2.2 REGLAMENTO DOCENTE Y ESTUDIANTIL DE LA UNAB 20 2.2.1 Derechos del Profesor 21 2.2.2 Deberes de los Profesores 22 2.2.3 Derechos de los Estudiantes 25 4 2.2.4 Deberes del estudiante 26 2.3 ACREDITACIÓN 27 2.4 VIDEOS JUEGOS 29 2.4.1 ¿Qué es un juego? 29 2.4.2 Clase de juegos 29 2.4.3 Las situaciones de juego 34 2.4.4 Juegos Educativos 36 2.4.4.1 Factores Generales 37 2.4.4.2 Factores en la introducción de un Juego 37 2.5 GRÁFICOS
    [Show full text]
  • Polygon Rendering for Interactive Visualization on Multicomputers
    POLYGON RENDERING FOR INTERACTIVE VISUALIZATION ON MULTICOMPUTERS by David Allan Ellsworth A Dissertation submitted to the faculty of The University of North Carolina at Chapel Hill in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Department of Computer Science. Chapel Hill 1996 © 1996 David Ellsworth ALL RIGHTS RESERVED ii DAVID ALLAN ELLSWORTH. Polygon Rendering for Interactive Visualization on Multicomputers (Under the direction of Professor Henry Fuchs). ABSTRACT This dissertation identifies a class of parallel polygon rendering algorithms suitable for interactive use on multicomputers, and presents a methodology for designing efficient algorithms within that class. The methodology was used to design a new polygon rendering algorithm that uses the frame-to-frame coherence of the screen image to evenly partition the rasterization at reasonable cost. An implementation of the algorithm on the Intel Touchstone Delta at Caltech, the largest multicomputer at the time, renders 3.1 million triangles per second. The rate was measured using a 806,640 triangle model and 512 i860 processors, and includes back-facing triangles. A similar algorithm is used in Pixel-Planes 5, a system that has specialized rasterization processors, and which, when introduced, had a benchmark score for the SPEC Graphics Performance Characterization Group “head” benchmark that was nearly four times faster than commercial workstations. The algorithm design methodology also identified significant performance improvements for Pixel-Planes 5. All fully parallel polygon rendering algorithms have a sorting step to redistribute primitives or fragments according to their screen location. The algorithm class mentioned above is one of four classes of parallel rendering algorithms identified; the classes are differentiated by the type of data that is communicated between processors.
    [Show full text]