Massively-parallel vector graphics

Ganacim, Francisco; Lima, Rodolfo S.; Figueiredo, Luiz Henrique de; Nehab, Diego

doi:10.1145/2661229.2661274

Cited by 15 publications

(14 citation statements)

References 45 publications

(56 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We attribute this to forcing use of NVIDIA's dual-core driver and Illustrator's tuned OpenGL usage and scene traversal. For all but two of scenes in our table, GPU-accelerated Illustrator is faster than their published results-the exceptions are a detailed but in- Table 6: Comparison of SVG content render times (in milliseconds) reported by [Ganacim et al 2014] to our work with Illustrator.…”

Section: Benchmarking Cmyk Artworkmentioning

confidence: 81%

“…So while the framebuffer memory consumption for CMYK is at least double the storage for RGB color mode rendering, the observed performance cost is not nearly so bad and is still much faster than CMYK rendering on the CPU. [Ganacim et al 2014] provides performance results for a number of SVG scenes using a massively-parallel vector graphics (MPVG) system based on CUDA. Table 6 presents a subset of their scenes most relevant to an Illustrator artist with results from our comparable PC configuration.…”

Section: Benchmarking Cmyk Artworkmentioning

confidence: 99%

See 1 more Smart Citation

Accelerating vector graphics rendering using the graphics hardware pipeline

Batra

Kilgard²,

Kumar

et al. 2015

ACM Trans. Graph.

View full text Add to dashboard Cite

Figure 1: Five complex RGB and CMYK documents GPU-rendered by Illustrator CC; all rendered with "GPU Preview" enabled. AbstractWe describe our successful initiative to accelerate Adobe Illustrator with the graphics hardware pipeline of modern GPUs. Relying on OpenGL 4.4 plus recent OpenGL extensions for advanced blend modes and first-class GPU-accelerated path rendering, we accelerate the Adobe Graphics Model (AGM) layer responsible for rendering sophisticated Illustrator scenes. Illustrator documents render in either an RGB or CMYK color mode. While GPUs are designed and optimized for RGB rendering, we orchestrate OpenGL rendering of vector content in the proper CMYK color space and accommodate the 5+ color components required. We support both non-isolated and isolated transparency groups, knockout, patterns, and arbitrary path clipping. We harness GPU tessellation to shade paths smoothly with gradient meshes. We do all this and render complex Illustrator scenes 2 to 6x faster than CPU rendering at Full HD resolutions; and 5 to 16x faster at Ultra HD resolutions.

show abstract

Section: Benchmarking Cmyk Artworkmentioning

confidence: 81%

Section: Benchmarking Cmyk Artworkmentioning

confidence: 99%

Accelerating vector graphics rendering using the graphics hardware pipeline

Batra

Kilgard²,

Kumar

et al. 2015

ACM Trans. Graph.

View full text Add to dashboard Cite

show abstract

“…e description of the stroke operator by Gosling et al (1989) indicates that early on, stroking was implemented by generating a llable region corresponding to the stroked region of a path and then drawing that derived llable region. Other recent path rendering systems explicitly state they take this approach (Dokter et al 2019;Ganacim et al 2014;Li et al 2016).…”

Section: Render a Filled Region Approximating The Stroked Regionmentioning

confidence: 99%

Polar stroking

Kilgard¹

2020

ACM Trans. Graph.

View full text Add to dashboard Cite

Fig. 1. Polar stroking samples: A cubic Bézier segment with a cusp rendered properly with polar stroking while uniform parametric tessellation has no cusp, both using 134 triangles; B polar stroking improves the facet angles distribution compared to uniform tessellation, both using 126 triangles; C arc length texturing; D ellipse drawn as just 2 conic segments, one external; E complex cubic Bézier path (5,031 path commands, 29,058 scalar path coordinates) with cumulative arc length texturing; F centripetal Catmull-Rom spline. Stroking and lling are the two basic rendering operations on paths in vector graphics. e theory of lling a path is well-understood in terms of contour integrals and winding numbers, but when path rendering standards specify stroking, they resort to the analogy of painting pixels with a brush that traces the outline of the path. is means important standards such as PDF, SVG, and PostScript lack a rigorous way to say what samples are inside or outside a stroked path. Our work lls this gap with a principled theory of stroking. Guided by our theory, we develop a novel polar stroking method to render stroked paths robustly with an intuitive way to bound the tessellation error without needing recursion. Because polar stroking guarantees small uniform steps in tangent angle, it provides an e cient way to accumulate arc length along a path for texturing or dashing. While this paper focuses on developing the theory of our polar stroking method, we have successfully implemented our methods on modern programmable GPUs.

show abstract

“…Shortcut trees [GLdFN14] allow efficient indexing into vector graphics. They can be built on the GPU and support cubic curves by monotonizing curve segments.…”

Section: Related Workmentioning

confidence: 99%

Hierarchical Rasterization of Curved Primitives for Vector Graphics Rendering on the GPU

Dokter

Hladky

Parger

et al. 2019

Computer Graphics Forum

View full text Add to dashboard Cite

In this paper, we introduce the CPatch, a curved primitive that can be used to construct arbitrary vector graphics. A CPatch is a generalization of a 2D polygon: Any number of curves up to a cubic degree bound a primitive. We show that a CPatch can be rasterized efficiently in a hierarchical manner on the GPU, locally discarding irrelevant portions of the curves. Our rasterizer is fast and scalable, works on all patches in parallel, and does not require any approximations. We show a parallel implementation of our rasterizer, which naturally supports all kinds of color spaces, blending and super‐sampling. Additionally, we show how vector graphics input can efficiently be converted to a CPatch representation, solving challenges like patch self intersections and false inside‐outside classification. Results indicate that our approach is faster than the state‐of‐the‐art, more flexible and could potentially be implemented in hardware.

show abstract

Massively-parallel vector graphics

Cited by 15 publications

References 45 publications

Accelerating vector graphics rendering using the graphics hardware pipeline

Accelerating vector graphics rendering using the graphics hardware pipeline

Polar stroking

Hierarchical Rasterization of Curved Primitives for Vector Graphics Rendering on the GPU

Contact Info

Product

Resources

About