Hierarchical Data Structures and Algorithms for Computer Graphics. Part I.
IEEE Computer Graphics and Applications
Algorithms for polynomials in Bernstein form
Computer Aided Geometric Design
Parabolic curves of evolving surfaces
International Journal of Computer Vision
3D Symmetry Detection Using The Extended Gaussian Image
IEEE Transactions on Pattern Analysis and Machine Intelligence
Contour machining of free-form surfaces with real-time PH curve CNC interpolators
Computer Aided Geometric Design
Orientation-Based Differential Geometric Representations for Computer Vision Applications
IEEE Transactions on Pattern Analysis and Machine Intelligence
Computation of Surface Geometry and Segmentation Using Covariance Techniques
IEEE Transactions on Pattern Analysis and Machine Intelligence
Automatic segmentation of unorganized noisy point clouds based on the Gaussian map
Computer-Aided Design
SMI 2013: Orthogonal slicing for additive manufacturing
Computers and Graphics
| Hi-index | 0.00 |
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)@?[0,1]x[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.