Bresenham's Line and Circle Drawing Algorithm using FPGA

Areej A Ali ,Riyadh Zaghlool Mahmood

doi:10.33899/csmj.2021.170007

Abstract

In Bresenham's line drawing algorithm, the points of an n-dimensional raster that have to be selected are determined forming a close approximation to a straight line existed between two points. It is widely used for drawing line primitives in a bitmap image (for example: on a computer screen), since only integer addition, subtraction and bit shifting are used. These three operations are cheap concerning standard computer architectures. In addition, it is an incremental error algorithm. It is among the oldest algorithms that have been developed in computer graphics. An extension to the original algorithm may lead to draw circles. This research deals with the Bresenham’s line and circle drawing algorithm based on FPGA hardware platform. The shapes on the VGA screen are displayed via internal VGA port that is built in the device.

Highlights

Computer graphics deals with manipulating visual and geometric information adopting techniques of computation
The hardware implementation of the system design was carried out by using Finite State Machine (FSM), where the drawing processes goes through a set of states liable to change from one to another based on the responses to programmed conditions
Bresenham’s algorithm for line and circle drawing, moving, scaling and rotation are implemented using VHDL based on SPARTAN 3E-XC3S500

Summary

Introduction

Computer graphics deals with manipulating visual and geometric information adopting techniques of computation. All scaling, moving, rotation, drawing, coloring and displaying processes were done sequentially at 50MHz frequency successfully.

Objectives

Results

Conclusion