By Topic

On some pel level research problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Pitteway, M. ; Brunel Univ., Uxbridge, UK

The note lists some unsolved research problems concerning line (or edge) drawing algorithms for raster displays which seem to be still outstanding in 1997. Work in progress includes the so called “pixel perfect” speeded up versions of Bresenham's (1965) line drawing algorithm designed to exploit the parallel capabilities of modern display processors. Where should the build up of multi-pixel segments be terminated for optimum performance? The representation of circles, conic sections and other curves, by short, straight line segments or “otherwise” by direct generation at the pixel level: what is the “best” chain code definition? Is it “better” to use four-way or eight-way connected outlines? Can one use “strength reduction” to improve the performance of the algorithms when implemented with modern parallel hardware? How can one best convert between the “real” (floating point) coordinates of a real world model and the integer working required at the pixel level? Finally, how can one best use grey scale when it is available to soften the jaggies which so often spoil the appearance of fount outlines and other objects?

Published in:

Information Visualization, 1997. Proceedings., 1997 IEEE Conference on

Date of Conference:

27-29 Aug 1997