Deducing interpolating subdivision schemes from approximating subdivision schemes

Abstract

In this paper we describe a method for directly deducing new interpolating subdivision masks for meshes from corresponding approximating subdivision masks. The purpose is to avoid complex computation for producing interpolating subdivision masks on extraordinary vertices. The method can be applied to produce new interpolating subdivision schemes, solve some limitations in existing interpolating subdivision schemes and satisfy some application needs. As cases, in this paper a new interpolating subdivision scheme for polygonal meshes is produced by deducing from the Catmull-Clark subdivision scheme. It can directly operate on polygonal meshes, which solves the limitation of Kobbelt's interpolating subdivision scheme. A new √3 interpolating subdivision scheme for triangle meshes and a new √2 interpolating subdivision scheme for quadrilateral meshes are also presented in the paper by deducing from √3 subdivision schemes and 4-8 subdivision schemes respectively. They both produce C 1 continuous limit surfaces and avoid the blemish in the existing interpolating √3 and √2 subdivision masks where the weight coefficients on extraordinary vertices can not be described by formulation explicitly. In addition, by adding a parameter to control the transition from approximation to interpolation, they can produce surfaces intervening between approximating and interpolating which can be used to solve the "popping effect" problem when switching between meshes at different levels of resolution. They can also force surfaces to interpolate chosen vertices.