CMT315 - Computer Graphics & Visual Computing

Similar documents
(a) rotating 45 0 about the origin and then translating in the direction of vector I by 4 units and (b) translating and then rotation.

KRISTU JYOTI COLLEGE OF MANAGEMENT & TECHNOLOGY QUESTION BANK BCA SEMESTER III Computer graphics Part A (2 marks questions)

OXFORD ENGINEERING COLLEGE (NAAC Accredited with B Grade) DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING LIST OF QUESTIONS

Course Title: Computer Graphics Course no: CSC209

CHETTINAD COLLEGE OF ENGINEERING & TECHNOLOGY CS2401 COMPUTER GRAPHICS QUESTION BANK

Development of Computer Graphics

CHAPTER 1 Graphics Systems and Models 3

Development of Computer Graphics. mid 1950s SAGE air defense system command & control CRT, light pens

Module Contact: Dr Stephen Laycock, CMP Copyright of the University of East Anglia Version 1

Institutionen för systemteknik

SRM INSTITUTE OF SCIENCE AND TECHNOLOGY

End-Term Examination

Spring 2012 Final. CS184 - Foundations of Computer Graphics. University of California at Berkeley

FROM VERTICES TO FRAGMENTS. Lecture 5 Comp3080 Computer Graphics HKBU

QUESTION BANK 10CS65 : COMPUTER GRAPHICS AND VISUALIZATION

Roll No. :... Invigilator's Signature : GRAPHICS AND MULTIMEDIA. Time Allotted : 3 Hours Full Marks : 70

Scan line algorithm. Jacobs University Visualization and Computer Graphics Lab : Graphics and Visualization 272

VALLIAMMAI ENGINEERING COLLEGE

CSE 167: Introduction to Computer Graphics Lecture #4: Vertex Transformation

2: Introducing image synthesis. Some orientation how did we get here? Graphics system architecture Overview of OpenGL / GLU / GLUT

Computer Graphics Geometry and Transform

CMSC 435/634: Introduction to Graphics

CS184 : Foundations of Computer Graphics Professor David Forsyth Final Examination

Einführung in Visual Computing

Reading. 18. Projections and Z-buffers. Required: Watt, Section , 6.3, 6.6 (esp. intro and subsections 1, 4, and 8 10), Further reading:

SRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR

CS184 : Foundations of Computer Graphics Professor David Forsyth Final Examination (Total: 100 marks)


CS452/552; EE465/505. Clipping & Scan Conversion

Graphics Hardware and Display Devices

Pipeline Operations. CS 4620 Lecture Steve Marschner. Cornell CS4620 Spring 2018 Lecture 11

UNIVERSITY OF NEBRASKA AT OMAHA Computer Science 4620/8626 Computer Graphics Spring 2014 Homework Set 1 Suggested Answers

CS230 : Computer Graphics Lecture 4. Tamar Shinar Computer Science & Engineering UC Riverside

CS 4731: Computer Graphics Lecture 21: Raster Graphics: Drawing Lines. Emmanuel Agu

CSE 167: Lecture #4: Vertex Transformation. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2012

Interactive Computer Graphics A TOP-DOWN APPROACH WITH SHADER-BASED OPENGL

graphics pipeline computer graphics graphics pipeline 2009 fabio pellacini 1

Pipeline Operations. CS 4620 Lecture 14

graphics pipeline computer graphics graphics pipeline 2009 fabio pellacini 1

The University of Calgary

Topics and things to know about them:

CS130 : Computer Graphics Lecture 2: Graphics Pipeline. Tamar Shinar Computer Science & Engineering UC Riverside

COMP371 COMPUTER GRAPHICS

CS 130 Final. Fall 2015

Spring 2009 Prof. Hyesoon Kim


CSCE 441 Computer Graphics Fall 2018

C P S C 314 S H A D E R S, O P E N G L, & J S RENDERING PIPELINE. Mikhail Bessmeltsev

Incremental Form. Idea. More efficient if we look at d k, the value of the decision variable at x = k

Computer Graphics and Visualization. Graphics Systems and Models

Computer Graphics. Chapter 1 (Related to Introduction to Computer Graphics Using Java 2D and 3D)

CS 543: Computer Graphics. Rasterization

CS 464 Review. Review of Computer Graphics for Final Exam

The Traditional Graphics Pipeline

Computer Science 426 Midterm 3/11/04, 1:30PM-2:50PM

Overview. Pipeline implementation I. Overview. Required Tasks. Preliminaries Clipping. Hidden Surface removal

