Polygon Clipping Part II (Sutherland-Hodgeman)

Duration: 9 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/introduction-to-clipping/asset-polygon-clipping-part-ii-sutherland-hodgeman 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: वृद्धि और विकास / Growth and Development, Concept of Pedagogy, विकास के सिद्धांत / Theories of Development, समावेशी शिक्षा / Inclusive Education, Experiential Pedagogy, आकलन और मूल्यांकन / Assessment and Evaluation, समाजीकरण और जेंडर / Socialisation and Gender, National Education Policy (NEP) 2020, संज्ञानात्मक प्रक्रियाएँ / Cognitive Processes, शिक्षण योजना और शिक्षण कौशल / Teaching Planning and Teaching Skills, Personality Development, शिक्षण विधियाँ / Teaching Methods, अधिगम और व्यवहारवादी सिद्धांत / Learning and Behavioural Theories, Learners & Learning Process, Factors Affecting Teaching, शिक्षण विधियाँ एवं उपागम / Teaching Methods and Approaches, शिक्षण-अधिगम प्रक्रिया एवं कक्षा प्रबंधन / Teaching-Learning Process and Classroom Management, शिक्षण सहायक सामग्री एवं शैक्षिक तकनीकी / Teaching Aids and Educational Technology, सूक्ष्म शिक्षण एवं कक्षा संप्रेषण / Microteaching and Classroom Communication, आकलन एवं मूल्यांकन / Assessment and Evaluation, पाठ्यचर्या, कला एवं सह-शैक्षिक क्षेत्र / Curriculum, Arts and Co-curricular Areas, दिव्यांग बच्चों की शिक्षा / Education of Children with Disabilities, शिक्षक: गुण, व्यावसायिक नैतिकता एवं विकास / Teacher: Qualities, Professional Ethics and Development
  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, कंप्यूटर के मूल सिद्धांत / Computer Fundamentals, साइबर सुरक्षा / Cyber Safety and Security, कंप्यूटर सॉफ़्टवेयर / Computer Software, ऑपरेटिंग सिस्टम / Operating System, वर्ड प्रोसेसिंग (MS Word) / Word Processing (MS Word), कंप्यूटर नेटवर्क / Computer Networks, प्रेज़ेंटेशन (MS PowerPoint) / Presentation Software (MS PowerPoint)
  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, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, यूक्लिडीय ज्यामिति और क्षेत्रमिति / Euclidean Geometry and Mensuration, सांख्यिकी और प्रायिकता / Statistics and Probability, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers, समतल क्षेत्रमिति / Plane Mensuration, प्रतिचयन / Sampling, प्रतिशत / Percentage, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, अनुपात और समानुपात / Ratio and Proportion
  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, व्यापार, विपणन एवं उपभोक्ता संरक्षण / Trade, Marketing and Consumer Protection
  16. Statistical Techniques: Probability, Statistics
  17. Interpolation - DI: आँकड़ा निर्वचन / Data Interpretation
  18. Basis of Physics: वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research
  19. Previous Year Paper:
  20. Business Studies and Management: Business Communication, प्रबंध के सिद्धांत एवं कार्य / Principles and Functions of Management, लेखांकन के आधार एवं लेन-देनों का अभिलेखन / Accounting Fundamentals and Recording of Transactions, Business Economics, ह्रास, अंतिम खाते व कंप्यूटरीकृत लेखांकन / Depreciation, Final Accounts and Computerised Accounting, Knowledge Management & New Economy
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video is a lecture on the window boundary clipping algorithm for polygons, presented as a digital document. It begins by outlining four possible cases for processing adjacent vertices of a polygon relative to a window boundary. Case 1 (out-in) occurs when the first vertex is outside and the second is inside, resulting in the intersection point and the second vertex being added to the output. Case 2 (in-in) is when both vertices are inside, so only the second vertex is added. Case 3 (in-out) is when the first is inside and the second is outside, so only the intersection point is added. Case 4 (out-out) is when both are outside, and nothing is added. The lecture then transitions to a practical example, demonstrating the clipping process step-by-step against the left and right boundaries of a window, using a polygon with vertices A, B, C, D, and E. The instructor explains how each edge is classified and which vertices are added to the output list, such as adding vertex B for an in-in case and a new vertex D' for an in-out case.

Chapters

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

    The video displays a document titled 'to the next window boundary clipper.' It introduces the concept of four possible cases when processing vertices of a polygon around its perimeter. The first case, 'Case 1 (out-in)', is detailed: if the first vertex is outside the window boundary and the second is inside, both the intersection point of the polygon edge with the window boundary and the second vertex are added to the output vertex list. A diagram illustrates this with vertices V1 (outside) and V2 (inside), showing the intersection point V1' being added to the output list.

  2. 2:00 – 5:00 02:00-05:00

    The lecture continues with the second case, 'Case 2 (in-in)'. The text states that if both input vertices are inside the window boundary, only the second vertex is added to the output vertex list. A diagram shows a polygon with vertices V1 and V2 both inside the window, and the text indicates 'Save V2'. The third case, 'Case 3 (in-out)', is then introduced: if the first vertex is inside and the second is outside, only the edge intersection with the window boundary is added to the output list. The fourth case, 'Case 4 (out-out)', is presented as the final scenario: if both vertices are outside, nothing is added to the output list.

  3. 5:00 – 8:53 05:00-08:53

    The video presents a worked example. It shows a polygon with vertices A, B, C, D, and E, and a rectangular window. The process of clipping against the left window boundary is explained. For edge AB (in-in case), vertex B is added. For edge BC (in-in case), vertex C is added. For edge CD (in-out case), a new vertex D' (the intersection of CD with the left boundary) is added. For edge DE (in-out case), vertex D is added. For edge EA (out-in case), vertices E' (intersection of EA with the left boundary) and A are added. The result after clipping against the left boundary is shown. The process is then repeated for the right window boundary, with similar logic applied to each edge.

The video provides a comprehensive, step-by-step explanation of the window boundary clipping algorithm for polygons. It systematically breaks down the process into four fundamental cases based on the position of adjacent vertices relative to the clipping window. The lecture uses a clear, structured approach, first defining the rules for each case with text and diagrams, and then applying them in a practical example. This progression from theory to application effectively demonstrates how the algorithm processes each edge of a polygon to generate a new, clipped polygon that fits within the specified window boundaries.

Loading lesson…