HANDLING EDGE LISTS IN 2D VECTOR GRAPHICS HARDWARE

Abstract

In rendering two-dimensional (2D) vector graphics, edge lists are often so large that their handling hinders the desired operation of portable devices. This paper proposes and evaluates an efficient edge-list handling method for a 2D vector graphics hardware accelerator. The proposed method selects edges that span the next scanline from among those spanning the current scanline and stores them in a small list in the internal memory. An edge list is assigned to each scanline and it stores only those edges that have not appeared in previous edge lists. Given that most active edges span only a few scanlines, the internal list can be small and implemented in the accelerator, whereas the edge lists are held in the external memory. Experimental results show that the proposed method can reduce external memory access by 23.4%–76.6% for the benchmark images considered compared to the prior methods.