A comparison of local parametric C0 Bézier interpolants for triangular meshes

Parametric curved shape surface schemes interpolating vertices and normals of a given triangular mesh with arbitrary topology are widely used in computer graphics for gaming and real-time rendering due to their ability to effectively represent any surface of arbitrary genus. In this context, continuous curved shape surface schemes using only the information related to the triangle corresponding to the patch under construction, emerged as attractive solutions responding to the requirements of resource-limited hardware environments. In this paper we provide a unifying comparison of the local parametric C^0 curved shape schemes we are aware of, based on a reformulation of their original constructions in terms of polynomial Bezier triangles. With this reformulation we find a geometric interpretation of all the schemes that allows us to analyse their strengths and shortcomings from a geometrical point of view. Further, we compare the four schemes with respect to their computational costs, their reproduction capabilities of analytic surfaces and their response to different surface interrogation methods on arbitrary triangle meshes with a low triangle count that actually occur in their real-world use.

[1]  G. Farin.  Curves and Surfaces for Cagd: A Practical Guide , 2001 .

[2]  Jan Kautz,et al.  Hardware Lighting and Shading: a Survey , 2004, Comput. Graph. Forum.

[3]  Gudrun Albrecht,et al.  Haptic manipulation of rational parametric planar cubics using shape constraints , 2010, SAC '10.

[4]  Jovan Popovic,et al.  Automatic rigging and animation of 3D characters , 2007, ACM Trans. Graph..

[5]  Stephen Mann,et al.  Approximate continuity for parametric Bézier patches , 2007, Symposium on Solid and Physical Modeling.

[6]  Marc Alexa,et al.  Phong Tessellation , 2008, SIGGRAPH Asia '08.

[7]  Gudrun Albrecht,et al.  Géographie des points d'inflexion et des singularités d'une cubique rationnelle , 2008 .

[8]  Steven Collins,et al.  Kinematics, Dynamics, Biomechanics: Evolution of Autonomy in Game Animation , 2005, Comput. Graph. Forum.

[9]  Dereck S. Meek,et al.  A triangular G1 patch from boundary curves , 1996, Comput. Aided Des..

[10]  Tamy Boubekeur,et al.  Scalar Tagged PN Triangles , 2005, Eurographics.

[11]  Jörg Peters,et al.  Curved PN triangles , 2001, I3D '01.

[12]  Anders Hast,et al.  Surface Construction with Near Least Square Acceleration based on Vertex Normals on Triangular Meshes , 2002 .

[13]  Gerald Farin,et al.  SMOOTH INTERPOLATION TO SCATTERED 3D DATA. , 1983 .

[14]  Mateu Sbert,et al.  Specular Effects on the GPU: State of the Art , 2009, Comput. Graph. Forum.

[15]  Steven J. Gortler,et al.  Silhouette Mapping , 1999 .

[16]  Martin Reimers,et al.  Real‐Time GPU Silhouette Refinement using Adaptively Blended Bézier Patches , 2008, Comput. Graph. Forum.

[17]  Takashi Nagata,et al.  Simple local interpolation of surfaces using normal vectors , 2005, Comput. Aided Geom. Des..

[18]  Brian Wyvill,et al.  An algorithm for polygon subdivision based on vertex normals , 1997, Proceedings Computer Graphics International.

[19]  Nadia Magnenat-Thalmann,et al.  The SPHERIGON: a simple polygon patch for smoothing quickly your polygonal meshes , 1998, Proceedings Computer Animation '98 (Cat. No.98EX169).

[20]  Gerald E. Farin,et al.  PNG1 triangles for tangent plane continuous surfaces on the GPU , 2008, Graphics Interface.

[21]  Stephen Mann,et al.  Parametric triangular Bézier surface interpolation with approximate continuity , 2008, SPM '08.

[22]  Brian Wyvill,et al.  Phong normal interpolation revisited , 1997, TOGS.

[23]  Lizhuang Ma,et al.  A Modified Nielson's Side-Vertex Triangular Mesh Interpolation Scheme , 2005, ICCSA.