完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Chen, BC | en_US |
dc.contributor.author | Ching, YT | en_US |
dc.date.accessioned | 2014-12-08T15:44:01Z | - |
dc.date.available | 2014-12-08T15:44:01Z | - |
dc.date.issued | 2001-04-01 | en_US |
dc.identifier.issn | 0097-8493 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1016/S0097-8493(00)00123-0 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/29750 | - |
dc.description.abstract | 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. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | computer graphics | en_US |
dc.subject | line drawing algorithm | en_US |
dc.subject | antialiasing | en_US |
dc.title | A new antialiased line drawing algorithm | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1016/S0097-8493(00)00123-0 | en_US |
dc.identifier.journal | COMPUTERS & GRAPHICS-UK | en_US |
dc.citation.volume | 25 | en_US |
dc.citation.issue | 2 | en_US |
dc.citation.spage | 187 | en_US |
dc.citation.epage | 193 | en_US |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | Department of Computer Science | en_US |
dc.identifier.wosnumber | WOS:000168177200001 | - |
dc.citation.woscount | 0 | - |
顯示於類別: | 期刊論文 |