Bresenham's Circle Algorithm

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/UP-LT-GRADE-ASSISTANT-TEACHER-2025/cs-13-computer-graphics/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. CS | 01 | Digital Logic and Circuits and Discrete Mathematical Structures: Digital Systems & Boolean Basics, Number System, Number Representation, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Permutation and Combination
  3. CS | 02 | Computer Organization and Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Multiprocessors
  4. CS | 03 | Data Structures and Algorithm: 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, Complexity Theory, Advanced Algorithms
  5. CS | 04 | Problem Solving through C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. CS | 05 | Object Oriented Techniques: Object Oriented Technology, Java
  7. CS | 06 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Unix OS
  8. CS | 07 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Query Processing & Optimization, File Organization & Indexing
  9. CS | 08 | Computer Networks: 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
  10. CS | 09 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  11. CS | 10 | Internet Technology, Web Design and Web Technology: Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, JavaScript-Basics, HTML Basics
  12. CS | 11 | System Analysis And Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance
  13. CS | 12 | Information Security and Cyber Laws: Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security
  14. CS | 13 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  15. GS Paper | 01 | Indian and World Geography: Geography
  16. GS Paper | 02 | History: History
  17. GS Paper | 03 | Indian Economy & Social Development: Indian Economy
  18. GS Paper | 04 | General Science: Biology, Chemistry, Physics
  19. GS Paper | 05 | Elementary Maths: Number System, Divisibility Rules, HCF LCM, Percentage, Profit and Loss, Simple Interest and Compound Interest, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Algebra, Mensuration and Geometry, Data Interpretation, Arithmetic, Statistics, Probability, Sequence and Series (Series), Mixture and Alligation, Calculus, Trigonometry, Vectors
  20. GS Paper | 06 | Indian Polity and Governance: Polity
  21. GS Paper | 07 | Current Events: GK- Current Affairs
  22. UPLT Live Classes Notes: UPLT Live Classes
  23. UPLT Full Mock Tests Tier 1:
  24. UPLT Full Mock Tests Tier 2:
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…