Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
The refinability of the four point scheme
Ivrissimtzis I., Dodgson N., Hassan M., Sabin M. Computer Aided Geometric Design19 (4):235-238,2002.Type:Article
Date Reviewed: May 29 2003

The problem of obtaining smooth curves from a set of initial points through introducing new intermediate points is the topic of this paper. Such a technique of subdivision is widely used in modeling and rendering systems. According to the traditional four-point scheme of subdivision, the initial set of points S is extended iteratively, doubling at each step the number of points. Thus, a curve C is obtained.

The authors pose the question whether the initial set S can be interpolated, inserting at each step k new points between any two consecutive points of S, so that the generated curve is again C. They prove that this is only possible when the four-point scheme is applied repeatedly. Therefore, C is not invariant under different refinements of S, except the refinement by one or more steps of the 4-point scheme itself.

The paper may be of theoretical importance for researchers working on curve interpolation.

Reviewer:  Reneta Barneva Review #: CR127677 (0309-0905)
Bookmark and Share
 
Interpolation Formulas (G.1.1 ... )
 
 
Curve, Surface, Solid, And Object Representations (I.3.5 ... )
 
 
Line And Curve Generation (I.3.3 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Interpolation Formulas": Date
Introduction to Shannon sampling and interpolation theory
Robert J. I. (ed), Springer-Verlag New York, Inc., New York, NY, 1991. Type: Book (9780387973913)
Aug 1 1991
Discrete smooth interpolation
Mallet J. ACM Transactions on Graphics (TOG) 8(2): 121-144, 1989. Type: Article
Aug 1 1989
A method for directly finding the denominator values of rational interpolants
Zhu X., Zhu G. Journal of Computational and Applied Mathematics 148(2): 341-348, 2002. Type: Article
Apr 24 2003
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy