Daßler N, Günther T (2026)
Publication Type: Journal article
Publication year: 2026
DOI: 10.1111/cgf.70478
In this paper, we propose a novel local feature extraction algorithm for the parallel vectors (PV) operator. Our method is based on Bézier clipping, which is a bracketing-based root finding method that is commonly-used in computer-aided geometric design. Compared to Bézier bisection, our clipping method exhibits significantly faster convergence and reduces duplicate solutions. Compared to the general Newton-Raphson algorithm, the success of our approach does not depend on the quality of an initial guess. The Bézier-based formulation readily generalizes to polynomial higher-order interpolants, such as for tricubic interpolation. With this, we derive the acceleration in the Sujudi-Haimes vortex coreline criterion directly from the vector field interpolant. In addition, we describe the cross product of two polynomial vector fields in arbitrary polynomial degree, which can be used to approximate non-polynomial interpolants. Further, we examine the effect of Newton refinement on the proposed Bézier clipping method. We evaluate our Bézier clipping method thoroughly on a range of different data sets.
APA:
Daßler, N., & Günther, T. (2026). Parallel Vectors Extraction using Bézier Clipping. Computer Graphics Forum. https://doi.org/10.1111/cgf.70478
MLA:
Daßler, Nico, and Tobias Günther. "Parallel Vectors Extraction using Bézier Clipping." Computer Graphics Forum (2026).
BibTeX: Download