Double-step incremental generation of lines and circles

doi:10.1016/0734-189X(87)90041-7

Computer Vision, Graphics, and Image Processing

Volume 37, Issue 3, March 1987, Pages 331-344

Computer Vision, Gra...

https://doi.org/10.1016/0734-189X(87)90041-7 Get rights and content

Abstract

An explicit discussion of the possible speed-up of curve generation due to an increase in the size of increment has not appeared in literature. This paper proposes a methodology and its rationale for scan-converting lines and circles two pixels per iteration. The double-step line and circle algorithms require the same amount of integer arithmetic per iteration as the single-step algorithms but only half the number of iterations. The algorithms take advantage of some simple properties of discrete loci of mathematical curves in the raster plane.

References (15)

M Doros
Algorithms for generation of discrete circles, rings, and disks
Comput. Graphics Image Process.
(1979)
B.K.P Horn
Circle generators for display devices
Comput. Graphics Image Process.
(1976)
Z Kulpa
On the properties of discrete circles, rings and disks
Comput. Graphics Image Process.
(1979)
J Barros et al.
Generating smooth line drawings on video displays
J.E Bresenham
Algorithm for computer control of digital plotter
IBM Syst. J.
(1965)
J.E Bresenham
A linear algorithm for incremental digital display of circular arcs
Comm. ACM
(1977)
J.E Bresenham
Incremental line compaction
Computer J.
(1982)

There are more references available in the full text version of this article.

Cited by (73)

3D framework combining CFD and MATLAB techniques for plume source localization research
2013, Building and Environment
Citation Excerpt :
Measurement noises of the sensors were not considered. Bresenham's algorithm [27] is used to simulate ultrasonic sensors. The virtual environment the robot traveled in is represented by a true colour image generated by the TECPLOT program and obstacles in the image were white in colour.
Sudden release of chemical gas in indoor environments such as office like buildings or industrial warehouses could become hazardous. This has highlighted the need to localize the source of contaminant in least time possible using plume-tracing mobile robots. A simulation framework is outlined for developing, optimizing and testing plume-tracing algorithm in a complex environment. In the first part of the framework, fluid flow process and contaminant transport in a virtual environment is generated by dedicated computational fluid dynamics (CFD) software packages. In the second part of the framework, the exported data of airflow vectors and contaminant concentration from the CFD results is used for the robot to find the source of the contaminant in a three-dimensional search pattern. The virtual robot is built using an in house developed MATLAB code. Several case studies have been addressed at the same complex environment, however at different source locations and source heights as well as at different initial robot start positions. Based on the results, the paper shows the capability of the 3D plume-tracing framework to find the location of the source for strong 3D indoor plumes when tested at different cases.
On covering a digital disc with concentric circles in ℤ<sup>2</sup>
2013, Theoretical Computer Science
Citation Excerpt :
Constructing a digital circle in a computationally efficient way is about half-a-century-old problem, originated during the earliest period of scan-conversion technique [1,6,13,15,18,24,29,38,41]. In later years, several approaches have been suggested for improving the method of circle construction or circle approximation [2,4,7,25,32,35,43,46–48]. Added to this, is the more challenging problem on recognizing circular arcs/objects in digital images, which have several solutions based on characterization and parameterization of circular arcs [10–12,14,16,23,26,30,36,37,39,40].
Digital circles and digital discs satisfy many bizarre anisotropic properties, understanding of which is essential for solving various problems in image analysis and computer graphics. In this paper we study the underlying properties of absentee pixels that appear while covering a digital disc with concentric digital circles. We present, for the first time, a mathematical characterization of these pixels based on number theory and digital geometry. Interestingly, the absentees occur in multitude, and we show that their count varies quadratically with the radius. The notion of infimum parabola and supremum parabola has been used to derive the count of these absentees. Using this parabolic characterization, we derive a necessary and sufficient condition for a pixel to be a disc absentee, and obtain the geometric properties of the absentees. An algorithm to locate the absentees is presented. We show that the ratio of the absentee pixels to the total number of disc pixels approaches a constant with increasing radius. Test results have been furnished to substantiate our theoretical findings.
Generalization of Midpoint Circle Drawing Algorithm in Computer Graphics
2023, AIP Conference Proceedings
Recognition of spherical segments using number theoretic properties of isothetic covers
2023, Multimedia Tools and Applications
Enhancements in Circle Rendering: An Improved Approach to the Midpoint Circle Drawing Algorithm
2023, International Journal of Networked and Distributed Computing
Recognition of Isothetic Arc Using Number Theoretic Properties
2020, International Journal of Image and Graphics

View all citing articles on Scopus

View full text

Double-step incremental generation of lines and circles

Abstract

Comput. Graphics Image Process.

Comput. Graphics Image Process.

Comput. Graphics Image Process.

Generating smooth line drawings on video displays

Algorithm for computer control of digital plotter

IBM Syst. J.

A linear algorithm for incremental digital display of circular arcs

Comm. ACM

Incremental line compaction

Computer J.