Page 99 - DCAP313_LAB_ON_COMPUTER_GRAPHICS

Unit 5: Implementing Ellipse Algorithm

Ellipse: An ellipse is a plane curve that results from the intersection of a cone by a plane in a Notes
way that produces a closed curve.

Pseudo Code: It is an informal high-level description of the operating principle of a computer
program or other algorithm.

Quadrilateral: A quadrilateral is a polygon with four sides (or edges) and four vertices or
corners. Sometimes, the term quadrangle is used, by analogy with triangle.

Tangent: The tangent line to a plane curve at a given point is the straight line that “just touches”
the curve at that point.

5.7 Review Questions

1. Define Bresenham’s ellipse drawing algorithm.
2. Explain midpoint ellipse algorithm.
3. Define Ellipse area, sector area and segment area.
4. What is the core segment algorithm?

5. Define area for intersecting ellipses.
6. What is the ellipse segment?
7. Explain area for non-intersecting ellipses.

8. What is the segment area for a (directional) line through a general ellipse?
9. How can we do implementation of the algorithm?
10. Define ellipse-ellipse overlap area.

Answers for Self Assessment Questions
1. (a) 2. (c) 3. (d) 4. (b) 5. (b)
6. (d) 7. (d) 8. (c) 9. (b) 10. (a)

11. (b) 12. (a) 13. (a) 14. (a) 15. (a)
5.8 Further Readings

Implementation and Algorithms, by Max K. Agoston
Ellipse Drawing Algorithms for VLSI Implementation, by Sifang Chu

http://books.google.co.in/books?id=8OUzIgAACAAJ&dq=Impleme
nting+Ellipse+Algorithm&source=bl&ots=hH-fhoSOpG&sig=C83UE
Q0o77I9iQ0uxgYRXETy-AI&hl=en&sa=X&ei=5MQPUKrlAobUrQfe
3oDIDw&ved=0CFEQ6AEwBg

LOVELY PROFESSIONAL UNIVERSITY 93