A geometric look at corner cutting

Abstract In this paper we consider conrner cutting and convexity preserving interpolatory refinement schemes in the plane and on the sphere. Using well-known facts from projective geometry we present a unified approach to such schemes and geometric derivations of simple conditions which guarantee that a scheme generates C1-curves. Our results generalize all of the results known so far and provide the ground for a new convexity preserving C1-interpolation scheme with a simple direct shape handle.

[1]  John A. Gregory,et al.  Nonuniform corner cutting , 1996, Comput. Aided Geom. Des..

[2]  George Merrill Chaikin,et al.  An algorithm for high-speed curve generation , 1974, Comput. Graph. Image Process..

[3]  Jesús M. Carnicer,et al.  Dual Bézier curves and convexity preserving interpolation , 1992, Comput. Aided Geom. Des..

[4]  Charles A. Micchelli,et al.  Computing surfaces invariant under subdivision , 1987, Comput. Aided Geom. Des..

[5]  J. Stillwell,et al.  Plane Algebraic Curves , 1986 .

[6]  Wolfgang Böhm,et al.  Geometric concepts for geometric design , 1993 .

[7]  Carl de Boor,et al.  Local corner cutting and the smoothness of the limiting curve , 1990, Computer Aided Geometric Design.

[8]  Nira Dyn,et al.  Interpolatory convexity-preserving subdivision schemes for curves and surfaces , 1992, Comput. Aided Des..

[9]  Florencio I. Utreras,et al.  Convexity-preserving interpolatory subdivision , 1994, Comput. Aided Geom. Des..

[10]  D. Hilbert,et al.  Geometry and the Imagination , 1953 .