Title: Straight lines: a step by step method
Authors: Chalopin, François-Pierre
Bourdin, Jean-Jacques
Citation: Journal of WSCG. 1996, vol. 4, no. 1-2, p. 41-46.
Issue Date: 1996
Publisher: Václav Skala - UNION Agency
Document type: článek
article
URI: http://wscg.zcu.cz/wscg1996/wscg96.htm#abs
http://hdl.handle.net/11025/15987
ISSN: 1213-6972 (print)
1213-6980 (CD-ROM)
1213-6964 (online)
Keywords: algoritmy;počítačová grafika;linkové generátory
Keywords in different language: algorithms;computer graphics;line generators
Abstract in different language: Drawing straight lines is a major field in computer graphics. Most methods are improvements of the Discrete Differential Analysis method first presented by Bresenham [1]. Combinatory analysis method, as presented by Castle [2] or Dulucq [3] or Berstel [4] are not commonly used: they imply multiple string copies and are therefore slow. A new approach, combining combinatory analysis and DDA is presented. The DDA does not apply to each point but to a step computed by combinatory method. This algorithm is tested and proves to be more than four time faster than Bresenham´s algorithm.
Rights: © Václav Skala - UNION Agency
Appears in Collections:Volume 4, number 1-2 (1996)

Files in This Item:
File Description SizeFormat 
Chalopin_96.pdfPlný text620,32 kBAdobe PDFView/Open


Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/15987

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.