Mid Point Circle Algorithm

Duration: 10 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-mid-point-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, वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research
  19. GS Paper | 05 | Elementary Maths: संख्या पद्धति / Number System, Divisibility Rules, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, प्रतिशत / Percentage, लाभ, हानि और बट्टा / Profit, Loss and Discount, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, समय और कार्य / Time and Work, समय, चाल और दूरी / Time, Speed and Distance, Algebra, घन क्षेत्रमिति / Solid Mensuration, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, Statistics, Probability, Sequence and Series (Series), मिश्रण और एलिगेशन / Mixture and Alligation, Calculus, Trigonometry, Vectors, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, यूक्लिडीय ज्यामिति और क्षेत्रमिति / Euclidean Geometry and Mensuration, सांख्यिकी और प्रायिकता / Statistics and Probability, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers, समतल क्षेत्रमिति / Plane Mensuration, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics
  20. GS Paper | 06 | Indian Polity and Governance: Polity
  21. GS Paper | 07 | Current Events: समसामयिकी / 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 provides a comprehensive lecture on the Midpoint Circle Algorithm, a fundamental computer graphics technique for drawing circles on a pixel grid. The presentation begins by outlining the algorithm's core steps, emphasizing the use of symmetry to reduce computation. It explains that the algorithm first calculates pixel positions for one octant (the first quadrant) and then uses symmetry to determine the positions for the remaining seven octants. The key insight is the use of a decision parameter, derived from the circle's implicit function f(x,y) = x² + y² - r², to determine the closest pixel to the true circle path at each step. The video then derives the recursive formula for this decision parameter, p, and presents the complete algorithm in pseudocode. Finally, it demonstrates the algorithm with a worked example for a circle of radius 10, showing the initial setup, the iterative process, and the resulting pixel positions in a table, all while using a diagram to illustrate the concept of the midpoint decision.

Chapters

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

    The video introduces the Midpoint Circle Algorithm. The on-screen text outlines the steps: first, calculate pixel positions for a circle centered at the origin (0,0) with a given radius r. Then, these positions are translated to the screen center (xc, yc) by adding xc and yc to the coordinates. The algorithm focuses on the first quadrant, taking unit steps in the positive x direction and using a decision parameter to choose between two possible y positions. The remaining seven octants are generated by symmetry. A hand-drawn diagram on the right shows a circle with axes and the text '8-way symmetry' to illustrate this concept.

  2. 2:00 – 5:00 02:00-05:00

    The lecture transitions to the mathematical foundation of the algorithm. It defines the circle function as f(x,y) = x² + y² - r², which is negative for points inside the circle, zero on the boundary, and positive outside. This function is established as the decision parameter. The video then shows a diagram of a grid with a circle, a midpoint (xk+1, yk-1/2), and the decision parameter pk. The text explains that if pk < 0, the midpoint is inside the circle, and the pixel on the scan line yk is chosen. The derivation of the recursive formula for the next decision parameter, pk+1, is shown by evaluating the circle function at the next sampling position, leading to the expression pk+1 = pk + 2xk+1 + 1 - 2yk+1 + yk+1² - yk².

  3. 5:00 – 10:00 05:00-10:00

    The video presents the complete Midpoint Circle Algorithm in pseudocode. The code initializes x=0, y=r, and the initial decision parameter p = 5/4 - r. It then enters a loop while x < y, plotting the pixel (x,y) and updating the decision parameter. If p < 0, p is updated as p + 2x + 3; otherwise, p is updated as p + 2x - 2y + 5, and y is decremented. The video then provides a worked example for a circle with radius r = 10. A table is shown with columns for x, y, and p, and the initial values are set: x=0, y=10, p=5/4-10 = -9.75. The algorithm's steps are demonstrated, showing the first few iterations of the loop.

  4. 10:00 – 10:26 10:00-10:26

    The video concludes the example by showing the final table of pixel positions for the first octant of the circle with radius 10. The table lists the values of x, y, and p for each step of the algorithm. The final row shows x=7, y=7, and p=1, which is the last point before the condition x < y fails. The diagram on the right shows the circle with the initial point (0,10) and the final point (7,7) marked, illustrating the path traced by the algorithm in the first quadrant.

The video systematically builds an understanding of the Midpoint Circle Algorithm. It starts with the high-level concept of using symmetry to efficiently draw a circle, then delves into the core mathematical principle: the decision parameter derived from the circle's implicit function. By deriving the recursive formula for this parameter, the video shows how the algorithm avoids computationally expensive operations like square roots and trigonometric functions. The final demonstration with a concrete example for r=10 solidifies the understanding, showing how the algorithm iteratively calculates the next pixel position based on the current decision parameter, making it a highly efficient and practical method for computer graphics.

Loading lesson…