Abstract
In this paper two subset line properties are introduced; the difference concerns the domain of the end points of the line segments under consideration, viz. Q2 and Z2 respectively. For both properties, a recursive and a nonrecursive algorithm to generate raster line segments are derived. All algorithms use integer arithmetic only. The accuracy of the algorithms in representing lines will be discussed, as well as their time complexity.
| Original language | English |
|---|---|
| Pages (from-to) | 210-228 |
| Number of pages | 19 |
| Journal | Computer Vision, Graphics, and Image Processing |
| Volume | 41 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 1988 |
Fingerprint
Dive into the research topics of 'Line rasterization algorithms that satisfy the subset line property'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver