Convexity preserving interpolatory subdivision with conic precision
Numerical Analysis
2010-04-09 v1
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 limit curves, reproduces conic sections and respects the convexity properties of the initial data. Significant numerical examples illustrate the effectiveness of the proposed method.
Cite
@article{arxiv.1004.1295,
title = {Convexity preserving interpolatory subdivision with conic precision},
author = {Gudrun Albrecht and Lucia Romani},
journal= {arXiv preprint arXiv:1004.1295},
year = {2010}
}