Today. Rendering pipeline. Rendering pipeline. Object vs. Image order. Rendering engine Rendering engine (jtrt) Computergrafik. Rendering pipeline

Module 13C: Using The 3D Graphics APIs OpenGL ES

03 Vector Graphics. Multimedia Systems. 2D and 3D Graphics, Transformations

Computer Graphics Lecture 2

The Rendering Pipeline (1)

CS2401 COMPUTER GRAPHICS ANNA UNIV QUESTION BANK

Advanced Shading I: Shadow Rasterization Techniques

The Traditional Graphics Pipeline

Clipping. Angel and Shreiner: Interactive Computer Graphics 7E Addison-Wesley 2015

For each question, indicate whether the statement is true or false by circling T or F, respectively.

CS427 Multicore Architecture and Parallel Computing

Spring 2011 Prof. Hyesoon Kim

CS602 Midterm Subjective Solved with Reference By WELL WISHER (Aqua Leo)

Computer Graphics (CS 543) Lecture 9 (Part 2): Clipping. Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI)

Fall CSCI 420: Computer Graphics. 7.1 Rasterization. Hao Li.

3D Polygon Rendering. Many applications use rendering of 3D polygons with direct illumination

CIS 581 Interactive Computer Graphics (slides based on Dr. Han-Wei Shen s slides) Requirements. Reference Books. Textbook

Roll No. : Invigilator's Signature :.. GRAPHICS AND MULTIMEDIA. Time Allotted : 3 Hours Full Marks : 70

Points and lines, Line drawing algorithms. Circle generating algorithms, Midpoint circle Parallel version of these algorithms

Drawing Fast The Graphics Pipeline

The Traditional Graphics Pipeline

Chapter 8: Implementation- Clipping and Rasterization

CS130 : Computer Graphics. Tamar Shinar Computer Science & Engineering UC Riverside

GLOBAL EDITION. Interactive Computer Graphics. A Top-Down Approach with WebGL SEVENTH EDITION. Edward Angel Dave Shreiner

CS559: Computer Graphics. Lecture 12: Antialiasing & Visibility Li Zhang Spring 2008

Discrete Techniques. 11 th Week, Define a buffer by its spatial resolution (n m) and its depth (or precision) k, the number of

Computer Graphics. Attributes of Graphics Primitives. Somsak Walairacht, Computer Engineering, KMITL 1

CSCI 420 Computer Graphics Lecture 14. Rasterization. Scan Conversion Antialiasing [Angel Ch. 6] Jernej Barbic University of Southern California

Lahore University of Management Sciences. CS 452 Computer Graphics

Buffers, Textures, Compositing, and Blending. Overview. Buffers. David Carr Virtual Environments, Fundamentals Spring 2005 Based on Slides by E.

From Vertices to Fragments: Rasterization. Reading Assignment: Chapter 7. Special memory where pixel colors are stored.

Lecture 6 of 41. Scan Conversion 1 of 2: Midpoint Algorithm for Lines and Ellipses

Lecture 6 of 41. Scan Conversion 1 of 2: Midpoint Algorithm for Lines and Ellipses

Last Time: Acceleration Data Structures for Ray Tracing. Schedule. Today. Shadows & Light Sources. Shadows

Rasterization. Rasterization (scan conversion) Digital Differential Analyzer (DDA) Rasterizing a line. Digital Differential Analyzer (DDA)

Computer Graphics I Lecture 11

Lets assume each object has a defined colour. Hence our illumination model is looks unrealistic.

Projections and Hardware Rendering. Brian Curless CSE 557 Fall 2014

Pipeline implementation II

Rasterization Overview

CS 4620 Program 3: Pipeline

Pipeline Operations. CS 4620 Lecture 10

From 3D World to 2D Screen. Hendrik Speleers

Computer Graphics. Anders Hast. måndag 25 mars 13

Transcription:

UNIVERSITI SAINS MALAYSIA Stamford College First Semester Examination 2004/2005 Academic Session October 2004 External Degree Programme Bachelor of Computer Science (Hons.) CMT315 - Computer Graphics & Visual Computing Duration : 2 hours INSTRUCTIONS TO CANDIDATE : Please ensure that this examination paper contains FIVE questions in SIX printed pages before you start the examination. Answer any FOUR (4) questions. Where an algorithm or coding is asked for, you may write in any suitable pseudocode. Correct syntax for any programming language is not expected. On each page, write only your Index Number.

