Bresenham Algorithm: Implementation and Analysis in Raster Shape

  title={Bresenham Algorithm: Implementation and Analysis in Raster Shape},
  author={Ford Lumban Gaol},
  journal={J. Comput.},
  • F. Gaol
  • Published 2013
  • Computer Science
  • J. Comput.
One of the most important aspect that have to solve in raster objects is to describe the structure of the individual objects and their coordinate locations within the scene. [] Key Method The implementation will be expanded to display circles and other curves. The analysis will be focus on numerical results, error produced, computation speed, and display. The language that used in this implementation is C++ with OpenGL.

Figures from this paper

Algorithmic support for graphic images rotation in avionics
The comparison of some test images of rotation several algorithms is shown which are being realized mechanically with the program environment Altera QuartusII.
Development of grid projection algorithm of vessel trajectories for e-Navigation
  • Kwang-Il KimJ. JeongG. Park
  • Computer Science
    2014 Joint 7th International Conference on Soft Computing and Intelligent Systems (SCIS) and 15th International Symposium on Advanced Intelligent Systems (ISIS)
  • 2014
This study applies spline interpolation to the vessel trajectories, and develops proper grid projection algorithm using Bresenham's rasterizing algorithm to prepare for e-Navigation process.
TraClets: Harnessing the power of computer vision for trajectory classification
A novel methodology is presented that exploits image representations of trajectories, called TraClets, in order to classify trajectories in an intuitive humans way, through computer vision techniques, acting as a universal, high-accuracy approach for trajectory classification.
Identification of hidden dangers in transmission line corridors based on hybrid algorithms
This paper proposes various algorithms to identify various hidden dangers separately based on their sample size and characteristics of hidden dangers, which achieve acceptable recognition accuracy.
A LiDAR-based technique is attempted that is generic, novel and essentially work with LiDar point data without needing DEM and can be applied for any terrain condition.
Semi-supervised trajectory classification using convolutional auto-encoders
A semi-supervised convolutional autoencoder (CAE) model for trajectory classification which is able to provide high-precision classification of mobility patterns and demonstrated that the vessel activity classification performance can reach an F1-score of over 94%.
A Deep Learning Streaming Methodology for Trajectory Classification
This work presents a novel approach that transforms streaming vessel trajectory patterns into images and employs deep learning algorithms to accurately classify vessel activities in near real time tackling the Big Data challenges of volume and velocity.
Determination of Point-to-Point 3D Routing Algorithm Using LiDAR Data for Noise Prediction
Urban planning, noise propagation modelling, viewshed analysis, etc., require determination of routes or supply lines for propagation. A point-to-point routing algorithm is required to determine the


Rendering curves and surfaces with hybrid subdivision and forward differencing
A Hybrid Rendering Algorithm for rendering parametric curves and surfaces using a series of Direct Rendering Criteria (DRC) for determining whether the curve surface can be directly rendered by forward differencing with a constant step size.
An algorithmic comparison between square- and hexagonal-based grids
Line Drawing Algorithm on an Interleaved Grid
The qualitative and quantitative analyses show that the proposed algorithm outperforms the Bresenham's line drawing algorithm on square grid.
Hexagonal Image Sampling: A Practical Proposition
A case is made for the use of regular hexagonal sampling systems in robot vision applications. With such a sampling technique, neighbouring pixels reside in equidistant shells surrounding the central
Integer forward differencing of cubic polynomials: analysis and algorithms
It is shown that there is one particular family of curves which represents the worst case, in the sense that if a member of this family can be accurately drawn without overflow, then any curve which fits in the bounding box of that curve can be.
Computer graphics—principles and practice
These are the short notes for a two hour tutorial on principles and practice of computer graphics and scientific visualization and they cannot completely replace the contents of the tutorial transparencies and slides since restrictions in space and print quality do not permit the inclusion of figures and example images.
Algorithms of Conic Generation
The published algorithm (Computer Journal 10, 282) behaves badly if the gradient of the curve being plotted changes too sharply, so that two or more changes of octant are called for in the space of a
Drawing lines by uniform packing
Introduction to computer graphics
The best way to get all you can out of your SIGGRAPH week is to start off with a solid understanding of the basics. This course covers the basics of 3D computer graphics in a friendly and visual way,
An alternative approach to circle drawing
This paper presents an alternative approach to drawing circle. The algorithm proposed here draws circle using integer arithmetic only. The number of arithmetic operations required by the proposed