Boundary Filled Algorithm(8 - Connected)

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/other-recurring-cs-topics/basics-of-computer-graphics/fill-algorithms/asset-boundary-filled-algorithm8-connected 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 is a lecture on the Boundary Fill Algorithm in computer graphics, focusing on the difference between 4-connected and 8-connected methods. It begins by defining the order in which pixels are added to a stack for filling: for 4-connected, the order is above, below, left, and right; for 8-connected, it includes the four diagonal neighbors as well. The lecture uses a grid of pixels to demonstrate the algorithm, showing how a 4-connected fill can result in a partial fill, while an 8-connected fill correctly fills the entire interior. The instructor uses a digital whiteboard to draw and number the pixels, illustrating the step-by-step process of the fill operation. The video concludes with a diagram that explicitly shows the eight neighboring points tested in the 8-connected method, labeled as (x-1,y), (x+1,y), (x,y-1), (x,y+1), (x-1,y-1), (x-1,y+1), (x+1,y-1), and (x+1,y+1).

Chapters

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

    The video starts with a slide titled 'Boundary Fill Algorithm' and '4-connected (Example)'. The instructor explains the order of pixels to be added to the stack for 4-connected filling: above, below, left, and right. For 8-connected, the order includes the four diagonal neighbors: above-left, above-right, below-left, and below-right. A diagram shows a grid of pixels with a central pixel marked as the starting point, and the instructor uses a digital pen to illustrate the filling process, marking the order of pixels to be filled. The slide number is 53, and the instructor is explaining the concept of 4-connectedness, which only considers the four direct neighbors (up, down, left, right).

  2. 2:00 – 3:54 02:00-03:54

    The video transitions to a new slide titled 'Boundary Fill Algorithm' with '8-connected (Example)'. The instructor demonstrates the 8-connected method, which considers all eight surrounding pixels. A diagram shows a grid with a starting pixel, and the instructor uses a digital pen to fill the pixels in the order of 8-connectedness, showing how it fills the entire area. The slide number is 60, and the instructor explains that an 8-connected algorithm would correctly fill the interior of the area, unlike the 4-connected method which can produce a partial fill. The instructor then moves to a new slide (slide 61) which shows a figure with two parts: (A) shows an area that needs to be filled, and (B) shows the result of a 4-connected fill, which is a partial fill. The instructor explains that an 8-connected fill would correctly fill the interior. The final slide (slide 63) shows a diagram of the 8-connected method, with the eight neighboring points labeled as (x-1,y), (x+1,y), (x,y-1), (x,y+1), (x-1,y-1), (x-1,y+1), (x+1,y-1), and (x+1,y+1).

The lecture systematically compares the 4-connected and 8-connected boundary fill algorithms. It begins by defining the pixel connectivity for each method, using a clear diagram to illustrate the difference in neighbor consideration. The core of the lesson is a practical demonstration where the instructor applies both methods to a sample grid. The 4-connected method is shown to be inadequate for certain shapes, resulting in a partial fill, while the 8-connected method successfully fills the entire interior. The video concludes by reinforcing the concept with a diagram that explicitly labels the eight neighboring points, solidifying the understanding of the 8-connected approach.

Loading lesson…