Mid Point Circle Algorithm

Duration: 10 min

This video lesson is available to enrolled students.

Return to /learn/DSSSB-TGT-COMPUTER-SCIENCE-PAPER-2/computer-graphics-multimedia-mobile-computing/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. Programming, Data Structures, OOP & Java: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References, Language Design, Intro to Compilers, Visual Basics, Syntax Analysis: Bottom-Up, Object Oriented Technology
  3. Computer Networks, TCP/IP & Network Security: Introduction to CN, Data Communication, DLL: Flow Control, DLL: Access Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Access Technologies, Network Security, Society, Law & Ethics, Cloud Computing, Mobile Computing, Net Layer:Routing Protocol, Cyber Safety and Security
  4. Teaching Methodology: Child Development, Concept of Pedagogy, Theories, Inclusive Education, Experiential Pedagogy, Assessment & Evaluation, Curriculum Framework & Reforms, National Education Policy (NEP) 2020, Psychology, Teaching-Learning Process, Personality Development, Teaching Methods & Strategies, Learning and Motivation, Learners & Learning Process, Factors Affecting Teaching, Methods of Teaching, Nature, Objectives & Characteristics of Teaching, Teaching-Learning Aids & ICT Integration, Classroom Management & Communication, Evaluation, Assessment & Measurement, Curriculum & School Environment, Inclusive Education & Special Needs, Professional Development & Ethics
  5. Digital Electronics / Boolean Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  6. Operating Systems & Linux: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, File Management, Disc Scheduling, Unix OS, Linux OS, Distributed Systems, Windows OS
  7. Data Base Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, File Organization & Indexing, Transaction Management, Concurrency Control, Database Security & Authorization, Database Recovery, Data Warehousing & Mining
  8. Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, HTML Basics, CSS, Emerging Technologies, JavaScript-Basics, .Net Programming, Electronic Data Interchange and E-Commerce, XML
  9. Computer Fundamentals, IT Basics & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer, Terms & Abbreviations, MS Office Applications, Instr Formats & Modes, Floating Point Rep
  10. Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  11. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, extras, Fundamentals of Systems and Information Systems
  12. Design & Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  13. Mathematics - I, II, III, IV: Permutation and Combination, Logarithm, Linear Algebra, Algebra, Calculus, Trigonometry, Vectors, Set Theory, Functions, Relations, Propositional and Predicate Logic, Research Process Steps, Graph Theory
  14. Computer Graphics, Multimedia & Mobile Computing: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, Multimedia
  15. Emerging Trends: Emerging Tech Trends, Knowledge Representation, Natural Language Processing
  16. Statistical Techniques: Probability, Statistics
  17. Interpolation - DI: Data Interpretation
  18. Basis of Physics: Physics
  19. Previous Year Paper:
  20. Business Studies and Management: Business Communication, Business Organization and Management, Financial Accounting, Business Economics, Management Information System (MIS), Knowledge Management & New Economy
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…