Bresenham's Circle Algorithm

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/other-recurring-cs-topics/basics-of-computer-graphics/circle-drawing-algorithms/asset-bresenhams-circle-algorithm 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.

This video is a lecture on Bresenham's circle drawing algorithm, a fundamental computer graphics technique. The instructor begins by introducing the algorithm's goal: to efficiently generate the pixels of a circle in one octant, leveraging symmetry to plot the full circle. The core of the method is the use of a decision parameter, Dk, which is derived from the circle's implicit function F(x,y) = x² + y² - r². The algorithm evaluates this function at the midpoint between two candidate pixels (S and N) to decide which pixel is closer to the true circle. The lecture provides a detailed, step-by-step example for a circle with radius r=10, calculating the initial decision parameter p0 = 1 - r = -9. It then demonstrates the iterative process, showing how the decision parameter is updated at each step based on its sign, and how the x and y coordinates are incremented accordingly. The video concludes by presenting the complete pseudocode for the algorithm, which includes the initialization of variables and the main loop that continues until x is no longer less than y.

Chapters

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

    The video starts with a worked example of Bresenham's circle algorithm for a circle with radius r=10. The initial decision parameter is calculated as p0 = 1 - r = 1 - 10 = -9. The instructor then presents a table showing the first few iterations, where the initial point is (x, y) = (0, 10). The first iteration shows that since p0 < 0, the next point is (1, 10) and the new decision parameter is p1 = p0 + 2x0 + 3 = -9 + 0 + 3 = -6. The table continues to show the progression of x, y, and p values through several iterations, demonstrating the algorithm's logic.

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

    The lecture transitions to a more formal explanation of the algorithm's logic. It defines the circle function F(S) = (xk)² + (yk)² - r², which is negative for points inside the circle. The decision parameter Dk is defined as F(N) + F(S), where N and S are the two candidate pixels. The instructor explains that if Dk < 0, the midpoint is inside the circle, so the pixel N is chosen; if Dk > 0, the midpoint is outside, so pixel S is chosen. The video then shows the pseudocode for the algorithm, which initializes x=0, y=r, and d=3-2r. The main loop runs while x < y, plotting the pixel (x,y) and updating the decision parameter d based on its sign. The code shows the update rules: if d < 0, then d = d + 4x + 6; otherwise, d = d + 4(x-y) + 10, and y is decremented. The instructor also shows the derivation of the initial decision parameter d0 = 3 - 2r.

The video provides a comprehensive, step-by-step tutorial on Bresenham's circle drawing algorithm. It effectively combines a concrete numerical example with the underlying mathematical theory and the final implementation in pseudocode. The progression from the initial decision parameter calculation to the iterative logic and the final code structure clearly illustrates how this efficient algorithm uses integer arithmetic to determine the optimal pixel positions, making it a cornerstone of raster graphics.

Loading lesson…