Computer Graphics for SPPU 19 Course (SE - I - Comp.- 210244) -for In Sem Exam

Computer Graphics for SPPU 19 Course (SE - I - Comp.- 210244) -for In Sem Exam (Paperback, A. P. Godse, Dr. D. A. Godse, Dr. Rajesh Prasad)

Share

Computer Graphics for SPPU 19 Course (SE - I - Comp.- 210244) -for In Sem Exam  (Paperback, A. P. Godse, Dr. D. A. Godse, Dr. Rajesh Prasad)

4.5
4 Ratings & 0 Reviews
Special price
₹101
105
3% off
i
Available offers
  • Special PriceGet extra 3% off
    T&C
  • Bank Offer5% cashback on Axis Bank Flipkart Debit Card up to ₹750
    T&C
  • Bank Offer5% cashback on Flipkart SBI Credit Card upto ₹4,000 per calendar quarter
    T&C
  • Bank OfferFlat ₹50 off on Flipkart Bajaj Finserv Insta EMI Card. Min Booking Amount: ₹2,500
    T&C
  • Delivery
    Check
    Enter pincode
      Delivery by20 Dec, Saturday
      ?
    View Details
    Highlights
    • Binding: Paperback
    • Publisher: Technical Publications
    • ISBN: 9788194662884
    • Edition: 1, 2020
    • Pages: 236
    Services
    • Cash on Delivery available
      ?
    Seller
    TechnicalPublications
    3.9
    • 7 Days Replacement Policy
      ?
  • See other sellers
  • Description
    Unit I Graphics Primitives and Scan Conversion Algorithms Introduction, graphics primitives - pixel, resolution, aspect ratio, frame buffer. Display devices, applications of computer graphics. Introduction to OpenGL - OpenGL architecture, primitives and attributes, simple modelling and rendering of two- and three-dimensional geometric objects, GLUT, interaction, events and call-backs picking. (Simple Interaction with the Mouse and Keyboard) Scan conversion: Line drawing algorithms: Digital Differential Analyzer (DDA), Bresenham. Circle drawing algorithms: DDA, Bresenham, and Midpoint. (Chapters - 1,2,3) Unit II Polygon, Windowing and Clipping Polygons: Introduction to polygon, types: convex, concave and complex. Inside test. Polygon Filling: flood fill, seed fill, scan line fill. Windowing and dipping: viewing transformations, 2-D clipping: Cohen- Sutherland algorithm line Clipping algorithm, Sutherland Hodgeman Polygon clipping algorithm, Weiler Atherton Polygon Clipping algorithm. (Chapters - 4,5)
    Read More
    Specifications
    Book Details
    Publication Year
    • 2020 July
    Table of Contents
    • Graphics Primitives and Scan Conversion Algorithms Introduction, graphics primitives - pixel, resolution, aspect ratio, frame buffer. Display devices, applications of computer graphics. Introduction to OpenGL - OpenGL architecture, primitives and attributes, simple modelling and rendering of two- and three-dimensional geometric objects, GLUT, interaction, events and call-backs picking. (Simple Interaction with the Mouse and Keyboard) Scan conversion: Line drawing algorithms: Digital Differential Analyzer (DDA), Bresenham. Circle drawing algorithms: DDA, Bresenham, and Midpoint. (Chapters - 1,2,3) Polygon, Windowing and Clipping Polygons: polygon, types: convex, concave and complex. Inside test. Polygon Filling: flood fill, seed fill, scan line fill. Windowing and dipping: viewing transformations, 2-D clipping: Cohen- Sutherland algorithm line Clipping algorithm, Sutherland Hodgeman Polygon clipping algorithm, Weiler Atherton Polygon Clipping algorithm. (Chapters - 4,5)
    Number of Pages
    • 236
    University Books Details
    Stream
    • Computer Engineering
    Degree/Diploma
    • Degree
    Subject
    • Computer Graphics
    Additional Features
    Age Group
    • 18-58
    Ratings & Reviews
    4.5
    4 Ratings &
    0 Reviews
    • 5
    • 4
    • 3
    • 2
    • 1
    • 2
    • 2
    • 0
    • 0
    • 0
    Have you used this product? Be the first to review!
    Be the first to ask about this product
    Safe and Secure Payments.Easy returns.100% Authentic products.
    You might be interested in
    Medical And Nursing Books
    Min. 50% Off
    Shop Now
    Finance And Accounting Books
    Min. 50% Off
    Shop Now
    Language And Linguistic Books
    Min. 50% Off
    Shop Now
    Politics Books
    Min. 50% Off
    Shop Now
    Back to top