Polar Stroking: New Theory and Methods for Stroking Paths

Mark J. Kilgard

Polar stroking supplies a rigorous definition of the interior of a stroked path by taking uniform steps in tangent angle.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Download PDF Read on arXiv ↗

T0 review · grok-4.3

2026-05-24 13:58 UTC

load-bearing objection Abstract flags a real gap in stroking definitions for vector standards and sketches polar stepping as a fix, but supplies zero equations or data to evaluate the claims. the 1 major comments →

arxiv 2007.00308 v4 submitted 2020-07-01 cs.GR

Polar Stroking: New Theory and Methods for Stroking Paths

Mark J. Kilgard This is my paper

classification cs.GR

keywords vector graphicspath strokingtessellationGPU renderingarc length

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

Standards for vector graphics lack a rigorous way to determine which points lie inside a stroked path, relying instead on an informal brush-painting analogy. This paper develops a principled theory of stroking to address that gap. The theory leads to a polar stroking technique that steps along the path using uniform increments in tangent angle. This approach renders stroked paths robustly and provides an intuitive, non-recursive bound on tessellation error. It also enables efficient arc length accumulation for texturing and dashing.

Core claim

Polar stroking, by ensuring small uniform steps in tangent angle, provides both a rigorous inside/outside test for stroked paths and an intuitive way to bound the tessellation error without recursion.

What carries the argument

The polar stroking method based on uniform tangent-angle increments.

Load-bearing premise

Stepping by uniform tangent-angle increments supplies both a rigorous inside/outside test and permits an intuitive non-recursive error bound.

What would settle it

A path and sample point where polar stroking misclassifies the point relative to the stroked region or where the claimed error bound is exceeded.

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

Stroked paths render robustly without recursive subdivision.
Tessellation error receives an intuitive non-recursive bound.
Arc length accumulates efficiently along the path for dashing and texturing.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same stepping rule might extend to related problems such as offset curve computation.
Adoption could reduce rendering differences across graphics libraries that currently follow the brush analogy.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Desk Editor's Note

Abstract flags a real gap in stroking definitions for vector standards and sketches polar stepping as a fix, but supplies zero equations or data to evaluate the claims.

read the letter

This abstract points out that filling paths rests on winding numbers while stroking in PDF, SVG, and PostScript is left to an informal brush analogy, then offers polar stroking as a replacement that steps by uniform tangent angle instead of arc length or distance. The stated advantages are a direct inside/outside test, a non-recursive error bound for tessellation, and cheap arc-length accumulation for dashing or texturing, plus a working GPU implementation. Those are concrete targets that matter for renderer consistency and performance. The problem statement itself is clear and the motivation is grounded in the actual standards. The limitation is obvious and unavoidable here: only the abstract exists. No definitions, no derivation of the tangent-angle test, no error analysis, and no comparison numbers are provided, so there is no way to check whether the polar method actually delivers the promised rigor or whether the error bound is tighter or more intuitive than recursion-based approaches. The central assumption that uniform angle steps give both robustness and an easy bound therefore remains unexamined. Readers who implement or specify vector graphics pipelines would get value from the gap identification even without the solution details. The work is aimed squarely at that subfield. I would send the full paper out for review because the topic is foundational for standards and GPU rendering, provided the derivations and any validation are present in the complete version.

Referee Report

1 major / 0 minor

Summary. The paper claims to fill a gap in vector graphics standards (PDF, SVG, PostScript) by providing a principled theory of stroking paths, which currently rely on an informal brush-painting analogy without rigorous inside/outside tests. Guided by this theory, it introduces a polar stroking method that renders stroked paths robustly, supplies an intuitive non-recursive bound on tessellation error, and enables efficient arc-length accumulation for texturing or dashing. The methods have been implemented on programmable GPUs.

Significance. If the claimed theory and polar stroking construction hold, the work would be significant for computer graphics by supplying the first rigorous foundation for stroking operations, enabling more robust and predictable path rendering in standards and applications.

major comments (1)

The manuscript consists solely of an abstract containing no equations, definitions, derivations, proofs, or validation data. This makes it impossible to verify the central claim that uniform tangent-angle stepping supplies both a rigorous inside/outside test and a non-recursive error bound that matches or exceeds existing standards.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their review and for acknowledging the potential significance of a rigorous theory for stroking. We address the single major comment below.

read point-by-point responses

Referee: The manuscript consists solely of an abstract containing no equations, definitions, derivations, proofs, or validation data. This makes it impossible to verify the central claim that uniform tangent-angle stepping supplies both a rigorous inside/outside test and a non-recursive error bound that matches or exceeds existing standards.

Authors: We agree that the manuscript as provided consists only of the abstract and therefore contains none of the requested equations, definitions, derivations, proofs, or validation data. This prevents verification of the central claims from the supplied text alone. The full paper develops the polar stroking construction with these elements; we will revise the submission to include the complete theory, including the uniform tangent-angle stepping argument, the inside/outside test, the non-recursive error bound, and supporting validation. revision: yes

Circularity Check

0 steps flagged

No circularity detectable from available text

full rationale

The provided abstract contains no equations, derivations, fitted parameters, self-citations, or load-bearing claims that reduce to inputs by construction. It states the existence of a 'principled theory' and 'novel polar stroking method' but supplies no specific steps, definitions, or reductions that could be inspected for self-definitional, fitted-input, or self-citation circularity. Without the full text, no load-bearing chain exists to analyze, so the default finding of no significant circularity applies.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only; no free parameters, axioms, or invented entities are identifiable from the provided text.

pith-pipeline@v0.9.0 · 5660 in / 967 out tokens · 37338 ms · 2026-05-24T13:58:38.653773+00:00 · methodology

0 comments

read the original abstract

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.

discussion (0)

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

Polite But Boring? Trade-offs Between Engagement and Psychological Reactance to Chatbot Feedback Styles
cs.HC 2026-01 unverdicted novelty 6.0

Polite chatbot feedback lowers psychological reactance and boosts behavioral intentions but lacks engagement, whereas verbal leakage heightens surprise and engagement at the expense of increased reactance.