Full metadata record
DC FieldValueLanguage
dc.contributor.authorChen, BCen_US
dc.contributor.authorChing, YTen_US
dc.date.accessioned2014-12-08T15:44:01Z-
dc.date.available2014-12-08T15:44:01Z-
dc.date.issued2001-04-01en_US
dc.identifier.issn0097-8493en_US
dc.identifier.urihttp://dx.doi.org/10.1016/S0097-8493(00)00123-0en_US
dc.identifier.urihttp://hdl.handle.net/11536/29750-
dc.description.abstractConsider 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.isoen_USen_US
dc.subjectcomputer graphicsen_US
dc.subjectline drawing algorithmen_US
dc.subjectantialiasingen_US
dc.titleA new antialiased line drawing algorithmen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/S0097-8493(00)00123-0en_US
dc.identifier.journalCOMPUTERS & GRAPHICS-UKen_US
dc.citation.volume25en_US
dc.citation.issue2en_US
dc.citation.spage187en_US
dc.citation.epage193en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000168177200001-
dc.citation.woscount0-
Appears in Collections:Articles


Files in This Item:

  1. 000168177200001.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.