Algorithm for drawing ellipses or hyperbolae with a digital plotter

Pitteway, M. L. V.

doi:10.1093/comjnl/10.3.282

Cited by 142 publications

(31 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…This incremental technique can be applied to integer computation of circles as well.In [5]a slightly different formulation of Bresenham's algorithm known as the midpoint technique was proposed, which was later adapted by Van Aken [6] and other researchers. Wu and Rokne [7] modified Bresenham's algorithm so that a single decision variable works for 2 pixels and consequently the line drawing time becomes half.…”

Section: Previous Workmentioning

confidence: 99%

An Analysis of Scan Converting a Line with Multi Symmetry

Khairullah¹

2013

IJCA

View full text Add to dashboard Cite

Line is a very important primitive in computer graphics. In this paper we analyze and discussan algorithm that exploits the multi symmetry present in certain line segments during scan conversion.This feature is implemented with the simple technique of direct line equation; digital differentiation analyzer (DDA) algorithm and the floating-point operation free Bresenham's Algorithm. The benefit of exploiting this feature is clearly seen in the test results. Test results also show that by exploiting this feature, execution times of all these algorithms are very close, as the variations in these algorithms work for very small fraction of the line and the rest of the line is simply replicated from this pre-computation.

show abstract

Section: Previous Workmentioning

confidence: 99%

An Analysis of Scan Converting a Line with Multi Symmetry

Khairullah¹

2013

IJCA

View full text Add to dashboard Cite

show abstract

“…For each measured point, the corresponding grid cell is retrieved and a ray-tracing algorithm (Bresenham) is carried out to update all cells from the sensor coordinate system's origin to the measured target point. Several versions of the Bresenham algorithm are described in the literature; in this case we will introduce the 2D version following Pitteway (1967) for reasons of simplicity.…”

Section: Grid-based Fusionmentioning

confidence: 99%

Caroline: An autonomously driving vehicle for urban environments

Rauskolb¹,

Berger²,

Lipski³

et al. 2008

Journal of Field Robotics

View full text Add to dashboard Cite

The 2007 DARPA Urban Challenge afforded the golden opportunity for the Technische Universität Braunschweig to demonstrate its abilities to develop an autonomously driving vehicle to compete with the world's best. After several stages of qualification, our team CarOLO qualified early for the DARPA Urban Challenge Final Event and was among only 11 teams from initially 89 competitors to compete in the final. We had the ability to work together in a large group of experts, each contributing his expertise in his discipline, and significant organizational, financial, and technical support by local sponsors, who helped us to become the best non‐U.S. team. In this report, we describe the 2007 DARPA Urban Challenge, our contribution, “Caroline,” the technology, and algorithms, along with her performance in the DARPA Urban Challenge Final Event on November 3, 2007. © 2008 Wiley Periodicals, Inc.

show abstract

“…The fundamental principle of the generation of nonparametric curves on integer grids has been well described in the literature [12][13][14]. Since a circular curve is a special case of an elliptical curve when both foci coincide, the pixel-tracing algorithm is designed to draw an elliptic curve with its major axis and two foci as initial parameters.…”

Section: Image Reconstruction With Algorithmic Parallelismmentioning

confidence: 99%