Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
Xiaolin Wu's Line Algorithm
CHF 34.35
Auf Lager
SKU
27762UOOPDD
1 Verfügbar 
Geliefert zwischen Mi., 25.02.2026 und Do., 26.02.2026
Details
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Xiaolin Wu''s line algorithm is an algorithm for line antialiasing, which was presented in the article An Efficient Antialiasing Technique in the July 1991 issue of Computer Graphics, as well as in the article Fast Antialiasing in the June 1992 issue of Dr. Dobb''s Journal. Bresenham''s algorithm draws lines extremely quickly, but it does not perform anti-aliasing. In addition, it cannot handle the case where the line endpoints do not lie exactly on integer points of the pixel grid. A naïve approach to anti-aliasing the line would take an extremely long time, but Wu''s algorithm is quite fast (it is still slower than Bresenham''s, though). The basis of the algorithm is to draw pairs of pixels straddling the line, coloured according to proximity. Pixels at the line ends are handled separately. Lines less than one pixel long should be handled as a special case.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786131042515
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- Größe H220mm x B220mm
- EAN 9786131042515
- Format Fachbuch
- Titel Xiaolin Wu's Line Algorithm
- Herausgeber Betascript Publishing
- Anzahl Seiten 88
- Genre Informatik
Bewertungen
Schreiben Sie eine Bewertung
