Abstract
There are a number of applications in computer graphics that require as a first step the accurate estimation of principal direction vectors at arbitrary vertices on a triangulated surface. Although several methods for calculating principal directions over such models have been previously proposed, we have found in practice that all exhibit unexplained large errors in some cases. In this article, we describe our theoretical and experimental investigations into possible sources of errors in the approximation of principal direction vectors from triangular meshes, and suggest a new method for estimating principal directions that can yield better results under some circumstances.
Supplemental Material
Available for Download
Detailed results tables
- Chen, X. and Schmitt, F. 1992. Intrinsic surface properties from surface triangulation. In Proceedings, European Conference on Computer Vision. 739--743. Google Scholar
- Diewald, U., Preuβer, T., and Rumpf, M. 2000. Anisotropic diffusion in vector field visualization on euclidean domains and surfaces. IEEE Trans. Visual. Comput. Graph. 6, 1 (Apr./June), 139--149. Google Scholar
- Duncan, B. and Olson, A. 1992. Shape analysis of protein surfaces. J. Mol. Graph. 10, 1 (Mar.), 50.Google Scholar
- Flynn, P. J. and Jain, A. K. 1989. On reliable curvature estimation. In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. 110--116.Google Scholar
- Girshick, A., Interrante, V., Haker, S., and Lemoine, T. 2000. Line direction matters: an argument for the use of principal directions in line drawings. In Proceedings of the 1st International Symposium on Non Photorealistic Animation and Rendering (Annecy), 43--52. Google Scholar
- Gorla, G., Interrante, V., and Sapiro, G. 2003. Texture synthesis for 3d shape representation. IEEE Trans. Visual. Comput. Graph. 9, 4 (Oct./Dec.), 512--524. Google Scholar
- Hahmann, S. 1999. Visualization techniques for surface analysis. In Advanced Visualization Techniques, C. Bajaj, Ed. Wiley, New York.Google Scholar
- Hamann, B. 1994. Curvature approximation of 3d manifolds in 4d space. Comput. Aid. Geomet. Des. 11, 6, 621--632. Google Scholar
- Hertzmann, A. and Zorin, D. 2000. Illustrating smooth surfaces. In Siggraph 2000, Computer Graphics Proceedings, K. Akeley, Ed. ACM Press/ACM SIGGRAPH/Addison Wesley Longman, 517--526. Google Scholar
- Interrante, V. L. 1997. Illustrating surface shape in volume data via principal direction-driven 3D line integral convolution. Comput. Graph. 31, Annual Conference Series, 109--116. Google Scholar
- Meyer, M., Desbrun, M., Schröder, P., and Barr, A. H. 2003. Discrete differential-geometry operators for triangulated 2-manifolds. In Visualization and Mathematics III, H.-C. Hege and K. Polthier, Eds. Springer-Verlag, Heidelberg, Germany, 35--57.Google Scholar
- Samson, P. and Mallet, J.-L. 1997. Curvature analysis of triangulated surfaces in structural geology. Math. Geol. 29, 3 (Apr.), 391--412.Google Scholar
- Takashi Maekawa, F.-E. W., and Patrikalakis, N. M. 1996. Umbilics and lines of curvature for shape interrogation. Comput. Aid. Geomet. Des. 13, 2 (Mar.), 133--161. Google Scholar
- Taubin, G. 1995. Estimating the tensor of curvature of a surface from a polyhedral approximation. In Proceedings of the 5th International Conference on Computer Vision. 902--907. Google Scholar
Index Terms
- A novel cubic-order algorithm for approximating principal direction vectors
Recommendations
A Direction Constrained Eigenspace-Based Beamforming Algorithm
NSWCTC '10: Proceedings of the 2010 Second International Conference on Networks Security, Wireless Communications and Trusted Computing - Volume 01The eigenspace-based (ESB) beamformer demonstrates much more robust capabilities than the minimum variance distortionless (MVDR) beamformer. However, when the pointing error falls in some certain positions near the mainlobe edge or the integer times of ...
Fast algorithm for minimum-norm direction-of-arrival estimation
The original minimum-norm direction-of-arrival estimator, proposed by Kumaresan and Tufts, employs the noise-subspace projection matrix, calculated by the eigendecomposition of spatial covariance matrix. The present authors propose a novel ...
Two-Dimensional Direction of Arrival Estimation Using Generalized ESPRIT Algorithm with Non-uniform L-Shaped Array
The aim of this study is to solve the problem of two-dimensional direction of arrival (2D-DOA) estimation for non-uniform L-shaped array by employing generalized ESPRIT (GESPRIT) algorithm. GESPRIT algorithm can be seen as an extension of conventional ...
Comments