Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Francisco Ganacim

dblp:59/10802 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2014
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Rendering · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Rendering
antialiasing
0.212014
Massively-parallel vector graphics · ACM Trans. Graph. 2014
Rendering › geometric rendering
vector graphics rendering
0.212014
Massively-parallel vector graphics · ACM Trans. Graph. 2014
Parallel and multicore computing › parallel computing
parallel rendering
0.112014
Massively-parallel vector graphics · ACM Trans. Graph. 2014

Methods — techniques the papers use, named apart from their topics

shortcut tree · 0.4sample scheduler · 0.4adaptive acceleration structure · 0.4
YearPublicationVenuePosition
2014 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.
Francisco Ganacim, Rodolfo S. Lima, Luiz Henrique de Figueiredo, Diego F. Nehab
ACM Trans. Graph.1