Computing smooth surface contours with accurate topology

This article introduces a method for accurately computing the visible contours of a smooth 3D surface for stylization. This is a surprisingly difficult problem, and previous methods are prone to topological errors, such as gaps in the outline. Our approach is to generate, for each viewpoint, a new triangle mesh with contours that are topologically equivalent and geometrically close to those of the original smooth surface. The contours of the mesh can then be rendered with exact visibility. The core of the approach is Contour Consistency, a way to prove topological equivalence between the contours of two surfaces. Producing a surface tessellation that satisfies this property is itself challenging; to this end, we introduce a type of triangle that ensures consistency at the contour. We then introduce an iterative mesh generation procedure, based on these ideas. This procedure does not fully guarantee consistency, but errors are not noticeable in our experiments. Our algorithm can operate on any smooth input surface representation; we use Catmull-Clark subdivision surfaces in our implementation. We demonstrate results computing contours of complex 3D objects, on which our method eliminates the contour artifacts of other methods.

[1]  Adam Finkelstein,et al.  Suggestive contours for conveying shape , 2003, ACM Trans. Graph..

[2]  John C. Hart,et al.  Snaxels on a plane , 2011, NPAR '11.

[3]  David Salesin,et al.  Stylized Vector Art from 3D Models with Region Support , 2008, Comput. Graph. Forum.

[4]  Joëlle Thollot,et al.  Active strokes: coherent line stylization for animated 3D models , 2012, NPAR '12.

[5]  Arthur Appel,et al.  The notion of quantitative invisibility and the machine rendering of solids , 1967, ACM National Conference.

[6]  J J Koenderink,et al.  What Does the Occluding Contour Tell Us about Solid Shape? , 1984, Perception.

[7]  Jos Stam,et al.  Exact evaluation of Catmull-Clark subdivision surfaces at arbitrary parameter values , 1998, SIGGRAPH.

[8]  Amy A. Gooch,et al.  Interactive Non-Photorealistic Technical Illustration , 1998 .

[9]  Olivier Devillers,et al.  Fast and Robust Triangle-Triangle Overlap Test Using Orientation Predicates , 2003, J. Graphics, GPU, & Game Tools.

[10]  Adam Finkelstein,et al.  Two Fast Methods for High-Quality Line Visibility , 2010, IEEE Transactions on Visualization and Computer Graphics.

[11]  Frédo Durand,et al.  Programmable rendering of line drawing from 3D scenes , 2010, TOGS.

[12]  J. Blinn A scan line algorithm for displaying parametrically defined surfaces , 1978, SIGGRAPH.

[13]  Lee Markosian,et al.  Artistic silhouettes: a hybrid approach , 2000, NPAR '00.

[14]  Tony DeRose,et al.  Efficient, fair interpolation using Catmull-Clark surfaces , 1993, SIGGRAPH.

[15]  R. K. Smith,et al.  Mesh Smoothing Using A Posteriori Error Estimates , 1997 .

[16]  Tobias Isenberg,et al.  Stylizing Silhouettes at Interactive Rates: 
 From Silhouette Edges to Silhouette Strokes , 2002, Comput. Graph. Forum.

[17]  Gert Vegter,et al.  Computing contour generators of evolving implicit surfaces , 2006, TOGS.

[18]  Aaron Hertzmann,et al.  Illustrating smooth surfaces , 2000, SIGGRAPH.

[19]  Pedro V. Sander,et al.  Simple silhouettes for complex surfaces , 2003 .

[20]  Tamy Boubekeur,et al.  Spatio-temporal analysis for parameterizing animated lines , 2011, NPAR '11.

[21]  Adam Finkelstein,et al.  Coherent stylized silhouettes , 2003, ACM Trans. Graph..

[22]  Gershon Elber,et al.  Hidden curve removal for free form surfaces , 1990, SIGGRAPH.

[23]  David Salesin,et al.  Rendering parametric surfaces in pen and ink , 1996, SIGGRAPH.

[24]  Pierre Alliez,et al.  Periodic global parameterization , 2006, TOGS.

[25]  Takafumi Saito,et al.  Comprehensible rendering of 3-D shapes , 1990, SIGGRAPH.

[26]  Aaron Hertzmann,et al.  Introduction to 3D Non-Photorealistic Rendering: Silhouettes and Outlines , 1999 .

[27]  John Hart,et al.  ACM Transactions on Graphics , 2004, SIGGRAPH 2004.

[28]  Lee Markosian,et al.  Real-time nonphotorealistic rendering , 1997, SIGGRAPH.

[29]  Arne Dür,et al.  A Practical List-Priority Algorithm for 3D Polygons , 2003, J. Graphics, GPU, & Game Tools.

[30]  E. Catmull,et al.  Recursively generated B-spline surfaces on arbitrary topological meshes , 1978 .