Paper Info
Title
Massively-parallel vector graphics
Abstract
We present a massively parallel vector graphics rendering pipeline that is divided into two components. The preprocessing component builds a novel adaptive acceleration data structure, the shortcut tree. Tree construction is efficient and parallel at the segment level, enabling dynamic vector graphics. The tree allows efficient random access to the color of individual samples, so the graphics can be warped for special effects. The rendering component processes all samples and pixels in parallel. It was optimized for wide antialiasing filters and a large number of samples per pixel to generate sharp, noise-free images. Our sample scheduler allows pixels with overlapping antialiasing filters to share samples. It groups together samples that can be computed with the same vector operations using little memory or bandwidth. The pipeline is feature-rich, supporting multiple layers of filled paths, each defined by curved outlines (with linear, rational quadratic, and integral cubic Bézier segments), clipped against other paths, and painted with semi-transparent colors, gradients, or textures. We demonstrate renderings of complex vector graphics in state-of-the-art quality and performance. Finally, we provide full source-code for our implementation as well as the input data used in the paper.
Year
DOI
Venue
2014
10.1145/2661229.2661274
ACM Trans. Graph.
Keywords
Field
DocType
display algorithms,parallel processing,rendering,vector graphics
Computer vision,Vector graphics,Raster graphics,Computer graphics (images),2D computer graphics,Graphics pipeline,Computer science,Real-time computer graphics,Artificial intelligence,Software rendering,Rendering (computer graphics),Texture mapping unit
Journal
Volume
Issue
ISSN
33
6
0730-0301
Citations 
PageRank 
References 
2
0.36
31
Authors
4
Name
Order
Citations
PageRank
Francisco Ganacim120.36
Rodolfo S. Lima2593.81
L. H. de Figueiredo3181.81
Diego F. Nehab420.36