Convexity preserving interpolatory subdivision with conic precision
classification
🧮 math.NA
cs.NA
keywords
subdivisionconicconvexitydatainterpolatorypreservingalgorithmarbitrarily
read the original abstract
The paper is concerned with the problem of shape preserving interpolatory subdivision. For arbitrarily spaced, planar input data an efficient non-linear subdivision algorithm is presented that results in $G^1$ limit curves, reproduces conic sections and respects the convexity properties of the initial data. Significant numerical examples illustrate the effectiveness of the proposed method.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.