Computer graphics: principles and practice (2nd ed.)
Computer graphics: principles and practice (2nd ed.)
Curve-drawing algorithms for Raster displays
ACM Transactions on Graphics (TOG)
A linear algorithm for incremental digital display of circular arcs
Communications of the ACM
Introduction to Algorithms
Rendering: Line-Drawing Algorithms for Parallel Machines
IEEE Computer Graphics and Applications
Rendering: Parallelization of Bresenham's Line and Circle Algorithms
IEEE Computer Graphics and Applications
An Efficient Ellipse-Drawing Algorithm
IEEE Computer Graphics and Applications
Algorithm for computer control of a digital plotter
IBM Systems Journal
Study on the positioning of forestry insect pest based on DEM and digital monitoring technique
ICICA'11 Proceedings of the Second international conference on Information Computing and Applications
Hi-index | 0.00 |
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.