Polar Stroking: New Theory and Methods for Stroking Paths

07/01/2020
by   Mark J. Kilgard, et al.
0

Stroking and filling are the two basic rendering operations on paths in vector graphics. The theory of filling 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. This 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 fills 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 efficient 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.

READ FULL TEXT

page 1

page 15

research
07/23/2020

Anecdotal Survey of Variations in Path Stroking among Real-world Implementations

Stroking a path is one of the two basic rendering operations in vector g...
research
07/03/2020

Ordinary Facet Angles of a Stroked Path Tessellated by Uniform Tangent Angle Steps Are Bounded by Twice the Step Angle

We explain geometrically why ordinary facet angles of a stroked path tes...
research
10/10/2018

Cluster Pairwise Error Probability and Construction of Parity-Check-Concatenated Polar Codes

A successive cancellation list (SCL) decoder with limited list size for ...
research
11/20/2020

Progressive Rate-Filling: A Framework for Agile Construction of Multilevel Polar-Coded Modulation

In this letter, we propose a progressive rate-filling method as a framew...
research
12/06/2017

On Path Memory in List Successive Cancellation Decoder of Polar Codes

Polar code is a breakthrough in coding theory. Using list successive can...
research
07/30/2020

Down-step statistics in generalized Dyck paths

The number of down-steps between pairs of up-steps in k_t-Dyck paths, a ...
research
08/26/2019

From sequential decoding to channel polarization and back again

This note is a written and extended version of the Shannon Lecture I gav...

Please sign up or login with your details

Forgot password? Click here to reset