Abstract
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.
Partially supported by Natural Science Foundation of China (10371130) and Youth Research Foundation of Central South University.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
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)
Chen, S.G., Wu, J.Y.: Estimating normal vectors and curvatures by centroid weights. Computer Aided Geometric Design 21(5), 447–458 (2004)
Cohen, D., Kaufman, A., Bakalash, R., Bergman, S.: Real-Time Discret hading. The Visual Computer 6(1), 16–27 (1990)
Glassner, A.S.: Computing surface normals for 3D models. In: Glassner, A.S. (ed.) Graphics Gems, pp. 562–566. Academic Press, London (1990)
Gouraud, H.: Continuous shading of curved surfaces. IEEE Transactions on Computers C 20(6), 623–629 (1971)
Jin, S.S., Lewis, R.R., West, D.: A comparison of algorithms for vertex normal computation. The Visual Computer 21, 71–82 (2005)
Max, N.: Weights for computing vertex normals from facet normals. J Graph Tools 4(2), 1–6 (1999)
Meek, D., Walton, D.: On surface normal and Gaussian curvature approximation given data sampled from a smooth surface. Computer-Aided Geometric Design 17, 521–543 (2000)
Thurmer, G., Wuthrich, C.: Computing vertex normals from polygonal facets. J Graph Tools 3(1), 43–46 (1998)
Webber, R.E.: Ray Tracing Voxel Based Data via Biquadratic Local Surfac nterpolation. The Visual Computer 6(1), 8–15 (1990)
Yagel, R., Cohen, D., Kaufman, A.: Discrete Ray Tracing. IEEE Computer Graphics & Applications 12(5), 19–28 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhao, H., Xiao, P. (2006). An Accurate Vertex Normal Computation Scheme. In: Nishita, T., Peng, Q., Seidel, HP. (eds) Advances in Computer Graphics. CGI 2006. Lecture Notes in Computer Science, vol 4035. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11784203_38
Download citation
DOI: https://doi.org/10.1007/11784203_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35638-7
Online ISBN: 978-3-540-35639-4
eBook Packages: Computer ScienceComputer Science (R0)