A new antialiased line drawing algorithm

檔案

日期

2001-04-01

類型

期刊名稱

COMPUTERS & GRAPHICS-UK

卷期與頁次

第 25 卷第 2 期,頁 187–193

ISSN

0097-8493

語言

英文

摘要

Consider a line f`(x) = mx + b, 0 less than or equal to m less than or equal to 1. Conventional line drawing algorithms sample (x,f(x)) on the line, where x must be an integer, and then map (x,f(x)) to the Frame buffer according to the defined filter and its). In this paper, we propose to simulate a sampled point (x,f(x)) by the four pixels around it where x and f(x) are not necessary to be integers. Based on the proposed low-pass filtering, we show that the effect of sampling at infinite number of points along a line segment can be achieved since the closed Form of the intensities assigned to pixels exists. Furthermore, we show the coherence properties that can reduce the cost for computing these intensities. (C) 2001 Elsevier Science Ltd. All rights reserved.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Chen, B., & Ching, Y. (2001). A new antialiased line drawing algorithm. COMPUTERS & GRAPHICS-UK, 25(2), 187–193. https://doi.org/10.1016/S0097-8493(00)00123-0

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/29750