GRCGCVFeb 23, 2023

Adaptive Approximate Implicitization of Planar Parametric Curves via Weak Gradient Constraints

arXiv:2302.11767v11 citationsh-index: 2
Originality Incremental advance
AI Analysis

This work addresses a challenging issue in geometric modeling for applications requiring accurate curve representation, though it appears incremental as it builds on existing methods with specific improvements.

The paper tackles the problem of converting parametric curves to implicit form while preserving geometric features and selecting an appropriate implicit degree, by introducing a weak gradient constraint and adaptive algorithms that achieve effective results in experiments.

Converting a parametric curve into the implicit form, which is called implicitization, has always been a popular but challenging problem in geometric modeling and related applications. However, the existing methods mostly suffer from the problems of maintaining geometric features and choosing a reasonable implicit degree. The present paper has two contributions. We first introduce a new regularization constraint(called the weak gradient constraint) for both polynomial and non-polynomial curves, which efficiently possesses shape preserving. We then propose two adaptive algorithms of approximate implicitization for polynomial and non-polynomial curves respectively, which find the ``optimal'' implicit degree based on the behavior of the weak gradient constraint. More precisely, the idea is gradually increasing the implicit degree, until there is no obvious improvement in the weak gradient loss of the outputs. Experimental results have shown the effectiveness and high quality of our proposed methods.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes