This paper explores techniques for stroke expansion in vector graphics, focusing on generating the outline of a given input path. While rendering filled paths is common, stroked paths have posed a challenge. The proposed method utilizes a fully parallel algorithm suitable for GPU execution with minimal preprocessing. The output can be line or circular arc segments, optimized for GPU rendering with minimal segment count. Unique techniques include parallel processing of vector graphics primitives and an Euler spiral based method for computing approximations to parallel curves and evolutes. This innovative approach offers solutions to the complexities of stroke expansion in vector graphics.
https://arxiv.org/abs/2405.00127