A non-linear circle-preserving subdivision scheme

被引:19
|
作者
Chalmoviansky, Pavel [1 ]
Juettler, Bert
机构
[1] Austrian Acad Sci, Johann Radon Inst Computat & Appl Math, Linz, Austria
[2] Johannes Kepler Univ Linz, Inst Appl Geometry, Linz, Austria
基金
奥地利科学基金会;
关键词
subdivision techniques; fitting of algebraic curves;
D O I
10.1007/s10444-005-9011-y
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We describe a new method for constructing a sequence of refined polygons, which starts with a sequence of points and associated normals. The newly generated points are sampled from circles which approximate adjacent points and the corresponding normals. By iterating the refinement procedure, we get a limit curve interpolating the data. We show that the limit curve is G(1), and that it reproduces circles. The method is invariant with respect to group of Euclidean similarities (including rigid transformations and scaling). We also discuss an experimental setup for a G(2) construction and various possible extensions of the method.
引用
收藏
页码:375 / 400
页数:26
相关论文
共 50 条