An Accurate Vertex Normal Computation Scheme
There are a number of applications in computer graphics and computer vision that require the accurate estimation of normal vectors at arbitrary vertices on a mesh surface. One common way to obtain a vertex normal over such models is to compute it as a weighted sum of the normals of facets sharing that vertex. But numerical tests and asymptotic analysis indicate that these proposed weighted average algorithms for vertex normal computation are all linear approximations. An open question proposed in [CAGD,17:521-543, 2000] is to find a linear combination scheme of the normals of the triangular faces, based on geometric considerations, that is quadratic convergence in the general mesh case. In this paper, we answer this question in general triangular mesh case. When tested on a few random mesh with valence 4, the scheme proposed by this paper is of second order accuracy, while the existing schemes only provide first order accuracy.
KeywordsNormal Vector Order Accuracy Quadratic Convergence Vertex Angle Darboux Frame
Unable to display preview. Download preview PDF.
- 1.Langer, T., Belyaev, A.G., Seidel, H.P.: Asymptotic Analysis of Discrete Normals and Curvatures of Polylines. In: Juttler, B. (ed.) Spring Conference on Computer Graphics SCCG 2005, pp. 229–232 (2005)Google Scholar
- 2.Langer, T., Belyaev, A.G., Seidel, H.-P.: Analysis and design of discrete normals and curvatures. Research Report MPI-I-2005-4-003, Max-Planck Institut für Informatik (2005)Google Scholar
- 5.Glassner, A.S.: Computing surface normals for 3D models. In: Glassner, A.S. (ed.) Graphics Gems, pp. 562–566. Academic Press, London (1990)Google Scholar
- 8.Max, N.: Weights for computing vertex normals from facet normals. J Graph Tools 4(2), 1–6 (1999)Google Scholar
- 10.Thurmer, G., Wuthrich, C.: Computing vertex normals from polygonal facets. J Graph Tools 3(1), 43–46 (1998)Google Scholar