Pivot Point Scaling

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/DSSSB-TGT-COMPUTER-SCIENCE-PAPER-2/computer-graphics-multimedia-mobile-computing/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. Programming, Data Structures, OOP & Java: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References, Language Design, Intro to Compilers, Visual Basics, Syntax Analysis: Bottom-Up, Object Oriented Technology
  3. Computer Networks, TCP/IP & Network Security: Introduction to CN, Data Communication, DLL: Flow Control, DLL: Access Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Access Technologies, Network Security, Society, Law & Ethics, Cloud Computing, Mobile Computing, Net Layer:Routing Protocol, Cyber Safety and Security
  4. Teaching Methodology: Child Development, Concept of Pedagogy, Theories, Inclusive Education, Experiential Pedagogy, Assessment & Evaluation, Curriculum Framework & Reforms, National Education Policy (NEP) 2020, Psychology, Teaching-Learning Process, Personality Development, Teaching Methods & Strategies, Learning and Motivation, Learners & Learning Process, Factors Affecting Teaching, Methods of Teaching, Nature, Objectives & Characteristics of Teaching, Teaching-Learning Aids & ICT Integration, Classroom Management & Communication, Evaluation, Assessment & Measurement, Curriculum & School Environment, Inclusive Education & Special Needs, Professional Development & Ethics
  5. Digital Electronics / Boolean Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  6. Operating Systems & Linux: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, File Management, Disc Scheduling, Unix OS, Linux OS, Distributed Systems, Windows OS
  7. Data Base Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, File Organization & Indexing, Transaction Management, Concurrency Control, Database Security & Authorization, Database Recovery, Data Warehousing & Mining
  8. Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, HTML Basics, CSS, Emerging Technologies, JavaScript-Basics, .Net Programming, Electronic Data Interchange and E-Commerce, XML
  9. Computer Fundamentals, IT Basics & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer, Terms & Abbreviations, MS Office Applications, Instr Formats & Modes, Floating Point Rep
  10. Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  11. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, extras, Fundamentals of Systems and Information Systems
  12. Design & Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  13. Mathematics - I, II, III, IV: Permutation and Combination, Logarithm, Linear Algebra, Algebra, Calculus, Trigonometry, Vectors, Set Theory, Functions, Relations, Propositional and Predicate Logic, Research Process Steps, Graph Theory
  14. Computer Graphics, Multimedia & Mobile Computing: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, Multimedia
  15. Emerging Trends: Emerging Tech Trends, Knowledge Representation, Natural Language Processing
  16. Statistical Techniques: Probability, Statistics
  17. Interpolation - DI: Data Interpretation
  18. Basis of Physics: Physics
  19. Previous Year Paper:
  20. Business Studies and Management: Business Communication, Business Organization and Management, Financial Accounting, Business Economics, Management Information System (MIS), Knowledge Management & New Economy
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…