Bresenham's Line Drawing Algorithm Research Articles

Clock Skew Compensation Algorithm Immune to Floating-Point Precision Loss

We propose a novel clock skew compensation algorithm based on Bresenham's line drawing algorithm. The proposed algorithm can avoid the effect of limited floating-point precision (e.g., 32-bit single precision) on clock skew compensation and thereby provide high-precision time synchronization even with resource-constrained sensor nodes in wireless sensor networks.

Bresenham's Line and Circle Drawing Algorithm using FPGA

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.

POLYGONAL APPROXIMATION OF DIGITAL CURVE BASED ON REVERSE ENGINEERING CONCEPT

This paper applies reverse engineering on the Bresenham's line drawing algorithm [J. E. Bresenham, IBM System Journal, 4, 106–111 (1965)] for polygonal approximation of digital curve. The proposed method has a number of features, namely, it is sequential and runs in linear time, produces symmetric approximation from symmetric digital curve, is an automatic algorithm and the approximating polygon has the least non-zero approximation error as compared to other algorithms.

Line Drawing Algorithm on an Interleaved Grid

paper Bresenham's line drawing algorithm on interleaved grid is proposed. It uses the advantages of interleaved sampling to scan-convert the pixel on the raster with less representation error. The performance of the proposed algorithm is compared with the conventional Bresenham's algorithm on square grid. The qualitative and quantitative analyses show that the proposed algorithm outperforms the Bresenham's line drawing algorithm on square grid.

Drawing lines by uniform packing

In this paper, we introduce a new approach to line drawing that attempts to maintain a uniform packing density of horizontal segments to diagonal segments throughout the line. While the conventional line drawing algorithms perform linear time computations to find the location of the pixels, our algorithm takes logarithmic time. Also, experimental results show that the quality of line is acceptable and comparable to the well-known Bresenham's line-drawing algorithm.

Design and Performance Evaluation of EXMAN: An EXtended MANchester Data Flow Computer

Data flow computers are high-speed machines in which an instruction is executed as soon as all its operands are available. This paper describes the EXtended MANchester (EXMAN) data flow computer which incorporates three major extensions to the basic Manchester machine. As extensions we provide a multiple matching units scheme, an efficient, implementation of array data structure, and a facility to concurrently execute reentrant routines. A simulator for the EXMAN computer has been coded in the discrete event simulation language, SIMULA 67, on the DEC 1090 system. Performance analysis studies have been conducted on the simulated EXMAN computer to study the effectiveness of the proposed extensions. The performance experiments have been carried out using three sample problems: matrix multiplication, Bresenham's line drawing algorithm, and the polygon scan-conversion algorithm.

Incremental linear interpolation

Two incremental linear interpolation algorithms are derived and analyzed for speed and accuracy. The first is a version of a “simple” digital differential analyzer (DDA) employing fixed-point arithmetic, whereas the second is a new algorithm that uses only integral arithmetic and is a generalization of Bresenham's line-drawing algorithm. The new algorithm is shown to achieve perfect accuracy and, depending on the underlying processor, may be faster than the fixed-point algorithm.