Abstract
In this paper, we propose a new search algorithm that reduces the memory bandwidth required for finding active edges in OpenVG rendering. It simultaneously prepares an active edge table for each scanline so that one edge may be stored in several active edge tables, which depends on the lifetime of each edge. It also gives us another benefit so that we can implement the multiple scanline filling in parallel for performance improvement. Experimental results show the external memory accesses of the proposed algorithm can be substantially reduced and the performance of the proposed dual-scanline filling rendering architecture can be significantly increased, especially for high-quality images. We implemented an OpenVG accelerator using the dual-scanline filling rendering with one-poly four-metal 0.18-mum CMOS technology, which requires about 350 K gates and operates at 100 MHz.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