2 1. (a) An output device has 525 scan lines, with the size of raster (in bytes) being 183 750 bytes, and each pixel consist of 4 bits. Calculate the aspect ratio (the height and width aspect) of this device. (20/100) (b) Various attempts to build special-purpose graphics systems have been proposed, these includes the display processors and the pipeline architectures? Briefly explain each architecture, and explain what problems (or advantages) that each architecture trying to solve over the use of general-purpose computer in early graphics system. (25/100) (c) (i) The result of the scan conversion is an image stored on frame buffer and later displayed on our monitor. What is scan conversion? Assume that the monitor is CRT, list and explain the characteristics of a good CRT monitor to display colour image. The two words interlaced and non-interlaced occur frequently in discussions about the refresh rate of CRT monitors. What do they mean? (25/100) (d) Write an OpenGL code segment to draw the following objects. Note that you must use either GL-LINE-STRIP or GL - LINE - LOOP only. Note, to help your drawing, you can invent your own coordinates values for the objects below.

3 2. (a) For each of the following logical input device, describe their functionality i.e. what being captured/measured, how and when they are used (i) (iii) (iv) (v) String Locator Pick Choice Stroke (b) In a typical graphics application program, the programmer must decide whether or not to use display lists. Consider at least two applications. For each, list at least two factors in favor and at least two factors against the use of display list. (c) A triangle with the vertices of (0,0,0), (1,1,0) and (5,2,0) is to be modified to twice its original size but with the point (1, 1,0) is fixed to its original position, and then the triangle is to be rotated 90 degree about a line that goes through origin to point (2,2,2) with (4,4,4) as a fixed point. Sketch the drawing of the triangle at each of the step as described in the above. Label your sketches clearly indicating the axes, types of operations, and reference point/line. Write OpenGL codes to construct the triangle, and to carry out the transformation operations as specified above. (40/100)

4 3. (a) This question is about the Cohen-Sutherland line clipping algorithm : Carefully discuss the rationale behind the various tests and methods for calculating the intersection of line segment(s) with clipping window in Cohen-Sutherland line clipping algorithm? Calculate the number of arithmetic and logical operations performed in the Cohen-Sutherland line clipping algorithm for several different line orientations relative to a clipping window. (b) Aliasing is an undesirable effect often found in computer generated images - staircase effects or jaggies are quite visible on the edges of polygon or line segments. Show with appropriate illustrations, how antialiasing by area averaging technique solve this problem. It was said this visual artifact can be eliminated for good by increasing the resolutions of the frame buffer. Discuss this statement by providing justifications of whether you agree or against it. A test of whether a point is inside/outside a polygon provide the basis for many fill area algorithms. Fill the area inside the following polygon using odd-even rule and winding-number rule. Show the result of each rule separately. In a scan line fill area algorithm, illustrate with appropriate diagram how this algorithm solves the problem known as singularity?

5 4. (a) This question is related to the concept of viewing and projection in OpenGL. Viewing transformation is one of a series of transformations in the graphics pipeline. Explain what this transformation does (the effect on the objects after the transformation). Provide at least one OpenGL's API that performed this transformation, and briefly describe how it functions. Projection normalization is an essential part in the projection transformation, in which view volume is converted to canonical form (a unit cube). Explain why is this process is essential. Another way of saying it is what will happen if we do not do projection normalization? (b) Phong Reflection Model (PRM) provides a simple formula to simulate the interaction between light and material (object) to produce a realistic output. Briefly describe the main components of PRM, explain the rationale for each of this component, and show how they are combined to calculate pixel intensity. Often, when a large polygon is shaded by Open GL, it is rendered brightly in one area and more dimly in others. Explain why the image is uneven. Describe how you can avoid this problem. (c) Gouraud shading is claimed to produce image that is smoother and more realistic compared to the image shaded with Phong method. Argue this statement by providing justification either supporting or against it.

- 6 5. (a) (i) Sketch the Bezier curve with control points. (Note that only an estimate of the curve is required, not the exact curve.) Pl=(5,5,0), P2=(8,5,0), P3=(10,8,0), and P4=(10,10,0) ; List and explain important features of Bezier curve, use diagram whenever appropriate to support your answer. (32/100) (b) Visualization is a new field emerging from the applications of computer graphics. (i) (iii) (iv) What is it, and why it is an important field? Compare and contrast the differences between scientific visualization and business visualization. What are the types of data and visualization techniques commonly used in scientific visualization? Give two examples of application of visualization, include in your answer how visualization techniques are used in the chosen applications. (c) (i) The alpha component in RGBA mode can be used to blend colours from various objects that contribute to the same pixel. Describe, how this process of compositing is done. Logical exclusive-or operation (XOR) is an interesting writing mode. Why it is so? Give an example where XOR mode is useful in graphics application. (33/100) -0000000-