The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Kami mencadangkan algoritma pengisian garis imbasan yang dioptimumkan untuk grafik vektor dua dimensi OpenVG. Untuk setiap garis imbasan laluan, ia secara adaptif memilih arah pengimbasan kiri atau kanan yang meminimumkan bilangan piksel yang dilawati semasa pengimbasan. Mengikut keputusan percubaan, algoritma yang dicadangkan mengurangkan bilangan piksel yang dilawati sebanyak 6 hingga 37% berbanding dengan itu dengan arah pengimbasan yang berterusan untuk semua garis imbasan.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Daewoong KIM, Kilhyung CHA, Soo-Ik CHAE, "Adaptive Scanline Filling Algorithm for OpenVG 2D Vector Graphics Accelerator" in IEICE TRANSACTIONS on Information,
vol. E92-D, no. 7, pp. 1500-1502, July 2009, doi: 10.1587/transinf.E92.D.1500.
Abstract: We propose an optimized scanline filling algorithm for OpenVG two-dimensional vector graphics. For each scanline of a path, it adaptively selects a left or right scanning direction that minimizes the number of pixels visited during scanning. According to the experimental results, the proposed algorithm reduces the number of pixels visited by 6 to 37% relative to that with a constant scanning direction for all the scanlines.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E92.D.1500/_p
Salinan
@ARTICLE{e92-d_7_1500,
author={Daewoong KIM, Kilhyung CHA, Soo-Ik CHAE, },
journal={IEICE TRANSACTIONS on Information},
title={Adaptive Scanline Filling Algorithm for OpenVG 2D Vector Graphics Accelerator},
year={2009},
volume={E92-D},
number={7},
pages={1500-1502},
abstract={We propose an optimized scanline filling algorithm for OpenVG two-dimensional vector graphics. For each scanline of a path, it adaptively selects a left or right scanning direction that minimizes the number of pixels visited during scanning. According to the experimental results, the proposed algorithm reduces the number of pixels visited by 6 to 37% relative to that with a constant scanning direction for all the scanlines.},
keywords={},
doi={10.1587/transinf.E92.D.1500},
ISSN={1745-1361},
month={July},}
Salinan
TY - JOUR
TI - Adaptive Scanline Filling Algorithm for OpenVG 2D Vector Graphics Accelerator
T2 - IEICE TRANSACTIONS on Information
SP - 1500
EP - 1502
AU - Daewoong KIM
AU - Kilhyung CHA
AU - Soo-Ik CHAE
PY - 2009
DO - 10.1587/transinf.E92.D.1500
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E92-D
IS - 7
JA - IEICE TRANSACTIONS on Information
Y1 - July 2009
AB - We propose an optimized scanline filling algorithm for OpenVG two-dimensional vector graphics. For each scanline of a path, it adaptively selects a left or right scanning direction that minimizes the number of pixels visited during scanning. According to the experimental results, the proposed algorithm reduces the number of pixels visited by 6 to 37% relative to that with a constant scanning direction for all the scanlines.
ER -