Lecture

Rasterization Algorithms: Bresenham Algorithm

In course

Adipisicing laboris aliquip esse deserunt laboris sunt voluptate duis elit nostrud esse. Irure ullamco aute labore magna laboris deserunt sint sunt esse. Cillum elit nostrud ex fugiat amet irure. Excepteur velit sunt dolore fugiat labore cillum ea ipsum qui magna in.

Description

This lecture covers the Bresenham algorithm for line rasterization, explaining how to discretize lines on a pixel grid using incremental updates of decision variables. It also discusses the importance of integer arithmetic in computer graphics and introduces triangle rasterization by computing horizontal spans in each scanline.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructor

excepteur eu

Lorem sint eiusmod eu duis est exercitation deserunt velit. Veniam deserunt eiusmod anim qui adipisicing fugiat consequat nisi. Ex nisi Lorem incididunt exercitation velit commodo qui adipisicing. Ex tempor ea reprehenderit magna minim excepteur. Consequat sunt quis excepteur qui voluptate.

Official source

https://mediaspace.epfl.ch/media/0_44iin8jm

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Computer engineering

Computer graphics: Rendering

Related lectures (32)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.