Window to viewport transformation&matrix representation of homogeneous coordinates
Download as PPTX, PDF4 likes4,321 views
The document discusses window to viewport transformation and the use of homogeneous coordinates. A window defines the area of data to display, while a viewport defines where on the display device the window will appear. Window to viewport transformation maps the window coordinates to viewport coordinates using translation and resizing. Homogeneous coordinates represent points using an extra dimension, allowing rotation, scaling and other transformations to be represented using matrix multiplication.
1 of 14
Downloaded 65 times
Ad
Recommended
Window to viewport transformation
Window to viewport transformationAnkit Garg The document discusses window to viewport transformation. It defines a window as a world coordinate area selected for display and a viewport as a rectangular region of the screen selected for displaying objects. Window to viewport mapping requires transforming coordinates from the window to the viewport. This involves translation, scaling and another translation. Steps include translating the window to the origin, resizing it based on the viewport size, and translating it to the viewport position. An example transforms a sample window to a viewport through these three steps.
HOMOGENEOUS CO-ORDINATES IN COMPUTER GRAPHICS PPT
HOMOGENEOUS CO-ORDINATES IN COMPUTER GRAPHICS PPTAhtesham Ullah khan In mathematics, homogeneous coordinates or projective coordinates. This ppt is about the use of coordinates in graphics
2D transformation (Computer Graphics)
2D transformation (Computer Graphics)Timbal Mayank with today's advanced technology like photoshop, paint etc. we need to understand some basic concepts like how they are cropping the image , tilt the image etc.
In our presentation you will find basic introduction of 2D transformation.
Polygon clipping
Polygon clippingMohd Arif Polygon clipping involves taking a polygon and clipping it against another shape to produce one or more smaller polygons. The Sutherland-Hodgman algorithm handles polygon clipping by testing each edge of the clipping polygon against each edge of the clip shape. There are four cases for how an edge can be clipped - wholly inside, exit, wholly outside, enter - and the algorithm saves or discards vertices based on these cases. Repeatedly clipping against each edge of the clip shape handles all cases and produces the final clipped polygon(s).
3d transformation computer graphics 
3d transformation computer graphics University of Potsdam This document provides an overview of 3D transformations, including translation, rotation, scaling, reflection, and shearing. It explains that 3D transformations generalize 2D transformations by including a z-coordinate and using homogeneous coordinates and 4x4 transformation matrices. Each type of 3D transformation is defined using matrix representations and equations. Rotation is described for each coordinate axis, and reflection is explained for each axis plane. Shearing is introduced as a way to modify object shapes, especially for perspective projections.
3D transformation in computer graphics
3D transformation in computer graphicsSHIVANI SONI This document discusses different types of 2D and 3D transformations that are used in computer graphics, including translation, rotation, scaling, shearing, and reflection. It provides the mathematical equations and transformation matrices used to perform each type of transformation on 2D and 3D points and objects. Key types of rotations discussed are roll (around z-axis), pitch (around x-axis), and yaw (around y-axis). Homogeneous coordinates are introduced for representing 3D points.
Composite transformation
Composite transformationPooja Dixit The document discusses composite transformations, which involve performing two or more transformations in sequence. It provides examples that two successive translations can be represented as a single translation, and two successive rotations can be represented as a single rotation. It also explains that scaling an object with respect to a fixed point can be achieved through a sequence of translations, scaling around the origin, and inverse translations, as represented by a composite matrix.
Cohen sutherland line clipping
Cohen sutherland line clippingMani Kanth The Cohen-Sutherland algorithm divides the plane into 9 regions and uses 4-bit codes to encode whether each endpoint of a line segment is left, right, above, or below the clipping window. It then uses the endpoint codes to either trivially accept or reject the line segment, or perform clipping by calculating the intersection point of the line with the window boundary and replacing the outside endpoint. The main steps are to assign codes to endpoints, AND the codes to check for trivial acceptance or rejection, clip by replacing outside endpoints if needed, and repeating for other line segments.
Windows to viewport transformation
Windows to viewport transformationPrashant Singh The document discusses the window-to-viewport transformation process which maps a 2D scene to device coordinates. It involves developing formulas to proportionally map points from the world window to the viewport. The scale and translation factors that relate the world window and viewport coordinates are defined. Changing the viewport position, using multiple viewports, or adjusting the viewport dimensions allows manipulating the displayed scene. Distortion may occur if the aspect ratios of the world window and viewport differ.
Computer graphics curves and surfaces (1)
Computer graphics curves and surfaces (1)RohitK71 For Script:
https://docs.google.com/document/d/1mIRkjPU_3Y69qR42swSkvQ0qwJo-116AuC3aX8fvjuc/edit?usp=sharing
Computer graphics basic transformation
Computer graphics basic transformationSelvakumar Gna This document discusses 2D geometric transformations including translation, rotation, and scaling. It provides the mathematical definitions and matrix representations for each transformation. Translation moves an object along a straight path, rotation moves it along a circular path, and scaling changes its size. All transformations can be represented by 3x3 matrices using homogeneous coordinates to allow combinations of multiple transformations. The inverse of each transformation matrix is also defined.
Clipping computer graphics
Clipping computer graphicsShaishavShah8 Clipping is the process of removing graphics that are outside the viewing area. There are different types of clipping including point, line, area/polygon, curve, and text clipping. Line clipping algorithms like Cohen-Sutherland and Liang-Barsky use line endpoints and intersection calculations to determine which portions of a line are inside the clip region. Polygon clipping algorithms like Sutherland-Hodgman and Weiler-Atherton process polygon vertices and edges to generate clipped polygon areas. Curve and text clipping also use bounding areas and intersection calculations to clip complex graphical elements.
Polygon filling
Polygon fillingMohanlal Sukhadia University (MLSU) The document discusses different techniques for filling polygons, including boundary fill, flood fill, and scan-line fill methods. It provides details on how each technique works, such as using a seed point and filling neighboring pixels for boundary fill, replacing all pixels of a selected color for flood fill, and drawing pixels between edge intersections for each scan line for scan-line fill. Examples are given to illustrate the filling process for each method.
Scan line method
Scan line methodPooja Dixit This document summarizes the scan-line rendering algorithm. It maintains two tables - an edge table containing line coordinates and surface pointers, and a polygon table containing surface properties. For each scan line, all intersecting surfaces are examined to determine the visible surface. Depths are calculated to set surface flags and populate the image buffer with intensity values from the visible surface. Coherence between scan lines is exploited to reuse prior visibility calculations where edge intersections remain the same.
Halftoning in Computer Graphics
Halftoning in Computer GraphicsUniversity of Potsdam Halftoning is the process of converting a greyscale image to a binary image made up of black and white dots. In newspapers, halftoning simulates greyscale using patterns of black dots of varying sizes on a white background. Traditionally, halftoning was done photographically by projecting an image through a halftone screen with an etched grid onto film. Different screen frequencies control dot size. Digital halftoning techniques include patterning, which replaces each pixel with a pattern from a binary font, and dithering, which thresholds the image against a dither matrix to determine black and white pixels.
Computer Graphics - clipping
Computer Graphics - clippingHisham Al Kurdi, EAVA, DMC-D-4K, HCCA-P, HCAA-D Clipping identifies portions of a scene outside a specified clip window region. There are different types of clipping for different graphics elements. The Cohen-Sutherland algorithm assigns a binary code to line endpoints based on their position relative to the clip window boundaries, and uses logical AND operations on the codes to determine if a line needs clipping or can be fully accepted or rejected. It iteratively clips portions of a line outside the window until the line is fully processed.
3D Transformation in Computer Graphics
3D Transformation in Computer Graphicssabbirantor Transformation:
Transformations are a fundamental part of the computer graphics. Transformations are the movement of the object in Cartesian plane.
Types of transformation
Why we use transformation
3D Transformation
3D Translation
3D Rotation
3D Scaling
3D Reflection
3D Shearing
Graphics_3D viewing
Graphics_3D viewingRabin BK All the information regarding 3D viewing is here. The whole presentation consists mainly of 3D viewing pipeline. This slide will make you clear about how one can have a 3d viewing of an object.
Shading methods
Shading methodsRakesh Pandey This document discusses different methods for shading 3D graphics objects rendered as polygons, including flat shading (assigning a single color to each polygon), Gouraud shading (interpolating colors across polygon surfaces), Phong shading (interpolating normal vectors and applying lighting models at each surface point), and fast Phong shading (approximating Phong shading calculations for improved performance). Gouraud shading improves on flat shading by removing intensity discontinuities, while Phong shading produces more realistic highlights but requires more computation.
Quadric surfaces
Quadric surfacesAnkur Kumar A frequently used class of objects are the quadric surfaces, which are described with second-degree equations (quadratics). They include spheres, ellipsoids, tori, paraboloids, and hyperboloids.
Quadric surfaces, particularly spheres and ellipsoids, are common elements of graphics scenes
Clipping
ClippingAMIT VIRAMGAMI This document discusses different techniques for computer graphics clipping. It describes point clipping, line clipping using the Cohen-Sutherland and Liang-Barsky algorithms, area/polygon clipping using the Sutherland-Hodgman and Weiler-Atherton algorithms, curve clipping, and text clipping. Various preliminary tests and intersection calculations are used to identify and remove graphic elements that are outside the clipping region.
Reflection transformation
Reflection transformationMani Kanth This document discusses reflection and composite transformations in computer graphics. Reflection is defined as a 180 degree rotation that produces a mirror image. There are two types of reflection: horizontal reflection across the y-axis and vertical reflection across the x-axis. A composite transformation performs two or more transformations sequentially, such as a translation followed by a reflection. Solving a composite transformation involves translating an object to rotate it around another point, applying the rotation, and translating back.
3 d viewing projection
3 d viewing projectionPooja Dixit The document discusses different methods for 3D display and projection. It describes parallel projection, where lines of sight are parallel, and perspective projection, where lines converge at vanishing points. The key types of projection are outlined as parallel (orthographic and oblique) and perspective. Orthographic projection uses perpendicular lines, while oblique projection uses arbitrary angles. Perspective projection creates realistic size variation with distance and can have one, two, or three vanishing points.
Spline representations
Spline representationsNikhil krishnan a spline is a flexible strip used to produce a smooth curve through a designated set of points.
Polynomial sections are fitted so that the curve passes through each control point, Resulting curve is said to interpolate the set of control points.
Unit 3
Unit 3ypnrao The document discusses the 2D viewing pipeline. It describes how a 3D world coordinate scene is constructed and then transformed through a series of steps to 2D device coordinates that can be displayed. These steps include converting to viewing coordinates using a window-to-viewport transformation, then mapping to normalized and finally device coordinates. It also covers techniques for clipping objects and lines that fall outside the viewing window including Cohen-Sutherland line clipping and Sutherland-Hodgeman polygon clipping.
3D Transformation
3D TransformationSwatiHans10 This document discusses various 3D transformations including translation, rotation, scaling, reflection, and shearing. It provides the transformation matrices for each type of 3D transformation. It also discusses combining multiple transformations through composite transformations by multiplying the matrices in sequence from right to left.
Window to Viewport Transformation in Computer Graphics with.pptx
Window to Viewport Transformation in Computer Graphics with.pptxDolchandra The document discusses the window to viewport transformation process which maps a 3D world coordinate system to a 2D device coordinate system for display. It involves scaling, rotation, translation and clipping transformations. A window defines the region of the 3D world to view, while the viewport defines where on the display device this window will be mapped. The mapping from world coordinates within the window to device coordinates within the viewport involves coordinate system transformations. Zooming effects are achieved by changing the relative sizes of the window and viewport.
Attributes of output primitives( curve attributes & area fill attributes)
Attributes of output primitives( curve attributes & area fill attributes)shalinikarunakaran1 Curve attributes and area fill attributes in output primitives can be customized. Areas can be filled with solid colors or patterns, with options to choose specific colors and patterns. There are three basic area fill styles - hollow with a color border, filled with a solid color, or filled with a specified pattern. The fill style is selected using the setInteriorStyle function, which can set the style to hollow, solid, or pattern. Hatching patterns can also be used to fill areas.
2 d viewing computer graphics
2 d viewing computer graphicsKALESHWAR KUMAR The document discusses 2D viewing and clipping techniques in computer graphics. It describes how clipping is used to select only a portion of an image to display by defining a clipping region. It also discusses 2D viewing transformations which involve operations like translation, rotation and scaling to map coordinates from a world coordinate system to a device coordinate system. It specifically describes the Cohen-Sutherland line clipping algorithm which uses region codes to quickly determine if lines are completely inside, outside or intersect the clipping region to optimize the clipping calculation.
Ad
More Related Content
What's hot (20)
Windows to viewport transformation
Windows to viewport transformationPrashant Singh The document discusses the window-to-viewport transformation process which maps a 2D scene to device coordinates. It involves developing formulas to proportionally map points from the world window to the viewport. The scale and translation factors that relate the world window and viewport coordinates are defined. Changing the viewport position, using multiple viewports, or adjusting the viewport dimensions allows manipulating the displayed scene. Distortion may occur if the aspect ratios of the world window and viewport differ.
Computer graphics curves and surfaces (1)
Computer graphics curves and surfaces (1)RohitK71 For Script:
https://docs.google.com/document/d/1mIRkjPU_3Y69qR42swSkvQ0qwJo-116AuC3aX8fvjuc/edit?usp=sharing
Computer graphics basic transformation
Computer graphics basic transformationSelvakumar Gna This document discusses 2D geometric transformations including translation, rotation, and scaling. It provides the mathematical definitions and matrix representations for each transformation. Translation moves an object along a straight path, rotation moves it along a circular path, and scaling changes its size. All transformations can be represented by 3x3 matrices using homogeneous coordinates to allow combinations of multiple transformations. The inverse of each transformation matrix is also defined.
Clipping computer graphics
Clipping computer graphicsShaishavShah8 Clipping is the process of removing graphics that are outside the viewing area. There are different types of clipping including point, line, area/polygon, curve, and text clipping. Line clipping algorithms like Cohen-Sutherland and Liang-Barsky use line endpoints and intersection calculations to determine which portions of a line are inside the clip region. Polygon clipping algorithms like Sutherland-Hodgman and Weiler-Atherton process polygon vertices and edges to generate clipped polygon areas. Curve and text clipping also use bounding areas and intersection calculations to clip complex graphical elements.
Polygon filling
Polygon fillingMohanlal Sukhadia University (MLSU) The document discusses different techniques for filling polygons, including boundary fill, flood fill, and scan-line fill methods. It provides details on how each technique works, such as using a seed point and filling neighboring pixels for boundary fill, replacing all pixels of a selected color for flood fill, and drawing pixels between edge intersections for each scan line for scan-line fill. Examples are given to illustrate the filling process for each method.
Scan line method
Scan line methodPooja Dixit This document summarizes the scan-line rendering algorithm. It maintains two tables - an edge table containing line coordinates and surface pointers, and a polygon table containing surface properties. For each scan line, all intersecting surfaces are examined to determine the visible surface. Depths are calculated to set surface flags and populate the image buffer with intensity values from the visible surface. Coherence between scan lines is exploited to reuse prior visibility calculations where edge intersections remain the same.
Halftoning in Computer Graphics
Halftoning in Computer GraphicsUniversity of Potsdam Halftoning is the process of converting a greyscale image to a binary image made up of black and white dots. In newspapers, halftoning simulates greyscale using patterns of black dots of varying sizes on a white background. Traditionally, halftoning was done photographically by projecting an image through a halftone screen with an etched grid onto film. Different screen frequencies control dot size. Digital halftoning techniques include patterning, which replaces each pixel with a pattern from a binary font, and dithering, which thresholds the image against a dither matrix to determine black and white pixels.
Computer Graphics - clipping
Computer Graphics - clippingHisham Al Kurdi, EAVA, DMC-D-4K, HCCA-P, HCAA-D Clipping identifies portions of a scene outside a specified clip window region. There are different types of clipping for different graphics elements. The Cohen-Sutherland algorithm assigns a binary code to line endpoints based on their position relative to the clip window boundaries, and uses logical AND operations on the codes to determine if a line needs clipping or can be fully accepted or rejected. It iteratively clips portions of a line outside the window until the line is fully processed.
3D Transformation in Computer Graphics
3D Transformation in Computer Graphicssabbirantor Transformation:
Transformations are a fundamental part of the computer graphics. Transformations are the movement of the object in Cartesian plane.
Types of transformation
Why we use transformation
3D Transformation
3D Translation
3D Rotation
3D Scaling
3D Reflection
3D Shearing
Graphics_3D viewing
Graphics_3D viewingRabin BK All the information regarding 3D viewing is here. The whole presentation consists mainly of 3D viewing pipeline. This slide will make you clear about how one can have a 3d viewing of an object.
Shading methods
Shading methodsRakesh Pandey This document discusses different methods for shading 3D graphics objects rendered as polygons, including flat shading (assigning a single color to each polygon), Gouraud shading (interpolating colors across polygon surfaces), Phong shading (interpolating normal vectors and applying lighting models at each surface point), and fast Phong shading (approximating Phong shading calculations for improved performance). Gouraud shading improves on flat shading by removing intensity discontinuities, while Phong shading produces more realistic highlights but requires more computation.
Quadric surfaces
Quadric surfacesAnkur Kumar A frequently used class of objects are the quadric surfaces, which are described with second-degree equations (quadratics). They include spheres, ellipsoids, tori, paraboloids, and hyperboloids.
Quadric surfaces, particularly spheres and ellipsoids, are common elements of graphics scenes
Clipping
ClippingAMIT VIRAMGAMI This document discusses different techniques for computer graphics clipping. It describes point clipping, line clipping using the Cohen-Sutherland and Liang-Barsky algorithms, area/polygon clipping using the Sutherland-Hodgman and Weiler-Atherton algorithms, curve clipping, and text clipping. Various preliminary tests and intersection calculations are used to identify and remove graphic elements that are outside the clipping region.
Reflection transformation
Reflection transformationMani Kanth This document discusses reflection and composite transformations in computer graphics. Reflection is defined as a 180 degree rotation that produces a mirror image. There are two types of reflection: horizontal reflection across the y-axis and vertical reflection across the x-axis. A composite transformation performs two or more transformations sequentially, such as a translation followed by a reflection. Solving a composite transformation involves translating an object to rotate it around another point, applying the rotation, and translating back.
3 d viewing projection
3 d viewing projectionPooja Dixit The document discusses different methods for 3D display and projection. It describes parallel projection, where lines of sight are parallel, and perspective projection, where lines converge at vanishing points. The key types of projection are outlined as parallel (orthographic and oblique) and perspective. Orthographic projection uses perpendicular lines, while oblique projection uses arbitrary angles. Perspective projection creates realistic size variation with distance and can have one, two, or three vanishing points.
Spline representations
Spline representationsNikhil krishnan a spline is a flexible strip used to produce a smooth curve through a designated set of points.
Polynomial sections are fitted so that the curve passes through each control point, Resulting curve is said to interpolate the set of control points.
Unit 3
Unit 3ypnrao The document discusses the 2D viewing pipeline. It describes how a 3D world coordinate scene is constructed and then transformed through a series of steps to 2D device coordinates that can be displayed. These steps include converting to viewing coordinates using a window-to-viewport transformation, then mapping to normalized and finally device coordinates. It also covers techniques for clipping objects and lines that fall outside the viewing window including Cohen-Sutherland line clipping and Sutherland-Hodgeman polygon clipping.
3D Transformation
3D TransformationSwatiHans10 This document discusses various 3D transformations including translation, rotation, scaling, reflection, and shearing. It provides the transformation matrices for each type of 3D transformation. It also discusses combining multiple transformations through composite transformations by multiplying the matrices in sequence from right to left.
Window to Viewport Transformation in Computer Graphics with.pptx
Window to Viewport Transformation in Computer Graphics with.pptxDolchandra The document discusses the window to viewport transformation process which maps a 3D world coordinate system to a 2D device coordinate system for display. It involves scaling, rotation, translation and clipping transformations. A window defines the region of the 3D world to view, while the viewport defines where on the display device this window will be mapped. The mapping from world coordinates within the window to device coordinates within the viewport involves coordinate system transformations. Zooming effects are achieved by changing the relative sizes of the window and viewport.
Attributes of output primitives( curve attributes & area fill attributes)
Attributes of output primitives( curve attributes & area fill attributes)shalinikarunakaran1 Curve attributes and area fill attributes in output primitives can be customized. Areas can be filled with solid colors or patterns, with options to choose specific colors and patterns. There are three basic area fill styles - hollow with a color border, filled with a solid color, or filled with a specified pattern. The fill style is selected using the setInteriorStyle function, which can set the style to hollow, solid, or pattern. Hatching patterns can also be used to fill areas.
Similar to Window to viewport transformation&matrix representation of homogeneous coordinates (20)
2 d viewing computer graphics
2 d viewing computer graphicsKALESHWAR KUMAR The document discusses 2D viewing and clipping techniques in computer graphics. It describes how clipping is used to select only a portion of an image to display by defining a clipping region. It also discusses 2D viewing transformations which involve operations like translation, rotation and scaling to map coordinates from a world coordinate system to a device coordinate system. It specifically describes the Cohen-Sutherland line clipping algorithm which uses region codes to quickly determine if lines are completely inside, outside or intersect the clipping region to optimize the clipping calculation.
Window to Viewport Transformation in Computer Graphics with.pptx
Window to Viewport Transformation in Computer Graphics with.pptxDolchandra The document discusses the window to viewport transformation process which maps a 3D world coordinate system to a 2D device coordinate system for display. It involves scaling, rotation, translation and clipping transformations. A window defines the region of the 3D world to view, while the viewport defines where on the display device this window will be mapped to. The mapping from world coordinates within the window to device coordinates within the viewport involves coordinate system transformations. Zooming effects are achieved by changing the relative sizes of the window and viewport.
Clipping CG ppt.pptx
Clipping CG ppt.pptxAamirSheikh49 This document discusses different types of clipping used in computer graphics. It describes point clipping, line clipping, and area clipping to determine the visible and invisible portions of an image within a clip window. Point clipping checks if a point is inside the clip window bounds based on its x and y coordinates. Line clipping finds the intersection point of a line with the clip window to determine the visible and clipped portions. Window to viewport clipping is the process of transforming 2D world coordinates to device coordinates to map objects within the clipping window to the screen viewport for display. Mathematical calculations using scaling factors are used to account for differences in sizes between the clipping window and viewport.
4. THREE DIMENSIONAL DISPLAY METHODS
4. THREE DIMENSIONAL DISPLAY METHODSSanthiNivas It gives the detailed information about Three Dimensional Display Methods, Three dimensional Graphics Package, Interactive Input Methods and Graphical User Interface, Input of Graphical Data, Graphical Data: Input Functions, Interactive Picture-Construction
UNIT_3-Two-Dimensional-Geometric-Transformations.pdf
UNIT_3-Two-Dimensional-Geometric-Transformations.pdfVivekKumar148171 This document discusses two-dimensional geometric transformations in computer graphics. It begins by introducing basic 2D transformations including translation, rotation, scaling, reflection, and shearing. It then explains how homogeneous coordinates can be used to represent all geometric transformations as matrix multiplications. The first transformation discussed in detail is translation, which repositions an object by adding translation distances tx and ty to the original x and y coordinates.
UNIT_3-Two-Dimensional-Geometric-Transformations.pptx
UNIT_3-Two-Dimensional-Geometric-Transformations.pptxAnil Yadav UNIT_3-Two-Dimensional-Geometric-Transformations.pptx
UNIT-III
UNIT-IIIVarthiniRamesh 1.BASIC TRANSFORMATION
2. MATRIX REPRESENTATION
3.COMPOSITE TRANSFORMATION
4.WINDOWS TO VIEW PORT TRANSFORMATION
5.CLIPPING
6.POINT CLIPPING
7.LINE CLIPPING
8.COHEN-SUTHERLAND LINE CLIPPING
Unit 4 notes
Unit 4 notesBalamurugan M The document discusses two-dimensional viewing and clipping techniques in computer graphics. It describes how a window defines the scene to view and a viewport defines where it is displayed. Different transformations map the window coordinates to normalized device coordinates. Clipping techniques like Cohen-Sutherland clipping and Liang-Barsky clipping are used to only display the parts of lines and polygons within the viewport boundaries. Text clipping can be done by bounding text as a whole, character-by-character, or by clipping individual character components.
Lec08112004.pdf
Lec08112004.pdfLalithaPonnam The document describes the 2D viewing pipeline which includes clipping windows, viewports, and transformations between them. It discusses how a clipping window in world coordinates can be specified using a viewing coordinate system defined by a base position and view up vector. It also explains how points in the clipping window are mapped to a normalized viewport and then to the actual device viewport through a series of transformations and matrices.
affine transformation for computer graphics
affine transformation for computer graphicsDrSUGANYADEVIK Graphics toolkits take geometry as input and output pixel data. They handle rendering details. OpenGL is an open standard graphics toolkit that provides functions for modeling, rendering, and manipulating the framebuffer. It is portable, hardware supported, and simple to program. In the coming weeks, the document will cover the math and algorithms behind OpenGL and how to access them. Coordinate systems are fundamental to graphics and describe point locations. Transformations convert between systems.
Bhavesh window clipping slidshare
Bhavesh window clipping slidshareBhavesh Panchal This document discusses windowing and clipping in computer graphics. It defines the world coordinate system, which stores graphical information, and the screen coordinate system, which is used for display. A window selects a portion of the model for viewing in the viewport, which is the area on screen where the window is displayed. The window to viewport transformation maps the model from world to screen coordinates using scaling and translation. Clipping removes portions of lines and curves outside the window boundaries. The Sutherland-Cohen algorithm clips lines by calculating intersection points with the window edges.
Computer Graphics lecture.pptx
Computer Graphics lecture.pptxNishkaSharma5 This document provides an overview of computer graphics. It discusses what computer graphics is, the basic components of a computer graphics system including display devices like CRT monitors. It describes the two main techniques for displaying images on a CRT - vector/random scan and raster scan. The document also discusses color CRT monitors and the two techniques used - beam penetration and shadow mask. It outlines several applications of computer graphics like user interfaces, modeling, simulation and animation.
3D Math Primer: CocoaConf Chicago
3D Math Primer: CocoaConf ChicagoJanie Clayton This is a primer on some of the foundations of 3D math used in computer graphics programming. This is the version of the talk from CocoaConf Chicago 2015.
ch4.pptx
ch4.pptxOnkarTalekar4 Windowing and clipping are techniques used in computer graphics to select and display portions of an image or drawing. Windowing refers to selecting a region or "window" to view. The viewport defines the area on the display device where the window will be mapped. Clipping determines which parts of an image or drawing are visible within the window by dividing elements into visible and invisible portions. Common clipping techniques include point, line, polygon and curve clipping. The Cohen-Sutherland and Liang-Barsky algorithms are used for line clipping, and Sutherland-Hodgeman for polygon clipping. Midpoint subdivision is another line clipping method.
Notes04.pdf
Notes04.pdfMukeshKumar605825 Three-dimensional viewing involves considering the spatial position from which an object can be viewed, projecting 3D descriptions of objects onto a 2D viewing surface, and enclosing visible space within clipping boundaries. The viewing pipeline involves a series of transformations that convert 3D coordinates to 2D device coordinates for display. Parallel and perspective projections are two basic projection methods that transform 3D positions to 2D viewing coordinates in different ways.
3 d graphics with opengl part 2
3 d graphics with opengl part 2Sardar Alam The 3D graphics rendering pipeline consists of 4 main stages: 1) vertex processing, 2) rasterization, 3) fragment processing, and 4) output merging. In vertex processing, transformations are applied to position objects in the scene and camera. Rasterization converts vertex data into fragments and performs operations like clipping and scan conversion. Fragment processing handles texture mapping and lighting. Output merging combines fragments and uses the z-buffer to remove hidden surfaces when displaying the final pixels.
module 3 ppt2 (1).pptx
module 3 ppt2 (1).pptxRADHIKAB20 The document discusses several techniques for interactive picture construction in computer graphics, including basic positioning using coordinates, constraints for alignment and orientation, grids for snapping to intersections, gravity fields for connecting to nearby lines, rubber banding for stretching lines, and dragging and drawing tools. Key techniques are constraints, grids, gravity fields, rubber banding, and various painting and drawing options.
Ad
More from Mani Kanth (20)
White box testing 
White box testing Mani Kanth White box testing involves testing the internal structure and code of a software program, allowing testers to see inside the "box". It is used to test for internal security holes, code paths, expected outputs, and functionality of conditional statements. It involves understanding the source code and creating test cases to execute each process individually through manual testing and testing tools. Common techniques include statement, branch, condition coverage, and path testing. White box testing can thoroughly test all code paths but is complex, expensive, time-consuming, and requires professional resources with programming expertise.
Unit testing 
Unit testing Mani Kanth Unit testing involves individually testing small units or modules of code, such as functions, classes, or programs, to determine if they are fit for use. The goal is to isolate each part of a program and verify that it works as intended, helps reduce defects early in the development process, and improves code design. Unit testing is typically done by developers to test their code meets its design before integration testing.
System testing
System testingMani Kanth System testing is the third level of software testing that evaluates a fully integrated software system to ensure it meets specified requirements. It tests the complete and fully configured system by using black box testing methods. Independent testers will prepare, review, rework and finalize the system test plan and test cases before performing the system testing on the complete integrated software.
management of maintainance
management of maintainanceMani Kanth The document discusses software maintenance. It defines software maintenance as modifications made to software after delivery to correct faults, improve performance, or adapt to changes. Maintenance is needed to fix errors, meet changing user requirements, adapt to new hardware/software environments, improve efficiency, and optimize code. The aim of maintenance is to correct errors, enhance software functions, update software, and adapt software to cope with environmental changes. There are four categories of maintenance: corrective, adaptive, perfective, and preventive.
Se (techniques for black box testing ppt)
Se (techniques for black box testing ppt)Mani Kanth This document discusses techniques for black box testing software. It defines black box testing as testing software functionality without knowledge of its internal implementation or code structure. The techniques described are equivalence partitioning, boundary value analysis, state transition testing, graph-based testing, error guessing, and comparison testing. Equivalence partitioning divides inputs into classes based on similar outcomes to reduce test cases. Boundary value analysis focuses on edge cases rather than the full input range. State transition testing checks behavior changes between states with the same inputs. Graph-based testing visualizes the relationships between inputs and outputs. Error guessing leverages the tester's experience to find common mistakes. Comparison testing looks for differences between versions of the same software.
Reverse engineering in software engineering vaibhav
Reverse engineering in software engineering vaibhavMani Kanth Reverse engineering in software engineering involves taking apart computer programs to understand how they work without having access to the original source code. It is done to retrieve lost source code, study how a program performs operations, improve performance, fix bugs, or adapt a program for a new processor. Tools like hexadecimal dumpers, disassemblers, and debuggers are used to reverse engineer programs by displaying the binary machine code in a readable format and avoiding disassembling data portions. There are different types of reverse engineering, including hardware and 3D imaging versions, but it risks legal issues if not done carefully to avoid claims of intellectual property theft.
Mutation testing 1
Mutation testing 1Mani Kanth Mutation testing is a technique that rewrites source code in small ways to remove redundancies. It introduces artificial faults to test whether tests can detect these faults. It benefits developers by bringing new kinds of errors to light that conventional testing may miss. There are three main types of mutations: value mutations change values to test for errors; decision mutations alter conditions to check for design flaws; and statement mutations modify statements through deletion or duplication to simulate copy/paste errors. Mutation testing is a powerful method for detecting hidden defects.
Mutation testing
Mutation testingMani Kanth Mutation testing is a technique that rewrites source code in small ways to remove redundancies. It introduces artificial faults to test whether tests can detect these faults. It benefits developers by bringing new kinds of errors to light that conventional testing may miss. There are three main types of mutations: value mutations change values to test for errors; decision mutations change conditions to check for design flaws; and statement mutations modify statements through deletion or duplication to test for copy/paste errors. Mutation testing is a powerful method for detecting hidden defects.
Guideline for euivalence class testing
Guideline for euivalence class testingMani Kanth Equivalence class testing is a software testing technique that involves grouping test input data into classes to test a software product. It helps ensure all scenarios are tested accurately. Guidelines for equivalence class testing include using robust forms for high priority error conditions, defining input data precisely using intervals and discrete values, selecting one valid and one invalid input for each condition, and potentially needing multiple attempts to establish proper equivalence relations.
Equivalence class testing
Equivalence class testingMani Kanth Equivalence class testing is a software testing technique that divides input values into valid and invalid categories called equivalence classes. Representative values are selected from each class as test data. This technique reduces the number of test cases needed while maintaining thorough coverage. An example divides numbers into classes of valid 2-3 digit numbers and invalid single digit numbers to test a program's valid and invalid number handling. There are different types of equivalence class testing that vary in robustness. The technique helps reduce testing time and cases but requires expertise to define classes and may not test all boundary conditions.
Deployment
DeploymentMani Kanth A deployment diagram shows the physical implementation and architecture of a system. It includes nodes which represent hardware or software elements, artifacts which are products of development like files, and connections which depict communication between nodes. Node types are devices and execution environments. Artifacts are denoted by boxes with the <<artifact>> stereotype. Connectors define the physical links between nodes, sometimes using stereotypes. An example deployment diagram displays a web server, database server, and user machine. Deployment diagrams visualize hardware topology, model physical elements and connections between them, and describe processing nodes at runtime.
unit testing
unit testingMani Kanth Unit testing involves individually testing small units or modules of code, such as functions, classes, or programs, to determine if they are fit for use. The goal is to isolate each part of a program and verify that each part works as intended. Unit testing has advantages like reducing defects in new or changed code, lowering the costs of testing by finding bugs early, and improving code design and refactoring through techniques like black box, white box, and gray box testing.
The sutherland hodgeman polygon clipping algorithm
The sutherland hodgeman polygon clipping algorithmMani Kanth The document discusses the Sutherland Hodgeman polygon clipping algorithm. It is used to clip a polygon by specifying a clipping window. The algorithm clips the vertices of the polygon against each edge of the clipping window by finding intersection points. If an edge is not completely inside the clipping window, the portion outside is clipped off. An example is provided to demonstrate clipping a polygon ABCDE against a clipping window PQRS.
Seed filling algorithm
Seed filling algorithmMani Kanth The document discusses two algorithms for filling polygons: boundary fill and flood fill. Boundary fill starts at a point inside the polygon and fills pixels until it reaches the boundary color. Flood fill replaces all pixels of a specified interior color with a fill color. Both can be implemented with 4-connected or 8-connected pixels. Flood fill colors the entire area but uses more memory, while boundary fill stops at the boundary and is more efficient.
Scaling and shearing
Scaling and shearingMani Kanth This document discusses scaling and shearing transformations in 2D geometry. Scaling transformations change the size of an object by multiplying its original coordinates by a scaling factor. Scaling can be uniform, changing both x and y coordinates by the same factor, or non-uniform, changing the factors differently. Shearing transformations slant the shape of an object by adding a multiple of one coordinate to the other. There are x-shearing, y-shearing, and combined x-y shearing transformations. Scaling and shearing are examples of non-rigid body transformations that change the shape or size of an object.
Raster and random scan display types of input devices
Raster and random scan display types of input devicesMani Kanth The document discusses various input devices for computers. It describes keyboards as the most common input device for entering text into computers. Mice are described as the most popular pointing device, used to control cursor position and click on screen elements. Other input devices covered include joysticks for cursor positioning, light pens for screen selection, scanners for digitizing documents, microphones for sound input, bar code readers for scanning codes, and webcams for digital image capture.
Polygon clipping with sutherland hodgeman algorithm and scan line fill algorithm
Polygon clipping with sutherland hodgeman algorithm and scan line fill algorithmMani Kanth This document discusses two computer graphics algorithms: the Sutherland-Hodgman polygon clipping algorithm and the scan line fill algorithm. The Sutherland-Hodgman algorithm clips polygons against the boundaries of a clip window by testing each polygon edge against each clip window edge. The scan line fill algorithm fills polygons by drawing between intersection points of polygon edges and horizontal scan lines from top to bottom. It handles polygon corners and edge endpoints to correctly determine the interior and exterior regions.
Mid point circle algorithm
Mid point circle algorithmMani Kanth This document describes the midpoint circle algorithm for drawing circles given a radius and center point. It works by starting at an initial point on the circumference, calculating a decision parameter, and then iteratively determining the next point by testing if the decision parameter is positive or negative and updating the parameter according to the point's coordinates. It also explains how to determine additional points in the other octants and shift the calculated pixel positions to be centered on the given center point.
Graphics software and standards
Graphics software and standardsMani Kanth Graphics software acts as an intermediary between application programs and graphics hardware, supporting output primitives and interaction devices. There are two main types of graphics software: general programming packages that provide extensive graphics functions for use in languages like C and FORTRAN, including functions for shapes, colors, and transformations; and special-purpose applications packages that are designed for non-programmers to generate displays without programming knowledge, such as painting and CAD programs.
Ad
Recently uploaded (20)
Compiler Design_Lexical Analysis phase.pptx
Compiler Design_Lexical Analysis phase.pptxRushaliDeshmukh2 The role of the lexical analyzer
Specification of tokens
Finite state machines
From a regular expressions to an NFA
Convert NFA to DFA
Transforming grammars and regular expressions
Transforming automata to grammars
Language for specifying lexical analyzers
"Boiler Feed Pump (BFP): Working, Applications, Advantages, and Limitations E...
"Boiler Feed Pump (BFP): Working, Applications, Advantages, and Limitations E...Infopitaara A Boiler Feed Pump (BFP) is a critical component in thermal power plants. It supplies high-pressure water (feedwater) to the boiler, ensuring continuous steam generation.
⚙️ How a Boiler Feed Pump Works
Water Collection:
Feedwater is collected from the deaerator or feedwater tank.
Pressurization:
The pump increases water pressure using multiple impellers/stages in centrifugal types.
Discharge to Boiler:
Pressurized water is then supplied to the boiler drum or economizer section, depending on design.
🌀 Types of Boiler Feed Pumps
Centrifugal Pumps (most common):
Multistage for higher pressure.
Used in large thermal power stations.
Positive Displacement Pumps (less common):
For smaller or specific applications.
Precise flow control but less efficient for large volumes.
🛠️ Key Operations and Controls
Recirculation Line: Protects the pump from overheating at low flow.
Throttle Valve: Regulates flow based on boiler demand.
Control System: Often automated via DCS/PLC for variable load conditions.
Sealing & Cooling Systems: Prevent leakage and maintain pump health.
⚠️ Common BFP Issues
Cavitation due to low NPSH (Net Positive Suction Head).
Seal or bearing failure.
Overheating from improper flow or recirculation.
railway wheels, descaling after reheating and before forging
railway wheels, descaling after reheating and before forgingJavad Kadkhodapour railway wheels, descaling after reheating and before forging
Artificial Intelligence (AI) basics.pptx
Artificial Intelligence (AI) basics.pptxaditichinar its all about Artificial Intelligence(Ai) and Machine Learning and not on advanced level you can study before the exam or can check for some information on Ai for project
The Gaussian Process Modeling Module in UQLab
The Gaussian Process Modeling Module in UQLabJournal of Soft Computing in Civil Engineering We introduce the Gaussian process (GP) modeling module developed within the UQLab software framework. The novel design of the GP-module aims at providing seamless integration of GP modeling into any uncertainty quantification workflow, as well as a standalone surrogate modeling tool. We first briefly present the key mathematical tools on the basis of GP modeling (a.k.a. Kriging), as well as the associated theoretical and computational framework. We then provide an extensive overview of the available features of the software and demonstrate its flexibility and user-friendliness. Finally, we showcase the usage and the performance of the software on several applications borrowed from different fields of engineering. These include a basic surrogate of a well-known analytical benchmark function; a hierarchical Kriging example applied to wind turbine aero-servo-elastic simulations and a more complex geotechnical example that requires a non-stationary, user-defined correlation function. The GP-module, like the rest of the scientific code that is shipped with UQLab, is open source (BSD license).
Value Stream Mapping Worskshops for Intelligent Continuous Security
Value Stream Mapping Worskshops for Intelligent Continuous SecurityMarc Hornbeek This presentation provides detailed guidance and tools for conducting Current State and Future State Value Stream Mapping workshops for Intelligent Continuous Security.
Introduction to FLUID MECHANICS & KINEMATICS
Introduction to FLUID MECHANICS & KINEMATICSnarayanaswamygdas Fluid mechanics is the branch of physics concerned with the mechanics of fluids (liquids, gases, and plasmas) and the forces on them. Originally applied to water (hydromechanics), it found applications in a wide range of disciplines, including mechanical, aerospace, civil, chemical, and biomedical engineering, as well as geophysics, oceanography, meteorology, astrophysics, and biology.
It can be divided into fluid statics, the study of various fluids at rest, and fluid dynamics.
Fluid statics, also known as hydrostatics, is the study of fluids at rest, specifically when there's no relative motion between fluid particles. It focuses on the conditions under which fluids are in stable equilibrium and doesn't involve fluid motion.
Fluid kinematics is the branch of fluid mechanics that focuses on describing and analyzing the motion of fluids, such as liquids and gases, without considering the forces that cause the motion. It deals with the geometrical and temporal aspects of fluid flow, including velocity and acceleration. Fluid dynamics, on the other hand, considers the forces acting on the fluid.
Fluid dynamics is the study of the effect of forces on fluid motion. It is a branch of continuum mechanics, a subject which models matter without using the information that it is made out of atoms; that is, it models matter from a macroscopic viewpoint rather than from microscopic.
Fluid mechanics, especially fluid dynamics, is an active field of research, typically mathematically complex. Many problems are partly or wholly unsolved and are best addressed by numerical methods, typically using computers. A modern discipline, called computational fluid dynamics (CFD), is devoted to this approach. Particle image velocimetry, an experimental method for visualizing and analyzing fluid flow, also takes advantage of the highly visual nature of fluid flow.
Fundamentally, every fluid mechanical system is assumed to obey the basic laws :
Conservation of mass
Conservation of energy
Conservation of momentum
The continuum assumption
For example, the assumption that mass is conserved means that for any fixed control volume (for example, a spherical volume)—enclosed by a control surface—the rate of change of the mass contained in that volume is equal to the rate at which mass is passing through the surface from outside to inside, minus the rate at which mass is passing from inside to outside. This can be expressed as an equation in integral form over the control volume.
The continuum assumption is an idealization of continuum mechanics under which fluids can be treated as continuous, even though, on a microscopic scale, they are composed of molecules. Under the continuum assumption, macroscopic (observed/measurable) properties such as density, pressure, temperature, and bulk velocity are taken to be well-defined at "infinitesimal" volume elements—small in comparison to the characteristic length scale of the system, but large in comparison to molecular length scale
Development of MLR, ANN and ANFIS Models for Estimation of PCUs at Different ...
Development of MLR, ANN and ANFIS Models for Estimation of PCUs at Different ...Journal of Soft Computing in Civil Engineering Passenger car unit (PCU) of a vehicle type depends on vehicular characteristics, stream characteristics, roadway characteristics, environmental factors, climate conditions and control conditions. Keeping in view various factors affecting PCU, a model was developed taking a volume to capacity ratio and percentage share of particular vehicle type as independent parameters. A microscopic traffic simulation model VISSIM has been used in present study for generating traffic flow data which some time very difficult to obtain from field survey. A comparison study was carried out with the purpose of verifying when the adaptive neuro-fuzzy inference system (ANFIS), artificial neural network (ANN) and multiple linear regression (MLR) models are appropriate for prediction of PCUs of different vehicle types. From the results observed that ANFIS model estimates were closer to the corresponding simulated PCU values compared to MLR and ANN models. It is concluded that the ANFIS model showed greater potential in predicting PCUs from v/c ratio and proportional share for all type of vehicles whereas MLR and ANN models did not perform well.
Degree_of_Automation.pdf for Instrumentation and industrial specialist
Degree_of_Automation.pdf for Instrumentation and industrial specialistshreyabhosale19 degree of Automation for industrial and Instrumentation learners.
Level 1-Safety.pptx Presentation of Electrical Safety
Level 1-Safety.pptx Presentation of Electrical SafetyJoseAlbertoCariasDel Level 1-Safety.pptx Presentation of Electrical Safety
Process Parameter Optimization for Minimizing Springback in Cold Drawing Proc...
Process Parameter Optimization for Minimizing Springback in Cold Drawing Proc...Journal of Soft Computing in Civil Engineering In tube drawing process, a tube is pulled out through a die and a plug to reduce its diameter and thickness as per the requirement. Dimensional accuracy of cold drawn tubes plays a vital role in the further quality of end products and controlling rejection in manufacturing processes of these end products. Springback phenomenon is the elastic strain recovery after removal of forming loads, causes geometrical inaccuracies in drawn tubes. Further, this leads to difficulty in achieving close dimensional tolerances. In the present work springback of EN 8 D tube material is studied for various cold drawing parameters. The process parameters in this work include die semi-angle, land width and drawing speed. The experimentation is done using Taguchi’s L36 orthogonal array, and then optimization is done in data analysis software Minitab 17. The results of ANOVA shows that 15 degrees die semi-angle,5 mm land width and 6 m/min drawing speed yields least springback. Furthermore, optimization algorithms named Particle Swarm Optimization (PSO), Simulated Annealing (SA) and Genetic Algorithm (GA) are applied which shows that 15 degrees die semi-angle, 10 mm land width and 8 m/min drawing speed results in minimal springback with almost 10.5 % improvement. Finally, the results of experimentation are validated with Finite Element Analysis technique using ANSYS.
theory-slides-for react for beginners.pptx
theory-slides-for react for beginners.pptxsanchezvanessa7896 Everything you need to know about react.
Development of MLR, ANN and ANFIS Models for Estimation of PCUs at Different ...
Development of MLR, ANN and ANFIS Models for Estimation of PCUs at Different ...Journal of Soft Computing in Civil Engineering
Process Parameter Optimization for Minimizing Springback in Cold Drawing Proc...
Process Parameter Optimization for Minimizing Springback in Cold Drawing Proc...Journal of Soft Computing in Civil Engineering
Window to viewport transformation&matrix representation of homogeneous coordinates
- 1. Window to viewport Transformation & Matrix Representation of Homogeneous Coordinates
- 2. What is window? • A world-coordinate area selected for display is called a window. • You can define the window to be larger than, the same size as, or smaller than the actual range of data values, depending on whether you want to show all of the data or only part of the data. • Window defines what is to be viewed. What is viewport? • An area on a display device to which a window Is mapped is called a viewport. • The rectangular portion of the interface window that defines where the image will actually appear. • Viewport defines where the window to be displayed.
- 3. If we are changing the position of window by keeping the viewport location constant, then the different part of the object is displayed at the same position on the display device. If we change the location of viewport then we will see the same part of the object drawn at different places on screen.
- 4. Window-to-Viewport Transformation • Window-to-Viewport transformation is the process of mapping or transforming a two-dimensional, world- coordinate scene to device coordinates. • In particular, objects inside the world or clipping window are mapped to the viewport. • The clipping window is used to select the part of the scene that is to be displayed. The viewport then positions the scene on the output device.
- 6. Steps for Window to Viewport Transformation • Step 1: Translate window towards origin. To shift window towards origin, translation factor will become negative (-tx,-ty). • Step 2: Resize window to the size of view port. • Step 3: Translate window (position of window must be same as position of view port).
- 12. Homogeneous Coordinates • Being homogeneous means a uniform representation of rotation, translation, scaling and other transformations. • Homogeneous coordinates are widely used in computer graphics because they enable effective, simple manipulations of transformations in a specific way.
- 13. Why Homogeneous? • We have to use 3×3 transformation matrix instead of 2×2 transformation matrix. To convert a 2×2 matrix to 3×3 matrix, we have to add an extra dummy coordinate W. • In this way, we can represent the point by 3 numbers instead of 2 numbers, which is called Homogenous Coordinate system. • In this system, we can represent all the transformation equations in matrix multiplication. Any Cartesian point P(X, Y) can be converted to homogenous coordinates by P’ (Xh, Yh, h).