By Topic

Fast polygon scan conversion with medical applications

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

3 Author(s)
Gordon, D. ; Dept. of Math. & Comput. Sci., Haifa Univ., Israel ; Peterson, M.A. ; Reynolds, R.A.

The algorithm presented for polygon scan conversion is very fast and can replace the standard version in any application. Special requirements from medical data sets illustrate its practicality and versatility. The polygon scan conversion problem refers to filling the interior of a region represented by one or more polygons. The polygons are represented by the coordinates of their vertices in cyclic order. This problem shows up in many areas of computer graphics. The standard approach to polygon scan conversion creates two data structures, an edge table and an active edge table (AET). The edge table contains a bucket for each scan line. Each bucket consists of a linked list containing all the edges starting on that scan line (or straddling it for the first time). Creation of the edge table is an image-space step, since it depends on the number of scan lines existing in image space (that is, on the resolution of the target display device). In this respect, it is a device-dependent step. The algorithm we develop uses only an object-space data structure instead of the edge table and is therefore less device dependent. In particular, it is suitable for both raster and vector graphics devices.<>

Published in:

Computer Graphics and Applications, IEEE  (Volume:14 ,  Issue: 6 )