Introduction Circle Drawing Algorithm

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/computer-graphics/basics-of-computer-graphics/circle-drawing-algorithms/asset-introduction-circle-drawing-algorithm 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.

This video lecture provides a comprehensive explanation of the Midpoint Circle Drawing Algorithm, a fundamental technique in computer graphics. The instructor begins by defining a circle mathematically using the Pythagorean theorem in Cartesian coordinates, highlighting the computational overhead of direct methods. To address this, the lecture introduces the Midpoint Circle Algorithm, which leverages the eight-way symmetry of a circle to drastically reduce computation. The core of the algorithm is the use of a decision parameter, D, which is initialized and updated incrementally to determine the next pixel position. The video demonstrates the algorithm's application with a worked example for a circle of radius 10, showing the step-by-step calculation of the decision parameter and pixel coordinates in the first octant. The process is then extended to the other seven octants using symmetry, and the final output is a complete circle. The lecture also includes a brief discussion of the algorithm's efficiency compared to the DDA algorithm, noting its use of only integer arithmetic and avoidance of costly operations.

Chapters

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

    The video starts with a definition of a circle as the set of points at a fixed distance r from a center (xc, yc). It discusses the computational inefficiency of direct methods like the Pythagorean theorem, which require a lot of computation. The lecture then introduces the Midpoint Circle Algorithm as a more efficient solution. The core concept is to calculate pixel positions in the first octant and use symmetry to plot the remaining seven octants. The algorithm uses a decision parameter, D, to determine the next pixel position. The video shows the initial setup for the algorithm, including the formula for the decision parameter D = 4r - 5, and the initial values for x and y. The instructor explains that the algorithm iterates while x is less than y, plotting pixels and updating the decision parameter based on its value.

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

    The lecture continues with a detailed explanation of the Midpoint Circle Algorithm. It shows a table of iterations for a circle with radius 10, demonstrating the step-by-step calculation of the decision parameter D and the corresponding pixel coordinates (x, y). The video emphasizes the use of eight-way symmetry, showing a diagram of a circle with eight symmetric points labeled (x,y), (y,x), (-x,y), etc. The instructor explains that by calculating points in one octant, the other seven can be derived through simple coordinate transformations. The video also presents a multiple-choice question about the efficiency of the Midpoint algorithm compared to the DDA algorithm, highlighting that it avoids round-off operations and uses only integer arithmetic. The final part of the video shows the complete algorithm in pseudocode, including the initialization, loop, and pixel plotting functions.

The video provides a structured and logical progression from the mathematical definition of a circle to the practical implementation of an efficient algorithm. It begins by establishing the problem: the high computational cost of direct methods. It then introduces the Midpoint Circle Algorithm as a solution, focusing on its core innovation: the decision parameter. The lecture effectively uses a combination of mathematical formulas, a worked example with a table, and a clear diagram of eight-way symmetry to explain the algorithm's logic and efficiency. The final synthesis is the demonstration of how the algorithm's design, based on symmetry and incremental integer arithmetic, makes it a superior choice for rasterizing circles in computer graphics.

Loading lesson…