×

Gauss map computation for free-form surfaces. (English) Zbl 0984.68162

Summary: The Gauss map of a smooth doubly-curved surface characterizes the range of variation of the surface normal as an area on the unit sphere. An algorithm to approximate the Gauss map boundary to any desired accuracy is presented, in the context of a tensor-product polynomial surface patch, \(r(u,v)\) for \((u,v)\in[0,1]\times[0,1]\). Boundary segments of the Gauss map correspond to variations of the normal along the patch boundary or the parabolic lines (loci of vanishing Gaussian curvature) on the surface. To compute the latter, points of vanishing Gaussian curvature are identified with the zero-set of a bivariate polynomial, expressed in the numerically-stable Bernstein basis—the subdivision and variation-diminishing properties then govern an adaptive quadtree decomposition of the \((u,v)\) parameter domain that captures the zero-set of this polynomial to any desired accuracy. Loci on the unit sphere corresponding to the patch boundaries and parabolic lines are trimmed at their mutual or self-intersection points (if any), and the resulting segments are arranged in a graph structure with the segment end-points as nodes. By appropriate traversal of this graph, the Gauss map boundary segments may then be identified in proper order, and extraneous segments (lying in the Gauss map interior) are discarded. The symmetrization of the Gauss map (by identification of antipodal points) and its stereographic projection onto a plane are also discussed.

MSC:

68U05 Computer graphics; computational geometry (digital and algorithmic aspects)
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Banchoff, T.; Gaffney, T.; McCrory, C., Cusps of Gauss Mappings (1982), Putnam: Putnam Boston
[2] Berchtold, J.; Bowyer, A., Robust arithmetic for multivariate Bernstein-form polynomials, Computer-Aided Design, 32, 681-689 (2000) · Zbl 1206.65268
[3] Berkmann, J.; Caelli, T., Computation of surface geometry and segmentation using covariance techniques, IEEE Transactions on Pattern Analysis and Machine Intelligence, 16, 1114-1116 (1994)
[4] Blaschke, W., Vorlesungen über Differential Geometrie (1930), Chelsea: Chelsea New York, Reprint
[5] Brou, P., Using the Gaussian image to find the orientation of objects, Internat. J. Robotics Res., 3, 89-125 (1984)
[6] Bruce, J. W.; Giblin, P. J.; Tari, E., Parabolic curves of evolving surfaces, Internat. J. Comput. Vision, 17, 291-306 (1996)
[7] Chen, Y.; Ravani, B., Offset surface generation and contouring in computer-aided design, ASME J. Mechanisms, Transmissions, and Automation in Design, 109, 1, 133-142 (1987)
[8] Chen, L.-L.; Woo, T. C., Computational geometry on the sphere with application to automated machining, ASME J. Mech. Design, 114, 288-295 (1992)
[9] Cipolla, R.; Giblin, P., Visual Motion of Curves and Surfaces (2000), Cambridge Univ. Press · Zbl 1007.68001
[10] do Carmo, M. P., Differential Geometry of Curves and Surfaces (1976), Prentice-Hall: Prentice-Hall Englewood Cliffs, NJ · Zbl 0326.53001
[11] Eisenhart, L. P., An Introduction to Differential Geometry (1947), Princeton University Press
[12] Elber, G.; Zussman, E., Cone visibility decomposition of free-form surfaces, Computer-Aided Design, 30, 315-320 (1998) · Zbl 1084.68912
[13] Farin, G., Curves and Surfaces for Computer Aided Geometric Design (1993), Academic Press: Academic Press Boston
[14] Farouki, R. T.; Neff, C. A., On the numerical condition of Bernstein-Bézier subdivision processes, Mathematics of Computation, 55, 637-647 (1990) · Zbl 0749.65008
[15] Farouki, R. T.; Rajan, V. T., Algorithms for polynomials in Bernstein form, Computer Aided Geometric Design, 5, 1-26 (1988) · Zbl 0648.65007
[16] Farouki, R. T.; Tsai, Y.-F.; Yuan, G.-F., Contour machining of free-form surfaces with real-time PH curve interpolators, Computer Aided Geometric Design, 16, 61-76 (1999) · Zbl 0908.68175
[17] Gan, J. G.; Woo, T. C.; Tang, K., Spherical maps: construction, properties, and approximation, ASME J. Mech. Design, 116, 357-363 (1994)
[18] Hilbert, D.; Cohn-Vossen, S., Geometry and the Imagination (1952), Chelsea: Chelsea New York · Zbl 0047.38806
[19] Horn, B. K.P., Extended Gaussian images, Proc. IEEE, 72, 1671-1686 (1984)
[20] Kaul, A.; Farouki, R. T., Computing Minkowski sums of plane curves, Internat. J. Comput. Geom. Appl., 5, 413-432 (1995) · Zbl 0854.68102
[21] Kaul, A.; Rossignac, J. R., Solid interpolating deformations: construction and animation of PIP, Computers and Graphics, 16, 107-115 (1992)
[22] Liang, P.; Taubes, C. H., Orientation-based differential geometric representations for computer vision applications, IEEE Transactions on Pattern Analysis and Machine Intelligence, 16, 249-258 (1997) · Zbl 0801.68172
[23] Preparata, F. P.; Shamos, M. I., Computational Geometry (1985), Springer-Verlag: Springer-Verlag New York · Zbl 0759.68037
[24] Samet, H., Neighbour finding techniques for images represented by quadtrees, Computer Graphics and Image Processing, 18, 37-57 (1982) · Zbl 0531.68041
[25] Samet, H., Hierarchical data structures and algorithms for computer graphics. I. Fundamentals, IEEE Computer Graphics and Applications, 8, 3, 48-68 (1988)
[26] Schwerdtfeger, H., Geometry of Complex Numbers (1979), Dover: Dover New York
[27] Smith, T. S.; Farouki, R. T.; al-Kandari, M.; Pottmann, H., Optimal slicing of free-form surfaces, Computer Aided Geometric Design (2001), to appear
[28] Sun, C.; Sherrah, J., 3D symmetry detection using the extended Gaussian image, IEEE Transactions on Pattern Analysis and Machine Intelligence, 19, 164-168 (1997)
[29] Woo, T. C., Visibility maps and spherical algorithms, Computer-Aided Design, 26, 6-16 (1994) · Zbl 0805.68127
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.