Tile binning algorithm for vector graphics minimizing false overlap

Abstract

In this paper, we present an efficient tile binning algorithm that reduces false overlap area for the Bezier curve. To do so, we propose a Multiple-Bounding Box (MBB) enclosing a Bezier curve with multiple bounding boxes. Experimental comparisons of MBB and legacy methods show that the proposed MBB method reduces 16~35% memory overhead. It also reduces 23~54% CPU latency overhead in a tile-based 2D graphics pipeline.