Pixel-Level Algorithms for Drawing Curves

Simple item page
dc.contributor.authorLiu, Yong Kuien_US
dc.contributor.authorWang, Peng Jieen_US
dc.contributor.authorZhao, Dan Danen_US
dc.contributor.authorSpelic, Denisen_US
dc.contributor.authorMongus, Domenen_US
dc.contributor.authorZalik, Boruten_US
dc.contributor.editorIan Grimstead and Hamish Carren_US
dc.date.accessioned2013-10-31T10:30:52Z
dc.date.available2013-10-31T10:30:52Z
dc.date.issued2011en_US
dc.description.abstractThis paper introduces new pixel level algorithms for parametric curves. The optimal value of the steps is first derived when rastrerizing parametric curves. A double-step algorithm using only integer arithmetic is presented to minimize the problem of oversampling. The algorithms for parametric curves have been implemented also on GPU. Through experiments we confirmed that the performance of this new algorithm is superior to previous algorithms.en_US
dc.description.seriesinformationTheory and Practice of Computer Graphicsen_US
dc.identifier.isbn978-3-905673-83-8en_US
dc.identifier.urihttps://doi.org/10.2312/LocalChapterEvents/TPCG/TPCG11/033-040en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectKeywords: computing; curves; pixels; rasterization;GPUen_US
dc.titlePixel-Level Algorithms for Drawing Curvesen_US
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
033-040.pdf
Size:
112.74 KB
Format:
Adobe Portable Document Format
Download
Collections
EG UK Theory and Practice of Computer Graphics 2011