Filled Area Primitives

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/computer-graphics/basics-of-computer-graphics/fill-algorithms/asset-filled-area-primitives after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. 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
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  4. Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. Computer Networks: Introduction to CN, 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, Network Security, Hardware Basics
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. Theory Of Computation: 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
  10. Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Divisibility Rules, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Speed Mathematics and Basic Mathematics, TCS NQT Advanced Quantitative Ability, Gamified / Game Based Aptitude, Linear Algebra, Trigonometry
  16. Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Crypt Arithmetic, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability
  17. English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Sentence Construction, Active Passive Voice (Voice), Determiner, Facts, Inference and Judgements, Adverb, Interjection, Verb, English Writing Ability
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video is a lecture on computer graphics, focusing on algorithms for drawing and filling shapes. It begins with a multiple-choice question on Bresenham's circle generation algorithm, explaining the decision parameter and next point calculation for the first quadrant. The lecture then transitions to a question on 2D rotation, demonstrating how to find the new coordinates of a point after a 90-degree rotation about a pivot. The main topic shifts to area filling, where the instructor discusses the Boundary Fill Algorithm, showing a diagram of a cross-shaped region being filled. The lecture continues with an explanation of Polygon Filling, covering two main types: Solid-fill and Pattern-fill, illustrated with diagrams of a rectangle and a hexagon. Finally, the video details two fundamental area-filling approaches: the Scan-Line Fill Algorithm, which determines overlap intervals for scan lines, and the Boundary Fill Algorithm, which starts from a seed point and paints outward until a boundary is encountered. The instructor uses a digital whiteboard to write equations and draw diagrams to clarify the concepts.

Chapters

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

    The video starts with a multiple-choice question about Bresenham's circle generation algorithm. The on-screen text asks for the next point (xi+1, yi+1) and the updated decision parameter pi+1 for a circle centered at (0,0) with radius r, given the current point (xi, yi) and decision parameter pi, for the case where pi >= 0. The options are presented with different formulas for xi+1, yi+1, and pi+1. The instructor then moves to a new question about 2D rotation, asking for the new coordinates of point P(5,1) after a 90-degree rotation about pivot point (2,2). The options are (3,5), (5,3), (2,4), and (1,5). The instructor then begins to explain the concept of shearing, showing a formula for transforming a point (x,y) to (x',y') using shearing factors Shx and Shy relative to a reference point (xref, yref).

  2. 2:00 – 4:02 02:00-04:02

    The lecture continues with a question about curve generation, asking which statements are correct regarding Hermite and Bezier curves. The options are: I. Hermite curves use interpolation; II. Bezier curves use approximation; III. The Bezier curve lies within the convex hull of its control points; IV. The degree of a Bezier curve does not depend on the number of control points. The instructor then moves to a question about code, asking which of the statements P, Q, and R are correct, with the answer being 'P and Q only'. The next topic is the Midpoint Ellipse's Algorithm, where the instructor explains the initial decision parameter calculation for region 1 and region 2. The video then focuses on the Boundary Fill Algorithm, with a diagram showing a cross-shaped region being filled. The instructor explains that the algorithm starts at a seed point inside a region and paints outward until it encounters the boundary. The lecture then transitions to Polygon Filling, discussing two types: Solid-fill, where all pixels inside the polygon's boundary are illuminated, and Pattern-fill, where the polygon is filled with a predefined pattern. The instructor explains two basic approaches to area filling: the Scan-Line Fill Algorithm, which determines overlap intervals for scan lines, and the Boundary Fill Algorithm, which starts from a given interior position and paints outward until it encounters the specified boundary conditions.

The video provides a comprehensive overview of key algorithms in computer graphics for rendering shapes. It begins with fundamental drawing algorithms, such as Bresenham's circle and rotation, which are essential for creating basic geometric primitives. The core of the lecture then shifts to area filling, a critical process for rendering solid shapes. The instructor systematically explains the concepts of boundary and polygon filling, distinguishing between different types like solid and pattern fill. The lesson culminates in a comparison of the two primary area-filling techniques: the Scan-Line algorithm, which is efficient for simple shapes, and the Boundary Fill algorithm, which is more suitable for complex boundaries. This progression from drawing to filling demonstrates the layered approach to creating visual content in raster graphics.

Loading lesson…