Convexity preserving interpolatory subdivision with conic precision

From MaRDI portal
Publication:2344696



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 G1 limit curves, reproduces conic sections and respects the convexity properties of the initial data. Significant numerical examples illustrate the effectiveness of the proposed method.




Cites work









This page was built for publication: Convexity preserving interpolatory subdivision with conic precision

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2344696)