MODULE - 9. Subject: Computer Science. Module: Line Clipping. Module No: CS/CGV/9
|
|
- Arabella Dean
- 6 years ago
- Views:
Transcription
1 Quadrant 1 e-text e-pg Pathshala MODULE - 9 Subject: Computer Science Paper: Computer Graphics and Visualization Module: Line Clipping Module No: CS/CGV/9 Objectives: Understand Cohen-Sutherland Line Clipping Solve an example problem. Discussion: 2D Clipping: Let s try to understand the theory behind the Cohen-Sutherland Line clipping algorithm. Recall discussion from the previous module that, clipping is performed before conversion of data to device coordinates. Line clipping is an extension of point clipping, where we check the position of a given line with respect to a standard rectangular clip window region. We need to perform tests to determine whether a line is completely inside or completely outside or partially inside. The portion of the line that is inside is only selected for display. Clipping algorithms identify the intersections of the lines with the clip window region and decide which portion of the line is inside and so can be selected for display. Two popular algorithms for line clipping are Cohen-Sutherland line clipper and Liang-Barsky line clipper. An algorithm is considered efficient when with few checks if it decides that the line is completely inside and so can be selected (Trivial Accept) or the line is completely outside and so can be discarded (Trivial Reject) or line is partially inside so intersection checks need to be done. A line has two end points. If both the end points are inside the clip window, it is trivial that the line is completely inside and so can be selected for display. From the figure above it is evident that line
2 P 3 P 4 is completely inside since both the end points P 3 and P 4 are inside (Trivial Accept case). P 1 P 2, P 9 P 10 are completely outside, and so can be discarded. In both these cases both the end points are outside and the line is also completely outside. P 5 P 6 A portion of the line is inside and so find intersection point P 5 and select and display the portion of the line that is inside (P 4 P 5 ). P 7 P 8 Both end points are outside but a portion of the line is inside. For such types we need to calculate two intersection points P 7 and P 8 and display the line P 7 P 8. Both the algorithms for line clipping, Cohen-Sutherland and Liang-Barsky, are efficient algorithms and both can be extended for 3D clipping as well. But it is Liang-Barsky that suits well for implementation in a program. Cohen-Sutherland Line Clipping Procedure: This is a rudimentary level line clipping procedure and is efficient. Two scientists Cohen and Sutherland devised this procedure. The method speeds up the processing of line segments by performing initial tests that reduce the number of intersections that must be calculated particularly in the cases of Trivial Accept and Trivial Reject cases. Imagine that we are dividing the whole space into 9 zones or regions using 4 infinitely extending lines, such that the central region is identified as the clip window region, and remaining 8 regions around the central region are identified relative to the central region as shown in the figure below. Every region is assigned a four digit binary code, called region code that identifies a region. The central region, called the clip window region, is identified with the region code (0000). The region to the left is given a region code The regions to the right, bottom and top have the region codes, 0010, 0100, and 1000 respectively. The other 4 regions in the corners, top left, top right, bottom left, bottom right have the region codes 1001, 1010, 0101, 0110 respectively. Let s see how this region code was arrived at? Each bit position in the region code is used to indicate one of the four surrounding regions relative to the central clip window region. The order of the bits from right to left is as follows Bit 1 : Left region Bit 2 : Right region Bit 3 : Bottom region Bit 4 : Top region For Ex: If a region code is given as 1010, this means, The top and right bits are set (indicated by a binary bit 1) while the left and bottom bits are not set (indicated by a binary bit 0). The answer is that the region with the region code 1010 is the top right of the central region. The central region has the region code 0000.
3 Let s try to understand how this region code is useful in determining the relative position of a line against the clip window. The idea is that for the two end points of a given line we shall compute region code and with simple checks we should be able to decide whether to go for intersection calculations or simply end up with a trivial reject or trivial accept case. Each bit position in the region code is used to indicate one of the four relative coordinate positions of the point with respect to the clip window. The next step is how do we compute region codes for an end point? It is as simple as checking for four conditions (recall the equations from the point clipping discussion in the previous module - 8). Assume 4 infinitely extending lines defined by xw min, xw max, yw min, yw max make up the clip window region. For an end point (x,y), check the first condition, if x<xw min set the left bit of the region code otherwise keep it 0. Than to check the relation for magnitude, it is convenient to check for the sign bit of the relation, x-xw min, i.e., if the sign bit of the relation is set then set the left bit. We can perform similar checks for other three bit positions. Set Bit 1(left): Sign(x xw min ) Set Bit 2(right): sign(xw max x ) Set Bit 3 (bottom): sign(y yw min ) Set Bit 4 (top): sign(yw max y) Compute the region codes for both the end points of a given line. If both the end points have a region code of 0000, then it is a Trivial Accept case, i.e., the line is completely inside and so can be considered for display. In general, a line that is parallel and outside the clip window region, will have, one bit position commonly set in both the region codes of the two end points. For Ex: consider a line that is parallel to the top boundary and is outside will have its region codes, 1001, From the region codes we can simply conclude that the line has one bit position commonly set, i.e. the top bit, so the line is parallel to the top boundary and is outside and so can be discarded. *************************************************************************************************** Steps in the algorithm are as follows o For each end point of a line, compute region code o If both the end points have a region code of 0000, then it is a Trivial Accept case, i.e., the line is completely inside and so can be considered for display o Otherwise perform a bit wise AND operation for the two region codes of the two end points of a line, and if the operation results in a non-zero value, then it can be concluded that the line is outside and is parallel to that boundary represented by that bit position that is is set in the result, and so is a Trivial Reject case. (Ex: consider two region codes 1010, Performing bit-wise AND operation we get, 0010, which is a non-zero value and the bit position commonly set in both the region codes is the right bit position. The result says that the line is an outside line and is parallel to the right boundary.) o Otherwise, if the bit-wise AND operation results in a zero value, the line intersects the clip window and we need to go for intersection calculations. (Ex: Consider a line with region codes for its end points as 0100 and The line is an inclined line, no bit position is commonly set and bit-wise AND operation results in a zero value. So it s obvious to go for intersection calculations.) o If the above cases fail we need to go for intersection calculations. *****************************************************************************************************
4 It is known that, there will be a maximum of two intersection points for a given line, when it intersects clip window, but assuming infinitely extending clip window boundaries, and the line to be clipped being longer, there will be four intersection points, as shown below. The four dots represent the four intersection points, the maximum possible for a line. ywmin ywmin xwmin xwmax We need to check for a maximum of 4 intersection points, for the maximum possible line as shown in the figure above. Intersection points with a clipping boundary can be calculated using the slope-intercept form of the line equation. The y coordinate of the intersection point at vertical line can be computed using the formula ( ) where x is either xwmin or xwmax The x coordinate of the intersection point at horizontal line can be computed using the equation + where y is either ywmin or ywmax. ********************************************************************************************************* Example: Compute the clipped portion of the line at [(0,0), (8,5)], when clipped against the clip window between [(1,2), (7, 6)]. Solution: From the problem, we can note the following data xwmin 1 xwmax 7 ywmin 2 ywmax 6 Starting with left boundary we can calculate intersection points, and continue with the right, bottom, top boundaries.
5 ********************************************************************************************************* In the solution shown above, after the line is clipped against the left boundary, we get an intersection point, P1, discard the portion from P1 to P1 and the line to be sent to the next clipper (right) is P1 P2. With respect to the right clipper, when we clip the line we get another intersection point, P2, and discard the portion from P2 to P2. Now the line between P1 P2 is sent to the bottom clipper. When we clip the portion of the line with respect to the bottom clipper, we compute another intersection point, P1, and discard the line from P1 to P1. When the line is finally sent to the top clipper, no intersection point needs to be computed as the line is completely inside with respect to top boundary. The computation ends and finally the line to be displayed is the line between P1 to P2. Summary: Ø We have learnt how Cohen-Sutherland line clipping works Ø This algorithm also works for clipping in 3D as well. Ø An example problem has been solved
Clipping Lines. Dr. Scott Schaefer
Clipping Lines Dr. Scott Schaefer Why Clip? We do not want to waste time drawing objects that are outside of viewing window (or clipping window) 2/94 Clipping Points Given a point (x, y) and clipping window
More informationComputer Graphics. The Two-Dimensional Viewing. Somsak Walairacht, Computer Engineering, KMITL
Computer Graphics Chapter 6 The Two-Dimensional Viewing Somsak Walairacht, Computer Engineering, KMITL Outline The Two-Dimensional Viewing Pipeline The Clipping Window Normalization and Viewport Transformations
More informationComputer Graphics: Two Dimensional Viewing
Computer Graphics: Two Dimensional Viewing Clipping and Normalized Window By: A. H. Abdul Hafez Abdul.hafez@hku.edu.tr, 1 Outlines 1. End 2 Transformation between 2 coordinate systems To transform positioned
More informationTwo-Dimensional Viewing. Chapter 6
Two-Dimensional Viewing Chapter 6 Viewing Pipeline Two-Dimensional Viewing Two dimensional viewing transformation From world coordinate scene description to device (screen) coordinates Normalization and
More informationCSCI 4620/8626. Computer Graphics Clipping Algorithms (Chapter 8-5 )
CSCI 4620/8626 Computer Graphics Clipping Algorithms (Chapter 8-5 ) Last update: 2016-03-15 Clipping Algorithms A clipping algorithm is any procedure that eliminates those portions of a picture outside
More informationPart 3: 2D Transformation
Part 3: 2D Transformation 1. What do you understand by geometric transformation? Also define the following operation performed by ita. Translation. b. Rotation. c. Scaling. d. Reflection. 2. Explain two
More informationClipping Points Consider a clip window which is rectangular in shape. P(x, y) is a point to be displayed.
Usually only a specified region of a picture needs to be displayed. This region is called the clip window. An algorithm which displays only those primitives (or part of the primitives) which lie inside
More informationComputer Graphics Viewing Objective
Computer Graphics Viewing Objective The aim of this lesson is to make the student aware of the following concepts: Window Viewport Window to Viewport Transformation line clipping Polygon Clipping Introduction
More informationDHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI
DHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI Department of Computer Science and Engineering CS6504-COMPUTER GRAPHICS Anna University 2 & 16 Mark Questions & Answers Year / Semester: III / V Regulation:
More informationMODULE - 4. e-pg Pathshala
e-pg Pathshala MODULE - 4 Subject : Computer Science Paper: Computer Graphics and Visualization Module: Midpoint Circle Drawing Procedure Module No: CS/CGV/4 Quadrant 1 e-text Before going into the Midpoint
More informationExamples. Clipping. The Rendering Pipeline. View Frustum. Normalization. How it is done. Types of operations. Removing what is not seen on the screen
Computer Graphics, Lecture 0 November 7, 006 Eamples Clipping Types of operations Accept Reject Clip Removing what is not seen on the screen The Rendering Pipeline The Graphics pipeline includes one stage
More information3D Rendering Pipeline (for direct illumination)
Clipping 3D Rendering Pipeline (for direct illumination) 3D Primitives 3D Modeling Coordinates Modeling Transformation Lighting 3D Camera Coordinates Projection Transformation Clipping 2D Screen Coordinates
More informationPart IV. 2D Clipping
Part IV 2D Clipping The Liang-Barsky algorithm Boolean operations on polygons Outline The Liang-Barsky algorithm Boolean operations on polygons Clipping The goal of clipping is mainly to eliminate parts
More informationCS123 INTRODUCTION TO COMPUTER GRAPHICS. Clipping. Concepts, Algorithms for line clipping. 1 of 16. Andries van Dam. Clipping - 10/12/17
Clipping Concepts, Algorithms for line clipping 1 of 16 Line Clipping in 2D Clipping endpoints If x min x x max and y min y y max, the point is inside the clip rectangle. Endpoint analysis for lines: if
More informationViewing Transformation. Clipping. 2-D Viewing Transformation
Viewing Transformation Clipping 2-D Viewing Transformation 2-D Viewing Transformation Convert from Window Coordinates to Viewport Coordinates (xw, yw) --> (xv, yv) Maps a world coordinate window to a screen
More informationCS 325 Computer Graphics
CS 325 Computer Graphics 02 / 29 / 2012 Instructor: Michael Eckmann Today s Topics Questions? Comments? Specifying arbitrary views Transforming into Canonical view volume View Volumes Assuming a rectangular
More informationBinghamton University. EngiNet. Thomas J. Watson. School of Engineering and Applied Science. Computer Graphics. State University of New York.
Binghamton University EngiNet State University of New York EngiNet Thomas J. Watson School of Engineering and Applied Science WARNING All rights reserved. No Part of this video lecture series may be reproduced
More informationClipping and Intersection
Clipping and Intersection Clipping: Remove points, line segments, polygons outside a region of interest. Need to discard everything that s outside of our window. Point clipping: Remove points outside window.
More information2D Viewing. Viewing Pipeline: Window-Viewport Transf.
Viewing Pipeline: Window-Viewport Transf. 2D Viewing yw max clipping window: what to display viewport: where to be viewed translation, rotation, scaling, clipping,... Clipping Window yv max Viewport yv
More informationChapter 8: Implementation- Clipping and Rasterization
Chapter 8: Implementation- Clipping and Rasterization Clipping Fundamentals Cohen-Sutherland Parametric Polygons Circles and Curves Text Basic Concepts: The purpose of clipping is to remove objects or
More informationIllumination Models III: Ray Tracing (View Dependent Global Illumination)
Illumination Models III: Ray Tracing (View Dependent Global Illumination) The University of Texas at Austin 1 Basic Definitions Ray Tracing/Casting: Setting: eyepoint, virtual screen (an array of virtual
More informationFrom Vertices To Fragments-1
From Vertices To Fragments-1 1 Objectives Clipping Line-segment clipping polygon clipping 2 Overview At end of the geometric pipeline, vertices have been assembled into primitives Must clip out primitives
More informationMODULE - 7. Subject: Computer Science. Module: Other 2D Transformations. Module No: CS/CGV/7
MODULE - 7 e-pg Pathshala Subject: Computer Science Paper: Computer Graphics and Visualization Module: Other 2D Transformations Module No: CS/CGV/7 Quadrant e-text Objectives: To get introduced to the
More informationUnit 3 Transformations and Clipping
Transformation Unit 3 Transformations and Clipping Changes in orientation, size and shape of an object by changing the coordinate description, is known as Geometric Transformation. Translation To reposition
More informationRenderer Implementation: Basics and Clipping. Overview. Preliminaries. David Carr Virtual Environments, Fundamentals Spring 2005
INSTITUTIONEN FÖR SYSTEMTEKNIK LULEÅ TEKNISKA UNIVERSITET Renderer Implementation: Basics and Clipping David Carr Virtual Environments, Fundamentals Spring 2005 Feb-28-05 SMM009, Basics and Clipping 1
More informationUNIT -8 IMPLEMENTATION
UNIT -8 IMPLEMENTATION 1. Discuss the Bresenham s rasterization algorithm. How is it advantageous when compared to other existing methods? Describe. (Jun2012) 10M Ans: Consider drawing a line on a raster
More informationChapter 1. Linear Equations and Straight Lines. 2 of 71. Copyright 2014, 2010, 2007 Pearson Education, Inc.
Chapter 1 Linear Equations and Straight Lines 2 of 71 Outline 1.1 Coordinate Systems and Graphs 1.4 The Slope of a Straight Line 1.3 The Intersection Point of a Pair of Lines 1.2 Linear Inequalities 1.5
More informationGraphics System. Processor. Output Display. Input Devices. Frame Buffer. Memory. Array of pixels. Resolution: # of pixels Depth: # of bits/pixel
Graphics System Input Devices Processor Memory Frame Buffer Output Display Array of pixels Resolution: # of pixels Depth: # of bits/pixel Input Devices Physical Devices: Keyboard, Mouse, Tablet, etc. Logical
More informationEach point P in the xy-plane corresponds to an ordered pair (x, y) of real numbers called the coordinates of P.
Lecture 7, Part I: Section 1.1 Rectangular Coordinates Rectangular or Cartesian coordinate system Pythagorean theorem Distance formula Midpoint formula Lecture 7, Part II: Section 1.2 Graph of Equations
More informationwindow World space (Object space)
Lecture. D Transformations 1 Reading Required: ffl Hearn and Baker, Sections.1.,.,.1.,. Optional: ffl Foley et al., Chapter.1. ffl David F. Rogers and J. Alan Adams, Mathematical Elements for Computer
More informationAbout Graphing Lines
About Graphing Lines TABLE OF CONTENTS About Graphing Lines... 1 What is a LINE SEGMENT?... 1 Ordered Pairs... 1 Cartesian Co-ordinate System... 1 Ordered Pairs... 2 Line Segments... 2 Slope of a Line
More informationIntro. To Graphing Linear Equations
Intro. To Graphing Linear Equations The Coordinate Plane A. The coordinate plane has 4 quadrants. B. Each point in the coordinate plain has an x-coordinate (the abscissa) and a y-coordinate (the ordinate).
More informationLast class. A vertex (w x, w y, w z, w) - clipping is in the - windowing and viewport normalized view volume if: - scan conversion/ rasterization
Lecture 6 Last class Last lecture (clip coordinates): A vertex (w x, w y, w z, w) - clipping is in the - windowing and viewport normalized view volume if: - scan conversion/ rasterization normalized view
More informationSection 7D Systems of Linear Equations
Section 7D Systems of Linear Equations Companies often look at more than one equation of a line when analyzing how their business is doing. For example a company might look at a cost equation and a profit
More informationFLC Ch 3. Ex 1 Plot the points Ex 2 Give the coordinates of each point shown. Sec 3.2: Solutions and Graphs of Linear Equations
Math 100 Elementary Algebra Sec 3.1: The Rectangular Coordinate System x-axis and y-axis origin ordered pair x-coordinate y-coordinate quadrants (I, II, III, and IV) Rectangular/Cartesian Coordinate System
More informationComputer Graphics (CS 543) Lecture 9 (Part 2): Clipping. Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI)
Computer Graphics (CS 543) Lecture 9 (Part 2): Clipping Prof Emmanuel Agu Computer Science Dept. Worcester Polytechnic Institute (WPI) OpenGL Stages After projection, several stages before objects drawn
More informationFast Algorithms for Line Segment and Line Clipping in E 2
Fast Algorithms for Line Segment and Line Clipping in E 2 Duc Huy Bui, Václav Skala Department of Informatics and Computer Science 1 University of West Bohemia Univerzitní 22, Box 314 306 14 Plzen Czech
More informationState the domain and range of the relation. EX: {(-1,1), (1,5), (0,3)} 1 P a g e Province Mathematics Southwest TN Community College
A relation is a set of ordered pairs of real numbers. The domain, D, of a relation is the set of all first coordinates of the ordered pairs in the relation (the xs). The range, R, of a relation is the
More informationSet the Viewport. Set the Viewport Clipping. Set the Viewport. Set the Viewport. Set the Viewport. Resizing the Viewport W = H
To draw an undistorted version of the data in a viewport, you need to ensure the viewport and the window have the same aspect ratio. i.e. W H window window W = H viewport viewport Computer Graphics CSC470
More informationVertical Line Test a relationship is a function, if NO vertical line intersects the graph more than once
Algebra 2 Chapter 2 Domain input values, X (x, y) Range output values, Y (x, y) Function For each input, there is exactly one output Example: Vertical Line Test a relationship is a function, if NO vertical
More informationGraphics Pipeline. CS535 Fall Daniel G. Aliaga Department of Computer Science Purdue University
Graphics Pipeline CS535 Fall 2016 Daniel G. Aliaga Department of Computer Science Purdue University Ray-tracing Inverse mapping for every pixel construct a ray from the eye for every object in the scene
More informationOverview. Pipeline implementation I. Overview. Required Tasks. Preliminaries Clipping. Hidden Surface removal
Overview Pipeline implementation I Preliminaries Clipping Line clipping Hidden Surface removal Overview At end of the geometric pipeline, vertices have been assembled into primitives Must clip out primitives
More information0,0 is referred to as the end point.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 Chapter 2: Radical Functions 2.1 Radical Functions and Transformations (Day 1) For the function y x, the radicand, x, must
More informationRealtime 3D Computer Graphics Virtual Reality
Realtime 3D Computer Graphics Virtual Reality From Vertices to Fragments Overview Overall goal recapitulation: Input: World description, e.g., set of vertices and states for objects, attributes, camera,
More informationLesson 20: Every Line is a Graph of a Linear Equation
Student Outcomes Students know that any non vertical line is the graph of a linear equation in the form of, where is a constant. Students write the equation that represents the graph of a line. Lesson
More informationThe Coordinate System and Graphs
The Coordinate System and Graphs - 3.1-3.2 Fall 2013 - Math 1010 (Math 1010) M 1010 3.1-3.2 1 / 17 Roadmap Plotting ordered pairs. The distance formula. The midpoint formula. Graphs of equations. Intercepts.
More informationSection 18-1: Graphical Representation of Linear Equations and Functions
Section 18-1: Graphical Representation of Linear Equations and Functions Prepare a table of solutions and locate the solutions on a coordinate system: f(x) = 2x 5 Learning Outcome 2 Write x + 3 = 5 as
More informationSection 1.1 The Distance and Midpoint Formulas; Graphing Utilities; Introduction to Graphing Equations
Section 1.1 The Distance and Midpoint Formulas; Graphing Utilities; Introduction to Graphing Equations origin (x, y) Ordered pair (x-coordinate, y-coordinate) (abscissa, ordinate) x axis Rectangular or
More information(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.
Code No: R05221201 Set No. 1 1. (a) List and explain the applications of Computer Graphics. (b) With a neat cross- sectional view explain the functioning of CRT devices. 2. (a) Write the modified version
More informationTwo Dimensional Viewing
Two Dimensional Viewing Dr. S.M. Malaek Assistant: M. Younesi Two Dimensional Viewing Basic Interactive Programming Basic Interactive Programming User controls contents, structure, and appearance of objects
More informationGeometry Unit 2: Linear. Section Page and Problems Date Assigned
Geometry Name: Geometry Unit 2: Linear Topics Covered: Midpoint formula Distance formula Slope Slope- Intercept Form Point- Slope Form Standard Form Assignment # Section Page and Problems Date Assigned
More informationUNIVERSITY OF NEBRASKA AT OMAHA Computer Science 4620/8626 Computer Graphics Spring 2014 Homework Set 1 Suggested Answers
UNIVERSITY OF NEBRASKA AT OMAHA Computer Science 4620/8626 Computer Graphics Spring 2014 Homework Set 1 Suggested Answers 1. How long would it take to load an 800 by 600 frame buffer with 16 bits per pixel
More informationA Procedure to Clip Line Segment
Vol.5, No.1 (2014), pp.9-20 http://dx.doi.org/10.14257/ijcg.2014.5.1.02 A Procedure to Clip Line Segment Bimal Kumar Ray School of Information Technology & Engineering VIT University, Vellore 632014, India
More informationSec 4.1 Coordinates and Scatter Plots. Coordinate Plane: Formed by two real number lines that intersect at a right angle.
Algebra I Chapter 4 Notes Name Sec 4.1 Coordinates and Scatter Plots Coordinate Plane: Formed by two real number lines that intersect at a right angle. X-axis: The horizontal axis Y-axis: The vertical
More informationReview for Mastery Using Graphs and Tables to Solve Linear Systems
3-1 Using Graphs and Tables to Solve Linear Systems A linear system of equations is a set of two or more linear equations. To solve a linear system, find all the ordered pairs (x, y) that make both equations
More informationUNIT 2. Translation/ Scaling/ Rotation. Unit-02/Lecture-01
UNIT 2 Translation/ Scaling/ Rotation Unit-02/Lecture-01 Translation- (RGPV-2009,10,11,13,14) Translation is to move, or parallel shift, a figure. We use a simple point as a starting point. This is a simple
More informationToday. CS-184: Computer Graphics. Lecture #10: Clipping and Hidden Surfaces. Clipping. Hidden Surface Removal
Today CS-184: Computer Graphics Lecture #10: Clipping and Hidden Surfaces!! Prof. James O Brien University of California, Berkeley! V2015-S-10-1.0 Clipping Clipping to view volume Clipping arbitrary polygons
More informationChapter 12: Quadratic and Cubic Graphs
Chapter 12: Quadratic and Cubic Graphs Section 12.1 Quadratic Graphs x 2 + 2 a 2 + 2a - 6 r r 2 x 2 5x + 8 2y 2 + 9y + 2 All the above equations contain a squared number. They are therefore called quadratic
More informationClipping Algorithms; 8-5. Computer Graphics. Spring CS4815
Computer Graphics Spring 2016-2017 Outline Clipping Algorithms; 8-5 1 Clipping Algorithms; 8-5 Announcements Mid-term: Week07?? Clipping: Introduction It is common for a region to be defined so that only
More information15. Clipping. Projection Transformation. Projection Matrix. Perspective Division
15. Clipping Procedures for eliminating all parts of primitives outside of the specified view volume are referred to as clipping algorithms or simply clipping This takes place as part of the Projection
More informationMath 1313 Prerequisites/Test 1 Review
Math 1313 Prerequisites/Test 1 Review Test 1 (Prerequisite Test) is the only exam that can be done from ANYWHERE online. Two attempts. See Online Assignments in your CASA account. Note the deadline too.
More informationComputer Graphics (CS 543) Lecture 10 (Part 1): 3D Clipping. Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI)
Computer Graphics (CS 543) Lecture 10 (Part 1): 3D Clipping Prof Emmanuel Agu Computer Science Dept. Worcester Polytechnic Institute (WPI) Liang Barsky 3D Clipping Goal: Clip object edge-by-edge against
More informationMini-Lecture 3.1 Graphing Equations
Copyright 0 Pearson Education, Inc. Mini-Lecture. Graphing Equations. Plot ordered pairs.. Determine whether an ordered pair of numbers is a solution to an equation in two variables.. Graph linear equations.
More informationALGORITHMS COMPLEXITY AND LINE CLIPPING PROBLEM SOLUTIONS
ALGORITHMS COMPLEXITY AND LINE CLIPPING PROBLEM SOLUTIONS Vaclav Skala 1 Department of Informatics and Computer Science University of West Bohemia, Univerzitní 22, Box 314 306 14 Plzen Czech Republic Skala@kiv.zcu.cz
More informationComputer Graphics Geometry and Transform
! Computer Graphics 2014! 5. Geometry and Transform Hongxin Zhang State Key Lab of CAD&CG, Zhejiang University 2014-10-11! Today outline Triangle rasterization Basic vector algebra ~ geometry! Antialiasing
More informationWindowing And Clipping (14 Marks)
Window: 1. A world-coordinate area selected for display is called a window. 2. It consists of a visual area containing some of the graphical user interface of the program it belongs to and is framed by
More informationDid You Find a Parking Space?
Lesson.4 Skills Practice Name Date Did You Find a Parking Space? Parallel and Perpendicular Lines on the Coordinate Plane Vocabulary Complete the sentence. 1. The point-slope form of the equation of the
More informationPolar Coordinates. 2, π and ( )
Polar Coordinates Up to this point we ve dealt exclusively with the Cartesian (or Rectangular, or x-y) coordinate system. However, as we will see, this is not always the easiest coordinate system to work
More information11.4. Imagine that you are, right now, facing a clock and reading the time on that. Spin to Win. Volume of Cones and Pyramids
Spin to Win Volume of Cones and Pyramids.4 Learning Goals In this lesson, you will: Rotate two-dimensional plane figures to generate three-dimensional figures. Give an informal argument for the volume
More informationFunctions. Copyright Cengage Learning. All rights reserved.
Functions Copyright Cengage Learning. All rights reserved. 2.2 Graphs Of Functions Copyright Cengage Learning. All rights reserved. Objectives Graphing Functions by Plotting Points Graphing Functions with
More information10-2 Circles. Warm Up Lesson Presentation Lesson Quiz. Holt Algebra2 2
10-2 Circles Warm Up Lesson Presentation Lesson Quiz Holt Algebra2 2 Warm Up Find the slope of the line that connects each pair of points. 1. (5, 7) and ( 1, 6) 1 6 2. (3, 4) and ( 4, 3) 1 Warm Up Find
More informationSRM INSTITUTE OF SCIENCE AND TECHNOLOGY
SRM INSTITUTE OF SCIENCE AND TECHNOLOGY DEPARTMENT OF INFORMATION TECHNOLOGY QUESTION BANK SUB.NAME: COMPUTER GRAPHICS SUB.CODE: IT307 CLASS : III/IT UNIT-1 2-marks 1. What is the various applications
More information2.1 Derivatives and Rates of Change
2.1 Derivatives and Rates of Change In this chapter we study a special type of limit, called a derivative, that occurs when we want to find a slope of a tangent line, or a velocity, or any instantaneous
More informationVectors and the Geometry of Space
Vectors and the Geometry of Space In Figure 11.43, consider the line L through the point P(x 1, y 1, z 1 ) and parallel to the vector. The vector v is a direction vector for the line L, and a, b, and c
More informationCS602 Midterm Subjective Solved with Reference By WELL WISHER (Aqua Leo)
CS602 Midterm Subjective Solved with Reference By WELL WISHER (Aqua Leo) www.vucybarien.com Question No: 1 What are the two focusing methods in CRT? Explain briefly. Page no : 26 1. Electrostatic focusing
More informationThe shortest distance from point K to line is the length of a segment perpendicular to from point K. Draw a perpendicular segment from K to.
8. Find the distance between each pair of parallel lines with the given equations. Copy each figure. Construct the segment that represents the distance indicated. 12. K to The shortest distance from point
More information2 Unit Bridging Course Day 2 Linear functions I: Gradients
1 / 33 2 Unit Bridging Course Day 2 Linear functions I: Gradients Clinton Boys 2 / 33 Linear functions Linear functions are a particularly simple and special type of functions. They are widely used in
More informationSection 10.1 Polar Coordinates
Section 10.1 Polar Coordinates Up until now, we have always graphed using the rectangular coordinate system (also called the Cartesian coordinate system). In this section we will learn about another system,
More informationAlgebra Unit 2: Linear Functions Notes. Slope Notes. 4 Types of Slope. Slope from a Formula
Undefined Slope Notes Types of Slope Zero Slope Slope can be described in several ways: Steepness of a line Rate of change rate of increase or decrease Rise Run Change (difference) in y over change (difference)
More information4.5 VISIBLE SURFACE DETECTION METHODES
4.5 VISIBLE SURFACE DETECTION METHODES A major consideration in the generation of realistic graphics displays is identifying those parts of a scene that are visible from a chosen viewing position. There
More informationChapter 8 Three-Dimensional Viewing Operations
Projections Chapter 8 Three-Dimensional Viewing Operations Figure 8.1 Classification of planar geometric projections Figure 8.2 Planar projection Figure 8.3 Parallel-oblique projection Figure 8.4 Orthographic
More informationUse the graph shown to determine whether each system is consistent or inconsistent and if it is independent or dependent.
Use the graph shown to determine whether each system is consistent or inconsistent and if it is independent or dependent. 12. y = 3x + 4 y = 3x 4 These two equations do not intersect, so they are inconsistent.
More informationCS 450: COMPUTER GRAPHICS REVIEW: CLIPPING SPRING 2015 DR. MICHAEL J. REALE
CS 45: COMPUTER GRAPHICS REVIEW: CLIPPING SPRING 215 DR. MICHAEL J. REALE CLIPPING Clipping = removing part or all of the primitives otside of the clipping volme/window Clipping volme in OpenGL nit cbe
More informationSNAP Centre Workshop. Graphing Lines
SNAP Centre Workshop Graphing Lines 45 Graphing a Line Using Test Values A simple way to linear equation involves finding test values, plotting the points on a coordinate plane, and connecting the points.
More informationLecture 4. If P1(x1,y1) and P2(x2,y2) are points on a non-vertical line, then the slope m of the line is defined by
Lines Lecture 4 In this section we shall discuss ways to measure the "steepness" or "slope" of a line in the plane. The ideas we develop here will be important when we discuss equations and graphs of straight
More informationFROM VERTICES TO FRAGMENTS. Lecture 5 Comp3080 Computer Graphics HKBU
FROM VERTICES TO FRAGMENTS Lecture 5 Comp3080 Computer Graphics HKBU OBJECTIVES Introduce basic implementation strategies Clipping Scan conversion OCTOBER 9, 2011 2 OVERVIEW At end of the geometric pipeline,
More information10 Polar Coordinates, Parametric Equations
Polar Coordinates, Parametric Equations ½¼º½ ÈÓÐ Ö ÓÓÖ Ò Ø Coordinate systems are tools that let us use algebraic methods to understand geometry While the rectangular (also called Cartesian) coordinates
More informationGraphing Linear Equations
Graphing Linear Equations Question 1: What is a rectangular coordinate system? Answer 1: The rectangular coordinate system is used to graph points and equations. To create the rectangular coordinate system,
More informationChapter 3A Rectangular Coordinate System
Fry Texas A&M University! Math 150! Spring 2015!!! Unit 4!!! 1 Chapter 3A Rectangular Coordinate System A is any set of ordered pairs of real numbers. The of the relation is the set of all first elements
More information12 Polar Coordinates, Parametric Equations
54 Chapter Polar Coordinates, Parametric Equations Polar Coordinates, Parametric Equations Just as we describe curves in the plane using equations involving x and y, so can we describe curves using equations
More informationQuestion 2: How do you solve a linear programming problem with a graph?
Question : How do you solve a linear programming problem with a graph? Now that we have several linear programming problems, let s look at how we can solve them using the graph of the system of inequalities.
More informationCSE528 Computer Graphics: Theory, Algorithms, and Applications
CSE528 Computer Graphics: Theory, Algorithms, and Applications Hong Qin Stony Brook University (SUNY at Stony Brook) Stony Brook, New York 11794-2424 Tel: (631)632-845; Fax: (631)632-8334 qin@cs.stonybrook.edu
More informationSE Mock Online Test 1-CG
SE Mock Online Test 1-CG 1. Email address * 2. 1. For gentle slope line, slope m is -1
More informationCS488. Implementation of projections. Luc RENAMBOT
CS488 Implementation of projections Luc RENAMBOT 1 3D Graphics Convert a set of polygons in a 3D world into an image on a 2D screen After theoretical view Implementation 2 Transformations P(X,Y,Z) Modeling
More informationSection 3.1 Graphing Using the Rectangular Coordinate System
Objectives Section 3.1 Graphing Using the Rectangular Coordinate System n Construct a rectangular coordinate system n Plot ordered pairs and determine the coordinates of a point n Graph paired data n Read
More informationThree-Dimensional Viewing Hearn & Baker Chapter 7
Three-Dimensional Viewing Hearn & Baker Chapter 7 Overview 3D viewing involves some tasks that are not present in 2D viewing: Projection, Visibility checks, Lighting effects, etc. Overview First, set up
More informationGraphs and Linear Functions
Graphs and Linear Functions A -dimensional graph is a visual representation of a relationship between two variables given by an equation or an inequality. Graphs help us solve algebraic problems by analysing
More informationSTRAIGHT LINE GRAPHS THE COORDINATES OF A POINT. The coordinates of any point are written as an ordered pair (x, y)
THE COORDINATES OF A POINT STRAIGHT LINE GRAPHS The coordinates of any point are written as an ordered pair (x, y) Point P in the diagram has coordinates (2, 3). Its horizontal distance along the x axis
More informationSection Graphs and Lines
Section 1.1 - Graphs and Lines The first chapter of this text is a review of College Algebra skills that you will need as you move through the course. This is a review, so you should have some familiarity
More informationProblems of Plane analytic geometry
1) Consider the vectors u(16, 1) and v( 1, 1). Find out a vector w perpendicular (orthogonal) to v and verifies u w = 0. 2) Consider the vectors u( 6, p) and v(10, 2). Find out the value(s) of parameter
More information