2D Rotation- Transformation in Computer Graphics
•
2 likes•911 views
This document discusses 2D rotation in computer graphics. It provides the rotation equations to calculate new x- and y-coordinates when an object is rotated by an angle θ. As an example, it solves the problem of rotating a triangle with vertices at (0,0), (1,0), and (1,1) by 90 degrees counterclockwise. The new coordinates of the rotated triangle are found to be (0,0), (0,1), and (-1,1).
Report
Share
Report
Share
Download to read offline
Recommended
2D Transformations(Computer Graphics)
This document is a project report by Aditi Patni on 2-D transformations for her Bachelor's degree. It defines 2-D transformations as changes in orientation, shape, size or position of an object that alter its coordinate values. There are two types of 2-D transformations: basic transformations of translation, rotation, and scaling; and derived transformations of reflection and shearing. The report provides detailed explanations and examples of how to perform each of these transformations using matrix representations.
2 d geometric transformations
1) 2-D geometric transformations allow manipulation of objects in 2-D space by changing their position, size, and orientation.
2) The basic geometric transformations are translation, rotation, scaling, reflection, and shear. Translation moves an object by shifting its coordinates. Rotation turns an object around a fixed point. Scaling enlarges or shrinks an object. Reflection produces a mirror image. Shear distorts an object.
3) Each transformation can be described by a matrix equation. The inverse of a transformation performs the opposite operation to return the object to its original state.
Z buffer
it is a Visible surface detection method is also known as depth buffer method. In this method detect the visible surface by using the distance of the object from the projections plane.
Window to viewport transformation
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.
Dda algorithm
This document discusses the Digital Differential Analyzer (DDA) algorithm, which is a basic line drawing algorithm used in computer graphics. The DDA algorithm uses slope-intercept form (y=mx+b) to incrementally calculate pixel positions along the line between two points. It handles cases where the slope is less than or greater than 1 by incrementing either the x or y coordinate by 1 at each step. The DDA algorithm is simple to implement but requires floating point calculations and has orientation dependency issues.
Bresenham's line drawing algorithm
Bresenham's line algorithm is an efficient method for drawing lines on a digital display. It works by calculating the next pixel coordinate along the line using integer math only. This avoids complex floating point calculations. It starts at the initial coordinate and iteratively calculates the next x,y coordinate using integer addition and comparisons until it reaches the final endpoint.
COMPUTER GRAPHICS-"Projection"
Projection is the transformation of a 3D object into a 2D plane by mapping points from the 3D object to the projection plane. There are two main types of projection: perspective projection and parallel projection. Perspective projection uses lines that converge to a single point, while parallel projection uses parallel lines. Perspective projection includes one-point, two-point, and three-point perspectives. Parallel projection includes orthographic projection, which projects lines perpendicular to the plane, and oblique projection, where lines are parallel but not perpendicular to the plane.
BRESENHAM’S LINE DRAWING ALGORITHM
Jack Bresenham developed an efficient algorithm for drawing lines on a raster display. The Bresenham's line algorithm uses only integer arithmetic to determine the next pixel to plot, allowing fast computation. It works by calculating a decision parameter to choose either the upper or lower pixel as it moves from the starting to ending point of the line. The algorithm guarantees connected lines and plots each point exactly once for accurate rendering compared to other methods.
Recommended
2D Transformations(Computer Graphics)
This document is a project report by Aditi Patni on 2-D transformations for her Bachelor's degree. It defines 2-D transformations as changes in orientation, shape, size or position of an object that alter its coordinate values. There are two types of 2-D transformations: basic transformations of translation, rotation, and scaling; and derived transformations of reflection and shearing. The report provides detailed explanations and examples of how to perform each of these transformations using matrix representations.
2 d geometric transformations
1) 2-D geometric transformations allow manipulation of objects in 2-D space by changing their position, size, and orientation.
2) The basic geometric transformations are translation, rotation, scaling, reflection, and shear. Translation moves an object by shifting its coordinates. Rotation turns an object around a fixed point. Scaling enlarges or shrinks an object. Reflection produces a mirror image. Shear distorts an object.
3) Each transformation can be described by a matrix equation. The inverse of a transformation performs the opposite operation to return the object to its original state.
Z buffer
it is a Visible surface detection method is also known as depth buffer method. In this method detect the visible surface by using the distance of the object from the projections plane.
Window to viewport transformation
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.
Dda algorithm
This document discusses the Digital Differential Analyzer (DDA) algorithm, which is a basic line drawing algorithm used in computer graphics. The DDA algorithm uses slope-intercept form (y=mx+b) to incrementally calculate pixel positions along the line between two points. It handles cases where the slope is less than or greater than 1 by incrementing either the x or y coordinate by 1 at each step. The DDA algorithm is simple to implement but requires floating point calculations and has orientation dependency issues.
Bresenham's line drawing algorithm
Bresenham's line algorithm is an efficient method for drawing lines on a digital display. It works by calculating the next pixel coordinate along the line using integer math only. This avoids complex floating point calculations. It starts at the initial coordinate and iteratively calculates the next x,y coordinate using integer addition and comparisons until it reaches the final endpoint.
COMPUTER GRAPHICS-"Projection"
Projection is the transformation of a 3D object into a 2D plane by mapping points from the 3D object to the projection plane. There are two main types of projection: perspective projection and parallel projection. Perspective projection uses lines that converge to a single point, while parallel projection uses parallel lines. Perspective projection includes one-point, two-point, and three-point perspectives. Parallel projection includes orthographic projection, which projects lines perpendicular to the plane, and oblique projection, where lines are parallel but not perpendicular to the plane.
BRESENHAM’S LINE DRAWING ALGORITHM
Jack Bresenham developed an efficient algorithm for drawing lines on a raster display. The Bresenham's line algorithm uses only integer arithmetic to determine the next pixel to plot, allowing fast computation. It works by calculating a decision parameter to choose either the upper or lower pixel as it moves from the starting to ending point of the line. The algorithm guarantees connected lines and plots each point exactly once for accurate rendering compared to other methods.
Agent architectures
This document provides an overview of different agent architectures, including reactive, deliberative, and hybrid architectures. It discusses key concepts like the types of environments agents can operate in, including accessible vs inaccessible, deterministic vs non-deterministic, episodic vs non-episodic, and static vs dynamic environments. Reactive architectures are focused on fast reactions to environmental changes with minimal internal representation and computation. Deliberative architectures emphasize long-term planning and goal-driven behavior using symbolic representations. Rodney Brooks proposed that intelligence can emerge from the interaction of simple agents following stimulus-response rules, without complex internal models, as seen in ant colonies.
3D transformation in computer graphics
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.
3D Graphics : Computer Graphics Fundamentals
Comprehensive coverage of fundamentals of computer graphics.
3D Transformations
Reflections
3D Display methods
3D Object Representation
Polygon surfaces
Quadratic Surfaces
2D Transformation
it is related to Computer Graphics Subject.in this ppt we describe what is 2D Transformation, Translation, Rotation, Scaling : Uniform Scaling,Non-uniform Scaling ;Reflection,Shear,Composite Transformations
2d-transformation
Transformation, Translation:Moving the Grid, Rotation, Scaling, Reflection, Shear, X Shear , Y shear
Scaling and shearing
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.
Computer Graphic - Transformations in 2D
The document discusses 2D geometric transformations using matrices. It defines a general transformation equation [B] = [T] [A] where [T] is the transformation matrix and [A] and [B] are the input and output point matrices. It then explains various transformation matrices for scaling, reflection, rotation and translation. It also discusses representing transformations in homogeneous coordinates using 3x3 matrices. Finally, it provides examples of applying multiple transformations and conditions when the order of transformations can be changed.
2D Plot Matlab
How to 2D plots in Matlab. Easy steps to graph mathematical functions.
You have to define your interval of interest and consider a step in your independent vector, then you have to define your function and use an appropriate 2D built-in function.
More information and examples:
http://matrixlab-examples.com/matlab-plot-2tier.html
Advanced Computer Architecture chapter 5 problem solutions
The document discusses cache memory organization and mapping schemes between main memory and cache memory. It provides examples of direct mapping, fully associative mapping, 2-way set associative mapping, and 4-block sector mapping. It also calculates the effective memory access time for a memory hierarchy with a 16KB cache and 1MB main memory, assuming an 8-word block size and 256-word set size with 32-way set associative mapping and a 95% cache hit ratio.
Moore and mealy machine
Mealy and Moore machines are types of finite state machines. A Mealy machine's output depends on its present state and input, while a Moore machine's output depends only on its present state. Mealy machines can be converted to Moore machines by breaking states with multiple outputs into multiple states, and vice versa by combining states with the same output. Both machine types have advantages and uses, with Mealy machines being faster but more expensive, and Moore machines being simpler but slower.
Circle generation algorithm
The document describes the Breshenham's circle generation algorithm. It explains that the algorithm uses a decision parameter to iteratively select pixels along the circumference of a circle. It provides pseudocode for the algorithm, which initializes x and y values, calculates a decision parameter, and increments x while decrementing y at each step, plotting points based on the decision parameter. An example of applying the algorithm to generate a circle with radius 5 is also provided.
B. SC CSIT Computer Graphics Unit 2 By Tekendra Nath Yogi
The document discusses various 2D and 3D geometric transformations including translation, rotation, scaling, and their implementations using matrix representations and homogeneous coordinates. It provides examples of translating, rotating, and scaling points and polygons. It also covers composite transformations, inverse transformations, and applications to 2D and 3D viewing. Homework examples are provided to practice applying the different transformation types.
Viewing transformation
The document discusses viewport transformations which map objects from one coordinate system to another, such as mapping from world coordinates to screen coordinates. It explains that viewport transformations are used for viewing transformations like zooming and moving drawings. The document also describes how a matrix M can be determined to map a window defined in world coordinates to a viewport defined in screen pixel coordinates.
Gaussian Elimination Method
Gaussian elimination is a method for solving systems of linear equations. It involves converting the augmented matrix into an upper triangular matrix using elementary row operations. There are three types of Gaussian elimination: simple elimination without pivoting, partial pivoting, and total pivoting. Partial pivoting interchanges rows to choose larger pivots, while total pivoting searches the whole matrix for the largest number to use as the pivot. Pivoting strategies help prevent zero pivots and reduce round-off errors.
2D Transformation in Computer Graphics
2D transformations are important operations in computer graphics that allow modifying the position, size, and orientation of objects in a 2D plane. There are several types of 2D transformations including translation, rotation, scaling, and more. Transformations are represented using matrix math for efficient application of sequential transformations. Key techniques include homogeneous coordinates to allow different types of transformations to be combined into a single matrix operation.
Goal stack planning.ppt
The document describes the basic planning problem and representations used in early planning systems like STRIPS. The planning problem involves finding a sequence of actions or operators that will achieve a given goal state when starting from an initial state. STRIPS uses a state list to represent the current state and a goal stack to manage the planning search. It pops goals and subgoals off the stack and tries to achieve them by applying operators, updating the state list and solution plan along the way. Operators have preconditions that must be true for application and add and delete lists that modify the state.
3D Transformation in Computer Graphics
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
Depth Buffer Method
The depth buffer method is used to determine visibility in 3D graphics by testing the depth (z-coordinate) of each surface to determine the closest visible surface. It involves using two buffers - a depth buffer to store the depth values and a frame buffer to store color values. For each pixel, the depth value is calculated and compared to the existing value in the depth buffer, and if closer the color and depth values are updated in the respective buffers. This method is implemented efficiently in hardware and processes surfaces one at a time in any order.
Midpoint circle algo
The midpoint circle algorithm is similar to Bresenham's circle algorithm and uses the midpoint between pixels to determine whether the pixel is inside or outside a circle. It defines a decision parameter pi based on the midpoint and updates pi by integer amounts at each step to determine the next pixel along the circle. The initial value of pi is set to 5/4 - r when r is an integer to determine the first pixel.
DDA algorithm
This document describes the digital differential analyzer (DDA) algorithm for rasterizing lines, triangles, and polygons in computer graphics. It discusses implementing DDA using floating-point or integer arithmetic. The DDA line drawing algorithm works by incrementing either the x or y coordinate by 1 each step depending on whether the slope is less than or greater than 1. Pseudocode is provided to illustrate the algorithm. Potential drawbacks of DDA are also mentioned, such as the expense of rounding operations.
transformation IT.ppt
Geometric transformations play an important role in computer graphics by allowing graphics to be repositioned on the screen or changed in size and orientation. There are several types of 2D transformations including translation, rotation, scaling, reflection, and shearing. Translation moves an object by translating each vertex by a certain distance. Rotation moves a point around a center point by a certain angle. Scaling enlarges or shrinks an object by a scaling factor. Reflection produces a mirror image of an object across an axis. Shearing distorts an object by shifting coordinate values.
2D Transformation
2D transformations are used in computer graphics to modify and reposition graphics. The key 2D transformation techniques are translation, rotation, scaling, reflection, and shearing. Translation moves an object by adding offsets to its coordinates. Rotation modifies an object's position by applying rotational matrices. Scaling enlarges or shrinks an object by multiplying its coordinates. Reflection mirrors an object across an axis by inverting one coordinate. Shearing skews an object by adding its coordinates. Homogeneous coordinates allow representing transformations using matrix multiplications.
More Related Content
What's hot
Agent architectures
This document provides an overview of different agent architectures, including reactive, deliberative, and hybrid architectures. It discusses key concepts like the types of environments agents can operate in, including accessible vs inaccessible, deterministic vs non-deterministic, episodic vs non-episodic, and static vs dynamic environments. Reactive architectures are focused on fast reactions to environmental changes with minimal internal representation and computation. Deliberative architectures emphasize long-term planning and goal-driven behavior using symbolic representations. Rodney Brooks proposed that intelligence can emerge from the interaction of simple agents following stimulus-response rules, without complex internal models, as seen in ant colonies.
3D transformation in computer graphics
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.
3D Graphics : Computer Graphics Fundamentals
Comprehensive coverage of fundamentals of computer graphics.
3D Transformations
Reflections
3D Display methods
3D Object Representation
Polygon surfaces
Quadratic Surfaces
2D Transformation
it is related to Computer Graphics Subject.in this ppt we describe what is 2D Transformation, Translation, Rotation, Scaling : Uniform Scaling,Non-uniform Scaling ;Reflection,Shear,Composite Transformations
2d-transformation
Transformation, Translation:Moving the Grid, Rotation, Scaling, Reflection, Shear, X Shear , Y shear
Scaling and shearing
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.
Computer Graphic - Transformations in 2D
The document discusses 2D geometric transformations using matrices. It defines a general transformation equation [B] = [T] [A] where [T] is the transformation matrix and [A] and [B] are the input and output point matrices. It then explains various transformation matrices for scaling, reflection, rotation and translation. It also discusses representing transformations in homogeneous coordinates using 3x3 matrices. Finally, it provides examples of applying multiple transformations and conditions when the order of transformations can be changed.
2D Plot Matlab
How to 2D plots in Matlab. Easy steps to graph mathematical functions.
You have to define your interval of interest and consider a step in your independent vector, then you have to define your function and use an appropriate 2D built-in function.
More information and examples:
http://matrixlab-examples.com/matlab-plot-2tier.html
Advanced Computer Architecture chapter 5 problem solutions
The document discusses cache memory organization and mapping schemes between main memory and cache memory. It provides examples of direct mapping, fully associative mapping, 2-way set associative mapping, and 4-block sector mapping. It also calculates the effective memory access time for a memory hierarchy with a 16KB cache and 1MB main memory, assuming an 8-word block size and 256-word set size with 32-way set associative mapping and a 95% cache hit ratio.
Moore and mealy machine
Mealy and Moore machines are types of finite state machines. A Mealy machine's output depends on its present state and input, while a Moore machine's output depends only on its present state. Mealy machines can be converted to Moore machines by breaking states with multiple outputs into multiple states, and vice versa by combining states with the same output. Both machine types have advantages and uses, with Mealy machines being faster but more expensive, and Moore machines being simpler but slower.
Circle generation algorithm
The document describes the Breshenham's circle generation algorithm. It explains that the algorithm uses a decision parameter to iteratively select pixels along the circumference of a circle. It provides pseudocode for the algorithm, which initializes x and y values, calculates a decision parameter, and increments x while decrementing y at each step, plotting points based on the decision parameter. An example of applying the algorithm to generate a circle with radius 5 is also provided.
B. SC CSIT Computer Graphics Unit 2 By Tekendra Nath Yogi
The document discusses various 2D and 3D geometric transformations including translation, rotation, scaling, and their implementations using matrix representations and homogeneous coordinates. It provides examples of translating, rotating, and scaling points and polygons. It also covers composite transformations, inverse transformations, and applications to 2D and 3D viewing. Homework examples are provided to practice applying the different transformation types.
Viewing transformation
The document discusses viewport transformations which map objects from one coordinate system to another, such as mapping from world coordinates to screen coordinates. It explains that viewport transformations are used for viewing transformations like zooming and moving drawings. The document also describes how a matrix M can be determined to map a window defined in world coordinates to a viewport defined in screen pixel coordinates.
Gaussian Elimination Method
Gaussian elimination is a method for solving systems of linear equations. It involves converting the augmented matrix into an upper triangular matrix using elementary row operations. There are three types of Gaussian elimination: simple elimination without pivoting, partial pivoting, and total pivoting. Partial pivoting interchanges rows to choose larger pivots, while total pivoting searches the whole matrix for the largest number to use as the pivot. Pivoting strategies help prevent zero pivots and reduce round-off errors.
2D Transformation in Computer Graphics
2D transformations are important operations in computer graphics that allow modifying the position, size, and orientation of objects in a 2D plane. There are several types of 2D transformations including translation, rotation, scaling, and more. Transformations are represented using matrix math for efficient application of sequential transformations. Key techniques include homogeneous coordinates to allow different types of transformations to be combined into a single matrix operation.
Goal stack planning.ppt
The document describes the basic planning problem and representations used in early planning systems like STRIPS. The planning problem involves finding a sequence of actions or operators that will achieve a given goal state when starting from an initial state. STRIPS uses a state list to represent the current state and a goal stack to manage the planning search. It pops goals and subgoals off the stack and tries to achieve them by applying operators, updating the state list and solution plan along the way. Operators have preconditions that must be true for application and add and delete lists that modify the state.
3D Transformation in Computer Graphics
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
Depth Buffer Method
The depth buffer method is used to determine visibility in 3D graphics by testing the depth (z-coordinate) of each surface to determine the closest visible surface. It involves using two buffers - a depth buffer to store the depth values and a frame buffer to store color values. For each pixel, the depth value is calculated and compared to the existing value in the depth buffer, and if closer the color and depth values are updated in the respective buffers. This method is implemented efficiently in hardware and processes surfaces one at a time in any order.
Midpoint circle algo
The midpoint circle algorithm is similar to Bresenham's circle algorithm and uses the midpoint between pixels to determine whether the pixel is inside or outside a circle. It defines a decision parameter pi based on the midpoint and updates pi by integer amounts at each step to determine the next pixel along the circle. The initial value of pi is set to 5/4 - r when r is an integer to determine the first pixel.
DDA algorithm
This document describes the digital differential analyzer (DDA) algorithm for rasterizing lines, triangles, and polygons in computer graphics. It discusses implementing DDA using floating-point or integer arithmetic. The DDA line drawing algorithm works by incrementing either the x or y coordinate by 1 each step depending on whether the slope is less than or greater than 1. Pseudocode is provided to illustrate the algorithm. Potential drawbacks of DDA are also mentioned, such as the expense of rounding operations.
What's hot (20)
Advanced Computer Architecture chapter 5 problem solutions
Advanced Computer Architecture chapter 5 problem solutions
B. SC CSIT Computer Graphics Unit 2 By Tekendra Nath Yogi
B. SC CSIT Computer Graphics Unit 2 By Tekendra Nath Yogi
Similar to 2D Rotation- Transformation in Computer Graphics
transformation IT.ppt
Geometric transformations play an important role in computer graphics by allowing graphics to be repositioned on the screen or changed in size and orientation. There are several types of 2D transformations including translation, rotation, scaling, reflection, and shearing. Translation moves an object by translating each vertex by a certain distance. Rotation moves a point around a center point by a certain angle. Scaling enlarges or shrinks an object by a scaling factor. Reflection produces a mirror image of an object across an axis. Shearing distorts an object by shifting coordinate values.
2D Transformation
2D transformations are used in computer graphics to modify and reposition graphics. The key 2D transformation techniques are translation, rotation, scaling, reflection, and shearing. Translation moves an object by adding offsets to its coordinates. Rotation modifies an object's position by applying rotational matrices. Scaling enlarges or shrinks an object by multiplying its coordinates. Reflection mirrors an object across an axis by inverting one coordinate. Shearing skews an object by adding its coordinates. Homogeneous coordinates allow representing transformations using matrix multiplications.
3D computer Graphic PPT.pptx in computer graphics
Three dimensional transformations include translations, scaling, rotations, and reflections. Translations move an object through addition of translation vectors in the x, y, and z directions. Scaling changes the size of an object using scaling factors for the x, y, and z axes. Rotations turn an object around an axis by some angle, requiring both an axis of rotation and angle of rotation. Reflections produce a mirror image of an object across a plane. Shearing can distort an object by changing its shape along an axis. These transformations are represented by matrices to manipulate 3D coordinate points.
Computer Graphics - transformations in 2d
The document discusses 2D geometric transformations using matrices. It defines a general transformation equation [B] = [T] [A] where [T] is the transformation matrix and [A] and [B] are the input and output point matrices. It then explains various types of 2D transformations like scaling, reflection, rotation and translations as well as their corresponding matrix representations. It also discusses representing transformations in homogeneous coordinates and the concept of screen and world coordinates in the context of mapping between them.
Geometry unit 9.3
This document provides examples and explanations for identifying and drawing rotations of figures. It defines a rotation as a transformation that turns a figure around a fixed point, called the center of rotation. Examples demonstrate how to determine if a transformation is a rotation based on how a figure appears to move. Additional examples show how to draw rotations by constructing segments from vertices to the center of rotation and using angles and distances to locate the image vertices. The document also provides an example of rotating a figure in the coordinate plane and using trigonometric ratios to find the coordinates of the rotated image.
3D Transformation in Computer Graphics
3D transformations in computer graphics include translation, scaling, and rotation of 3D objects. Translation moves an object by adding translation offsets to the x, y, and z coordinates. Scaling enlarges or shrinks an object by multiplying the coordinates by scaling factors. Rotation rotates an object by applying rotation matrices to change the orientation. Reflection mirrors an object across planes by flipping the sign of coordinates on one axis. These transformations are used to manipulate 3D objects in computer graphics and animation.
Computer Graphic - Transformations in 3d
1. The document describes the steps to perform a rotation of an object in 3D space about an arbitrary point or axis.
2. It provides an example of rotating a unit cube 90 degrees about an axis defined by two points and calculating the new coordinates.
3. It also gives an example of rotating the point (1,2,1) 90 degrees and showing the resulting point (1,2,3) transformed to (4,6,7).
Computer Graphics - transformations in 3d
1. The document describes the process of rotating objects in 3D space, including translating to the origin, rotating around axes, and translating back.
2. It provides an example of rotating a unit cube 90 degrees around an axis and calculating the new coordinates.
3. The document also gives an example of rotating the point (1,2,1) 90 degrees and showing the step-by-step calculation.
2-D Transformations.pdf
This document discusses 2D transformations including translation, rotation, scaling, shearing, and reflection. It explains how to represent points in 2D using vectors and matrices. Various transformation matrices are defined to transform points and geometries through translation, rotation about a pivot point, uniform and non-uniform scaling, reflection across lines or planes, and shearing. Composite transformations consisting of multiple simple transformations applied sequentially are also discussed. Examples are provided to demonstrate how common geometries like lines and polygons are transformed.
2d transformations
1. 2D transformations include translation, rotation, scaling, and shearing. They can change an object's position, size, orientation, and shape.
2. Transformations are represented by matrices and applied through matrix multiplication. A sequence of transformations can be combined into a single matrix by multiplying the matrices.
3. Common 2D transformations include translating an object by adding offsets to x and y, rotating objects around an origin by adjusting x and y coordinates, and scaling by multiplying x and y by factors.
2 d transformation
1) 2D geometric transformations include translations, scaling, and rotations. They can be represented by transformation matrices.
2) Translation moves an object by adding offsets to x and y coordinates. It can be represented by a 3x3 matrix with 1s on the diagonal and offsets as the last column.
3) Scaling enlarges or shrinks an object by multiplying x and y coordinates by scaling factors. It can be represented by a 2x2 diagonal matrix with scaling factors.
4) Rotation rotates an object by applying a trigonometric transformation to x and y coordinates. It can be represented by a 2x2 rotation matrix containing cosine and sine of the rotation angle.
Trigonometric ratios and identities 1
This document discusses trigonometric ratios and identities. It begins by defining angles, their measurement in different systems including degrees, radians and grades. It then defines trigonometric functions including sine, cosine, tangent etc and discusses their domains, ranges and signs in different quadrants. The document also covers trigonometric identities, ratios of compound angles and periodicity of trig functions.
presentation on 2D geometrical transformation
This document discusses two-dimensional geometry transformations using shear. It defines shear as a transformation that distorts the shape of an object. There are two types of shear transformations: X shear, which preserves Y coordinates but changes X coordinates, and Y shear, which preserves X coordinates but changes Y coordinates. The document provides an example of applying both X and Y shear to transform the coordinates of a rectangle.
mid point algorithm.pdf
The document describes the mid-point circle algorithm for drawing circles. It uses eight-way symmetry to only calculate points for one octant of the circle, then uses symmetry to get the remaining points. At each x-coordinate, it must choose between two possible y-coordinates by calculating the mid-point between them and determining which side of the circle it falls on based on comparing the mid-point to the circle equation. It iterates this process, incrementally updating values for efficiency, until all points along the top-right octant are drawn, then uses symmetry to plot the full circle.
Geometry Transformation
The document summarizes different types of geometry transformations:
1. Translations move every point on a shape by a distance and direction without changing the shape.
2. Reflections produce mirror images of shapes across lines or axes.
3. Rotations turn shapes around a fixed point by a certain angle.
4. Dilations enlarge or reduce the size of shapes around a fixed point but do not alter their form.
Composing multiple transformations means applying one transformation to the output of another. Matrix representations can describe the combined effect of transformations.
Transforms UNIt 2
This document discusses various 2D transformations including translation, rotation, scaling, shearing, and their implementations using transformation matrices. Translation moves an object along a straight line and can be represented by a 3x3 matrix. Rotation rotates an object around a center point, with the standard rotation matrix rotating around the origin. Scaling changes the size of an object, which can cause undesirable movement. Shearing skews an object along an axis. The document also covers composing multiple transformations using matrix multiplication and how OpenGL applies transformations through a global model-view matrix.
Ellipses drawing algo.
(1) An ellipse is defined by the equation (x-h)2/a2 + (y-k)2/b2 = 1, where (h,k) is the center and a and b are the lengths of the major and minor axes.
(2) There are two methods to scan convert an ellipse - the polynomial method and trigonometric method.
(3) The midpoint ellipse algorithm uses a decision parameter p to recursively scan convert the ellipse pixel by pixel in a manner similar to the midpoint circle algorithm.
Three dimensional transformations
3D transformations are represented by 4x4 matrices. They include translation, scaling, and rotation. Rotation can be about coordinate axes or arbitrary axes. For arbitrary axis rotation, the process involves translating the axis to the origin, rotating the axis to align with an axis, rotating about that axis, then applying the inverse transformations to return the axis to its original orientation.
29 Solution Tutorial 6 Group no.11-20.pptx
The interaction between moving surfaces is a concept which is at the heart
of innumerable phenomena in the nature. Whether in the joints of a human
skeleton, in rolling elements of a jet turbine, or in crucial components on a
space station, no natural events nor human-designed devices are exempt from
the action of friction and wear. The intrinsic multidisciplinary character of
these two physical phenomena aroused the interest of mankind since the ancient times and particularly regained great attention in Renaissance with the
pioneering studies of Leonardo and subsequently during the industrial revolution [1, 2]. Nonetheless, the definition of the concept of tribology in terms of
scientific discipline and economical implications originated first in the second
half of the twentieth century thanks to the work of Jost [3]. By means of a
careful analysis of the state of lubrication research in different industrialized
countries, the Jost Report and many following independent studies estimated
a potential annual saving ranging from 1% to 1.4% of a country’s GDP [4–6].
Furthermore, such saving is deemed to be achievable with a very convenient
return on investment ratio of 1/50, implying a saving of 50 $ for each dollar
spent in research and development in the previous year [4, 7]. Particular emphasis is laid on the role of tribological progress in transportation, industrial
and utilities sectors, where it has been estimated that up to 11% of the used
energy can be saved by the application of the new developments in tribology
1
1 Introduction
[8, 9]. In view of such relevant potential impact, the advance in the field of
tribology is nowadays of utmost importance to address the economical and
environmental challenge and also to cast light on a plenty of phenomena in
nature which characterize our everyday life.
In the last decades, the research on tribology has spread in numerous branches,
ranging over multidisciplinary areas such as lubricants development [10, 11]
surface coating [12, 13], or the optimization of automotive and industrial applications [14, 15]. Among these research fields, the enhancement of the tribological performance through the introduction of surface textures has drawn a
considerable attention in the research community [16]. Surface texture nowadays represents an interesting technology for the reduction of friction and wear
thanks to recent advancements in the laser surface texturing techniques (LST)
which reduced the production costs and increased also the manufacturing precision [17].
However, an unanimous consensus in the research community has not been
reached yet, for what concerns the underlying physical mechanisms and the
possibility to obtain an optimal texture design which proves to be robust under different operating conditions [18]. In order to bridge this gap, a more
and more increasing part of literature combines experimental and numerical
works [16]. Among them, the present work represents the numerical counter.
Trigonometry Functions
This document provides an overview of trigonometric functions. It covers angles and their measurement in degrees and radians. It then discusses right triangle trigonometry, defining the six trigonometric functions and properties like fundamental identities. Special angle values are computed for 30, 45, and 60 degrees. Trig functions of general angles and the unit circle approach are introduced. Graphs of sine, cosine, tangent, cotangent, cosecant and secant functions are examined.
Similar to 2D Rotation- Transformation in Computer Graphics (20)
Recently uploaded
Null Bangalore | Pentesters Approach to AWS IAM
#Abstract:
- Learn more about the real-world methods for auditing AWS IAM (Identity and Access Management) as a pentester. So let us proceed with a brief discussion of IAM as well as some typical misconfigurations and their potential exploits in order to reinforce the understanding of IAM security best practices.
- Gain actionable insights into AWS IAM policies and roles, using hands on approach.
#Prerequisites:
- Basic understanding of AWS services and architecture
- Familiarity with cloud security concepts
- Experience using the AWS Management Console or AWS CLI.
- For hands on lab create account on [killercoda.com](https://killercoda.com/cloudsecurity-scenario/)
# Scenario Covered:
- Basics of IAM in AWS
- Implementing IAM Policies with Least Privilege to Manage S3 Bucket
- Objective: Create an S3 bucket with least privilege IAM policy and validate access.
- Steps:
- Create S3 bucket.
- Attach least privilege policy to IAM user.
- Validate access.
- Exploiting IAM PassRole Misconfiguration
-Allows a user to pass a specific IAM role to an AWS service (ec2), typically used for service access delegation. Then exploit PassRole Misconfiguration granting unauthorized access to sensitive resources.
- Objective: Demonstrate how a PassRole misconfiguration can grant unauthorized access.
- Steps:
- Allow user to pass IAM role to EC2.
- Exploit misconfiguration for unauthorized access.
- Access sensitive resources.
- Exploiting IAM AssumeRole Misconfiguration with Overly Permissive Role
- An overly permissive IAM role configuration can lead to privilege escalation by creating a role with administrative privileges and allow a user to assume this role.
- Objective: Show how overly permissive IAM roles can lead to privilege escalation.
- Steps:
- Create role with administrative privileges.
- Allow user to assume the role.
- Perform administrative actions.
- Differentiation between PassRole vs AssumeRole
Try at [killercoda.com](https://killercoda.com/cloudsecurity-scenario/)
Computational Engineering IITH Presentation
This Presentation will give you a brief idea about what Computational Engineering at IIT Hyderabad has to offer.
哪里办理(csu毕业证书)查尔斯特大学毕业证硕士学历原版一模一样
原版一模一样【微信：741003700 】【(csu毕业证书)查尔斯特大学毕业证硕士学历】【微信：741003700 】学位证，留信认证（真实可查，永久存档）offer、雅思、外壳等材料/诚信可靠,可直接看成品样本，帮您解决无法毕业带来的各种难题！外壳，原版制作，诚信可靠，可直接看成品样本。行业标杆！精益求精，诚心合作，真诚制作！多年品质 ,按需精细制作，24小时接单,全套进口原装设备。十五年致力于帮助留学生解决难题，包您满意。
本公司拥有海外各大学样板无数，能完美还原海外各大学 Bachelor Diploma degree, Master Degree Diploma
1:1完美还原海外各大学毕业材料上的工艺：水印，阴影底纹，钢印LOGO烫金烫银，LOGO烫金烫银复合重叠。文字图案浮雕、激光镭射、紫外荧光、温感、复印防伪等防伪工艺。材料咨询办理、认证咨询办理请加学历顾问Q/微741003700
留信网认证的作用:
1:该专业认证可证明留学生真实身份
2:同时对留学生所学专业登记给予评定
3:国家专业人才认证中心颁发入库证书
4:这个认证书并且可以归档倒地方
5:凡事获得留信网入网的信息将会逐步更新到个人身份内，将在公安局网内查询个人身份证信息后，同步读取人才网入库信息
6:个人职称评审加20分
7:个人信誉贷款加10分
8:在国家人才网主办的国家网络招聘大会中纳入资料，供国家高端企业选择人才
原版制作(Humboldt毕业证书)柏林大学毕业证学位证一模一样
原件一模一样【微信：bwp0011】《(Humboldt毕业证书)柏林大学毕业证学位证》【微信：bwp0011】学位证，留信认证（真实可查，永久存档）原件一模一样纸张工艺/offer、雅思、外壳等材料/诚信可靠,可直接看成品样本，帮您解决无法毕业带来的各种难题！外壳，原版制作，诚信可靠，可直接看成品样本。行业标杆！精益求精，诚心合作，真诚制作！多年品质 ,按需精细制作，24小时接单,全套进口原装设备。十五年致力于帮助留学生解决难题，包您满意。
本公司拥有海外各大学样板无数，能完美还原。
1:1完美还原海外各大学毕业材料上的工艺：水印，阴影底纹，钢印LOGO烫金烫银，LOGO烫金烫银复合重叠。文字图案浮雕、激光镭射、紫外荧光、温感、复印防伪等防伪工艺。材料咨询办理、认证咨询办理请加学历顾问微bwp0011
【主营项目】
一.毕业证【微bwp0011】成绩单、使馆认证、教育部认证、雅思托福成绩单、学生卡等！
二.真实使馆公证(即留学回国人员证明,不成功不收费)
三.真实教育部学历学位认证（教育部存档！教育部留服网站永久可查）
四.办理各国各大学文凭(一对一专业服务,可全程监控跟踪进度)
如果您处于以下几种情况：
◇在校期间，因各种原因未能顺利毕业……拿不到官方毕业证【微bwp0011】
◇面对父母的压力，希望尽快拿到；
◇不清楚认证流程以及材料该如何准备；
◇回国时间很长，忘记办理；
◇回国马上就要找工作，办给用人单位看；
◇企事业单位必须要求办理的
◇需要报考公务员、购买免税车、落转户口
◇申请留学生创业基金
留信网认证的作用:
1:该专业认证可证明留学生真实身份
2:同时对留学生所学专业登记给予评定
3:国家专业人才认证中心颁发入库证书
4:这个认证书并且可以归档倒地方
5:凡事获得留信网入网的信息将会逐步更新到个人身份内，将在公安局网内查询个人身份证信息后，同步读取人才网入库信息
6:个人职称评审加20分
7:个人信誉贷款加10分
8:在国家人才网主办的国家网络招聘大会中纳入资料，供国家高端企业选择人才
官方认证美国密歇根州立大学毕业证学位证书原版一模一样
原版一模一样【微信：741003700 】【美国密歇根州立大学毕业证学位证书】【微信：741003700 】学位证，留信认证（真实可查，永久存档）offer、雅思、外壳等材料/诚信可靠,可直接看成品样本，帮您解决无法毕业带来的各种难题！外壳，原版制作，诚信可靠，可直接看成品样本。行业标杆！精益求精，诚心合作，真诚制作！多年品质 ,按需精细制作，24小时接单,全套进口原装设备。十五年致力于帮助留学生解决难题，包您满意。
本公司拥有海外各大学样板无数，能完美还原海外各大学 Bachelor Diploma degree, Master Degree Diploma
1:1完美还原海外各大学毕业材料上的工艺：水印，阴影底纹，钢印LOGO烫金烫银，LOGO烫金烫银复合重叠。文字图案浮雕、激光镭射、紫外荧光、温感、复印防伪等防伪工艺。材料咨询办理、认证咨询办理请加学历顾问Q/微741003700
留信网认证的作用:
1:该专业认证可证明留学生真实身份
2:同时对留学生所学专业登记给予评定
3:国家专业人才认证中心颁发入库证书
4:这个认证书并且可以归档倒地方
5:凡事获得留信网入网的信息将会逐步更新到个人身份内，将在公安局网内查询个人身份证信息后，同步读取人才网入库信息
6:个人职称评审加20分
7:个人信誉贷款加10分
8:在国家人才网主办的国家网络招聘大会中纳入资料，供国家高端企业选择人才
Redefining brain tumor segmentation: a cutting-edge convolutional neural netw...
Medical image analysis has witnessed significant advancements with deep learning techniques. In the domain of brain tumor segmentation, the ability to
precisely delineate tumor boundaries from magnetic resonance imaging (MRI)
scans holds profound implications for diagnosis. This study presents an ensemble convolutional neural network (CNN) with transfer learning, integrating
the state-of-the-art Deeplabv3+ architecture with the ResNet18 backbone. The
model is rigorously trained and evaluated, exhibiting remarkable performance
metrics, including an impressive global accuracy of 99.286%, a high-class accuracy of 82.191%, a mean intersection over union (IoU) of 79.900%, a weighted
IoU of 98.620%, and a Boundary F1 (BF) score of 83.303%. Notably, a detailed comparative analysis with existing methods showcases the superiority of
our proposed model. These findings underscore the model’s competence in precise brain tumor localization, underscoring its potential to revolutionize medical
image analysis and enhance healthcare outcomes. This research paves the way
for future exploration and optimization of advanced CNN models in medical
imaging, emphasizing addressing false positives and resource efficiency.
Data Driven Maintenance | UReason Webinar
Discover the latest insights on Data Driven Maintenance with our comprehensive webinar presentation. Learn about traditional maintenance challenges, the right approach to utilizing data, and the benefits of adopting a Data Driven Maintenance strategy. Explore real-world examples, industry best practices, and innovative solutions like FMECA and the D3M model. This presentation, led by expert Jules Oudmans, is essential for asset owners looking to optimize their maintenance processes and leverage digital technologies for improved efficiency and performance. Download now to stay ahead in the evolving maintenance landscape.
22CYT12-Unit-V-E Waste and its Management.ppt
Introduction- e - waste – definition - sources of e-waste– hazardous substances in e-waste - effects of e-waste on environment and human health- need for e-waste management– e-waste handling rules - waste minimization techniques for managing e-waste – recycling of e-waste - disposal treatment methods of e- waste – mechanism of extraction of precious metal from leaching solution-global Scenario of E-waste – E-waste in India- case studies.
Use PyCharm for remote debugging of WSL on a Windo cf5c162d672e4e58b4dde5d797...
This document serves as a comprehensive step-by-step guide on how to effectively use PyCharm for remote debugging of the Windows Subsystem for Linux (WSL) on a local Windows machine. It meticulously outlines several critical steps in the process, starting with the crucial task of enabling permissions, followed by the installation and configuration of WSL.
The guide then proceeds to explain how to set up the SSH service within the WSL environment, an integral part of the process. Alongside this, it also provides detailed instructions on how to modify the inbound rules of the Windows firewall to facilitate the process, ensuring that there are no connectivity issues that could potentially hinder the debugging process.
The document further emphasizes on the importance of checking the connection between the Windows and WSL environments, providing instructions on how to ensure that the connection is optimal and ready for remote debugging.
It also offers an in-depth guide on how to configure the WSL interpreter and files within the PyCharm environment. This is essential for ensuring that the debugging process is set up correctly and that the program can be run effectively within the WSL terminal.
Additionally, the document provides guidance on how to set up breakpoints for debugging, a fundamental aspect of the debugging process which allows the developer to stop the execution of their code at certain points and inspect their program at those stages.
Finally, the document concludes by providing a link to a reference blog. This blog offers additional information and guidance on configuring the remote Python interpreter in PyCharm, providing the reader with a well-rounded understanding of the process.
BRAIN TUMOR DETECTION for seminar ppt.pdf
BRAIN TUMOR DETECTION
AND CLASSIFICATION USING
ARTIFICIAL INTELLIGENCE
International Conference on NLP, Artificial Intelligence, Machine Learning an...
International Conference on NLP, Artificial Intelligence, Machine Learning and Applications (NLAIM 2024) offers a premier global platform for exchanging insights and findings in the theory, methodology, and applications of NLP, Artificial Intelligence, Machine Learning, and their applications. The conference seeks substantial contributions across all key domains of NLP, Artificial Intelligence, Machine Learning, and their practical applications, aiming to foster both theoretical advancements and real-world implementations. With a focus on facilitating collaboration between researchers and practitioners from academia and industry, the conference serves as a nexus for sharing the latest developments in the field.
Advanced control scheme of doubly fed induction generator for wind turbine us...
This paper describes a speed control device for generating electrical energy on an electricity network based on the doubly fed induction generator (DFIG) used for wind power conversion systems. At first, a double-fed induction generator model was constructed. A control law is formulated to govern the flow of energy between the stator of a DFIG and the energy network using three types of controllers: proportional integral (PI), sliding mode controller (SMC) and second order sliding mode controller (SOSMC). Their different results in terms of power reference tracking, reaction to unexpected speed fluctuations, sensitivity to perturbations, and resilience against machine parameter alterations are compared. MATLAB/Simulink was used to conduct the simulations for the preceding study. Multiple simulations have shown very satisfying results, and the investigations demonstrate the efficacy and power-enhancing capabilities of the suggested control system.
Embedded machine learning-based road conditions and driving behavior monitoring
Car accident rates have increased in recent years, resulting in losses in human lives, properties, and other financial costs. An embedded machine learning-based system is developed to address this critical issue. The system can monitor road conditions, detect driving patterns, and identify aggressive driving behaviors. The system is based on neural networks trained on a comprehensive dataset of driving events, driving styles, and road conditions. The system effectively detects potential risks and helps mitigate the frequency and impact of accidents. The primary goal is to ensure the safety of drivers and vehicles. Collecting data involved gathering information on three key road events: normal street and normal drive, speed bumps, circular yellow speed bumps, and three aggressive driving actions: sudden start, sudden stop, and sudden entry. The gathered data is processed and analyzed using a machine learning system designed for limited power and memory devices. The developed system resulted in 91.9% accuracy, 93.6% precision, and 92% recall. The achieved inference time on an Arduino Nano 33 BLE Sense with a 32-bit CPU running at 64 MHz is 34 ms and requires 2.6 kB peak RAM and 139.9 kB program flash memory, making it suitable for resource-constrained embedded systems.
Mechanical Engineering on AAI Summer Training Report-003.pdf
Mechanical Engineering PROJECT REPORT ON SUMMER VOCATIONAL TRAINING
AT MBB AIRPORT
一比一原版(CalArts毕业证)加利福尼亚艺术学院毕业证如何办理
CalArts毕业证学历书【微信95270640】CalArts毕业证’圣力嘉学院毕业证《Q微信95270640》办理CalArts毕业证√文凭学历制作{CalArts文凭}购买学历学位证书本科硕士,CalArts毕业证学历学位证【实体公司】办毕业证、成绩单、学历认证、学位证、文凭认证、办留信网认证、（网上可查，实体公司，专业可靠）
(诚招代理)办理国外高校毕业证成绩单文凭学位证,真实使馆公证（留学回国人员证明）真实留信网认证国外学历学位认证雅思代考国外学校代申请名校保录开请假条改GPA改成绩ID卡
1.高仿业务:【本科硕士】毕业证,成绩单（GPA修改）,学历认证（教育部认证）,大学Offer,,ID,留信认证,使馆认证,雅思,语言证书等高仿类证书；
2.认证服务: 学历认证（教育部认证）,大使馆认证（回国人员证明）,留信认证（可查有编号证书）,大学保录取,雅思保分成绩单。
3.技术服务：钢印水印烫金激光防伪凹凸版设计印刷激凸温感光标底纹镭射速度快。
办理加利福尼亚艺术学院加利福尼亚艺术学院毕业证文凭证书流程：
1客户提供办理信息：姓名生日专业学位毕业时间等（如信息不确定可以咨询顾问：我们有专业老师帮你查询）；
2开始安排制作毕业证成绩单电子图；
3毕业证成绩单电子版做好以后发送给您确认；
4毕业证成绩单电子版您确认信息无误之后安排制作成品；
5成品做好拍照或者视频给您确认；
6快递给客户（国内顺丰国外DHLUPS等快读邮寄）
-办理真实使馆公证（即留学回国人员证明）
-办理各国各大学文凭（世界名校一对一专业服务,可全程监控跟踪进度）
-全套服务：毕业证成绩单真实使馆公证真实教育部认证。让您回国发展信心十足！
（详情请加一下 文凭顾问+微信:95270640）欢迎咨询！子小伍玩小伍比山娃小一岁虎头虎脑的很霸气父亲让山娃跟小伍去夏令营听课山娃很高兴夏令营就设在附近一所小学山娃发现那所小学比自己的学校更大更美操场上还铺有塑胶跑道呢里面很多小朋友一班一班的快快乐乐原来城里娃都藏这儿来了怪不得平时见不到他们山娃恍然大悟起来吹拉弹唱琴棋书画山娃都不懂却什么都想学山娃怨自己太笨什么都不会斟酌再三山娃终于选定了学美术当听说每月要交元时父亲犹豫了山娃也说爸算了吧咱学校一学期才转
IEEE Aerospace and Electronic Systems Society as a Graduate Student Member
IEEE Aerospace and Electronic Systems Society as a Graduate Student Member
Recently uploaded (20)
Generative AI leverages algorithms to create various forms of content
Generative AI leverages algorithms to create various forms of content
Redefining brain tumor segmentation: a cutting-edge convolutional neural netw...
Redefining brain tumor segmentation: a cutting-edge convolutional neural netw...
Use PyCharm for remote debugging of WSL on a Windo cf5c162d672e4e58b4dde5d797...
Use PyCharm for remote debugging of WSL on a Windo cf5c162d672e4e58b4dde5d797...
International Conference on NLP, Artificial Intelligence, Machine Learning an...
International Conference on NLP, Artificial Intelligence, Machine Learning an...
Advanced control scheme of doubly fed induction generator for wind turbine us...
Advanced control scheme of doubly fed induction generator for wind turbine us...
Embedded machine learning-based road conditions and driving behavior monitoring
Embedded machine learning-based road conditions and driving behavior monitoring
Mechanical Engineering on AAI Summer Training Report-003.pdf
Mechanical Engineering on AAI Summer Training Report-003.pdf
IEEE Aerospace and Electronic Systems Society as a Graduate Student Member
IEEE Aerospace and Electronic Systems Society as a Graduate Student Member
2D Rotation- Transformation in Computer Graphics
- 1. Computer Graphics Transformation in Computer Graphics Guided by- Prof. Karthikeyan S
- 2. 2D- Rotation 2D Rotation is a process of rotating an object with respect to an angle in a two dimensional plane. This rotation is achieved by using the following rotation equations- 1) Xnew = Xold*cos θ – Yold*sin θ 2) Ynew = Xold*sin θ + Yold*cos θ
- 3. Question: Given a triangle with corner coordinates (0, 0), (1, 0) and (1, 1). Rotate the triangle by 90 degree anticlockwise direction and find out the new coordinates. Considering: ● (0,0) to be the coordinates of point A. ● (1,0) to be the coordinates of point B. ● (1,1) to be the coordinates of point C. Initial Triangle
- 12. C’(-1,1) A(0,0) C(1,1) B(1,0) B’(0,1) Solution without calculation Y XX’ Y’ Triangle after ROTATION Given Triangle
- 13. If we rotate the triangle ABC by an angle of 90° then the coordinates of A, B and C would change. Considering the new coordinates of A, B and C after the anticlockwise rotation to be (x’ , y’), the new triangle would look like the image given below: Triangle after rotation
- 14. Finding the new coordinates of: 1) A(x’,y’) x’= x * cos θ - y * sin θ = 0 * cos 90° - 0 * sin 90° = 0 y’= x * sin θ + y * cos θ = 0 * sin 90° + 0 * cos 90° = 0 New coordinates: A(0,0)
- 15. 2) B(x’,y’) x’= x * cos θ - y * sin θ = 1 * cos 90° - 0 * sin 90° = 0 y’= x * sin θ + y * cos θ = 1 * sin 90° + 0 * cos 90° = 1 New Coordinates: B(0,1)
- 16. 3) C(x’,y’) x’= x * cos θ - y * sin θ = 1 * cos 90° - 1 * sin 90° = -1 y’= x * sin θ + y * cos θ = 1 * sin 90° + 1 * cos 90° = 1 New Coordinates: C(-1,1)
- 17. Triangle after rotation of 90° (AC)Given triangle
- 18. Thank You