Pivot Point Scaling

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/other-recurring-cs-topics/2-d-geometrical-transforms-and-viewing/pivot-point-algorithms/asset-pivot-point-scaling after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware Basics, Network Security
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. TOC & Compiler: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video presents a lecture on computer graphics transformations, specifically focusing on scaling about a pivot point and fixed-point scaling. It begins by explaining that scaling about a pivot point involves a sequence of three operations: translating the pivot point to the origin, scaling the object, and then translating the pivot point back. The composite transformation matrix for this process is derived as T = T_p * S * T_{-p}, where T_p is the translation matrix to the pivot, S is the scaling matrix, and T_{-p} is the inverse translation. The video then transitions to the concept of general fixed-point scaling, where the same three-step process is applied to scale an object about any arbitrary fixed point. A worked example is provided: given a point P(6,8), scaling factors Sx=2, Sy=3, and a fixed point (2,2), the lecture demonstrates the step-by-step calculation of the new point P' by first translating the fixed point to the origin, applying the scaling, and then translating back. The final answer for P' is calculated as (10,20).

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video starts with a slide titled 'General Pivot-Point Scaling'. It explains that scaling about a pivot point P follows a sequence of three operations: 1. Translate P to the origin, 2. Scale, 3. Translate P back. The composite transformation matrix is given as T = T_p * S * T_{-p}. The slide then shows the matrix form of this transformation, where the translation components are (1-sx) and (1-sy). The lecture then transitions to a new slide titled 'Composite Transformation Matrix' which introduces 'General Fixed-Point Scaling'. The operations are listed as: 1. Translate (fixed point is moved to origin), 2. Scale (with respect to origin), 3. Translate (fixed point is returned to original position). The formula T(fixed) * S * T(-fixed) is shown. A problem is presented: Find the matrix for scaling an object with respect to any fixed point. Given P(6,8), Sx=2, Sy=3, and fixed point (2,2). The instructor begins to solve this by first calculating the translation to move the fixed point (2,2) to the origin, which is (6-2, 8-2) = (4,6). The next step is to apply the scaling matrix to this translated point, resulting in (4*2, 6*3) = (8,18). Finally, the point is translated back by adding the original fixed point (2,2), resulting in (8+2, 18+2) = (10,20). The instructor writes the final answer as P' = (10,20).

  2. 2:00 – 2:01 02:00-02:01

    The video shows the final answer for the worked example. The instructor has written 'Answer' in blue text at the bottom of the slide. The final calculated point P' is (10,20), which is the result of scaling the point P(6,8) about the fixed point (2,2) with Sx=2 and Sy=3. The slide remains on screen, showing the complete problem and solution.

The lecture systematically builds from the general concept of pivot-point scaling to the specific application of fixed-point scaling. It emphasizes that scaling about a point other than the origin requires a composite transformation, which is a sequence of translation and scaling operations. The core idea is that the order of transformations is critical, and the process involves moving the reference point to the origin, performing the scaling, and then moving it back. The worked example provides a clear, step-by-step application of this principle, demonstrating how to calculate the new coordinates of a point after a non-origin scaling transformation.

Loading lesson…