On recognizing and positioning curved 3-D objects from imagecontours

An approach for explicitly relating the shape of image contours to models of curved three-dimensional objects is presented. This relationship is used for object recognition and positioning. Object models consist of collections of parametric surface patches and their intersection curves; this includes nearly all representations used in computer-aided geometric design and computer vision. The image contours considered are the projections of surface discontinuities and occluding contours. Elimination theory provides a method for constructing the implicit equation of these contours for an object observed under orthographic or perspective projection. This equation is parameterized by the object's position and orientation with respect to the observer. Determining these parameters is reduced to a fitting problem between the theoretical contour and the observed data points. The proposed approach readily extends to parameterized models. It has been implemented for a simple world composed of various surfaces of revolution and tested on several real images     

基于CV／CAD的三维物体几何建模

在虚拟现实等技术领域中,都涉及到由现实世界中的实际景物建立对应的计算机描述的虚拟景物的问题,为此提出了利用计算机视觉与CAD几何建模技术相结合的三维珠体建模途径,首先通过编码光栅方法获取三维物体的深度图象,并采用数学形态学的方法加以分割,然后利用代数曲面拟合手段对分割后的三维曲面片进行重建,并使用CAD几何建模工具由重建的曲面片构成物体的几何模型,该文给出了初步的实验结果,证明所提出的技术途径基本可行。     

以给定的三次Bézier曲线为边界测地线的双三次Bézier曲面构造

曲面上的测地线是曲面上一类重要的曲线。测地线在计算机可视化、图像处理、 服装设计等领域均有广泛应用。该文利用一条曲线为所在曲面的测地线当且仅当它的从切面与 该曲面在这条曲线上的切平面重合这一论断,做了以下工作：对给定的三次Bézier曲线,构造 双三次Bézier曲面,使该曲面以给定的曲线为其边界测地线;讨论了具有给定测地线的组合双 三次Bézier曲面的连续性拼接问题;为了说明所给方法的有效性,给出了几个数值实例。     

Computing the minimum distance between a point and a clamped B-spline surface

The computation of the minimum distance between a point and a surface is important for the applications such as CAD/CAM, NC verification, robotics and computer graphics. This paper presents a spherical clipping method to compute the minimum distance between a point and a clamped B-spline surface. The surface patches outside the clipping sphere which do not contain the nearest point are eliminated. Another exclusion criterion whether the nearest point is on the boundary curves of the surface is employed, which is proved to be superior to previous comparable criteria. Examples are also shown to illustrate efficiency and correctness of the new method.     

G2 quasi-developable Bezier surface interpolation of two space curves

Surface development is used in many manufacturing planning operations, e.g., for garments, ships and automobiles. However, most freeform surfaces used in design are not developable, and therefore the developed patterns are not isometric to the original design surface. In some domains, the CAD model is created by interpolating two given space curves. In this paper, we propose a method to obtain a G² quasi-developable Bezier surface interpolating two arbitrary space curves. The given curves are first split into a number of piecewise Bezier curves and elemental Bezier patches each of which passes through four splitting points are constructed. All neighboring elemental patches are G² connected and they are assembled optimally in terms of the degree of developability (the integral Gaussian curvature). Experiments show that the final composite Bezier surface is superior to a lofted one which is defined regardless of the final surface developability.     

Generation of bi-monotone patches from quadrilateral mesh for reverse engineering

Thanks to recent improvements, computational methods can now be used to convert triangular meshes into quadrilateral meshes so that the quadrilateral elements capture well the principal curvature directional fields of surfaces and intrinsically have surface parametric values. In this study, a quadrilateral mesh generated using the mixed integer quadrangulation technique of Bommes et al. is used for input. We first segment a quadrilateral mesh into four-sided patches. The feature curves inside these patches are then detected and are constrained to act as the patch boundaries. Finally, the patch configuration is improved to generate large patches. The proposed method produces bi-monotone patches, which are appropriate for use in reverse engineering to capture the surface details of an object. A shape control parameter that can be adjusted by the user during the patch generation process is also provided to support the creation of patches with good bi-monotone shapes. This study mainly targets shape models of mechanical parts consisting of major smooth surfaces with feature curves between them.     

GC 1 multisided Bézier surfaces

This paper presents a new method for generating a tangent-plane continuous (GC¹) multisided surface with an arbitrary number of sides. The method generates piecewise biquintic tensor product Bézier patches which join each other with G¹-continuity and which interpolate the given vector-valued first order cross-derivative functions along the boundary curves. The problem of the twist-compatibility of the surface patches at the center points is solved through the construction of normal-curvature continuous starlines and by the way the twists of surface patches are generated. This avoids the inter-relationship among the starlines and the twists of surface patches at the center points. The generation of the center points and the starlines has many degrees of freedom which can be used to modify and improve the quality of the resulting surface patches. The method can be used in various geometric modeling applications such as filling n-sided holes, smoothing vertices of polyhedral solids, blending multiple surfaces, and modeling surface over irregular polyhedral line and curve meshes.     

Generation of Discrete Bicubic G1 B-Spline Ship Hullform Surfaces from a Given Curve Network Using Virtual Iso-Parametric Curves

We propose a method that automatically generates discrete bicubic G1 continuous B-spline surfaces that interpolate the curve network of a ship hullform. First, the curves in the network are classified into two types: boundary curves and "reference curves". The boundary curves correspond to a set of rectangular (or triangular) topological type that can be represented with tensor-product (or degenerate) B-spline surface patches. Next, in the interior of the patches, surface fitting points and cross boundary derivatives are estimated from the reference curves by constructing "virtual" isoparametric curves. Finally, a discrete G1 continuous B-spline surface is generated by a surface fitting algorithm. Several smooth ship hullform surfaces generated from curve networks corresponding to actual ship hullforms demonstrate the quality of the method.     

Cascade heterogeneous face sketch-photo synthesis via dual-scale Markov Network

Heterogeneous face sketch-photo synthesis is an important and challenging task in computer vision, which has widely applied in law enforcement and digital entertainment. According to the different synthesis results based on different scales, this paper proposes a cascade sketch-photo synthesis method via dual-scale Markov Network. Firstly, Markov Network with larger scale is used to synthesise the initial sketches and the local vertical and horizontal neighbour search (LVHNS) method is used to search for the neighbour patches of test patches in training set. Then, the initial sketches and test photos are jointly entered into smaller scale Markov Network. Finally, the fine sketches are obtained after cascade synthesis process. Extensive experimental results on various databases demonstrate the superiority of the proposed method compared with several state-of-the-art methods.     

Segmentation and classification of range images

The recognition of objects in three-dimensional space is a desirable capability of a computer vision system. Range images, which directly measure 3-D surface coordinates of a scene, are well suited for this task. In this paper we report a procedure to detect connected planar, convex, and concave surfaces of 3-D objects. This is accomplished in three stages. The first stage segments the range image into ``surface patches' by a square error criterion clustering algorithm using surface points and associated surface normals. The second stage classifies these patches as planar, convex, or concave based on a non-parametric statistical test for trend, curvature values, and eigenvalue analysis. In the final stage, boundaries between adjacent surface patches are classified as crease or noncrease edges, and this information is used to merge compatible patches to produce reasonable faces of the object(s). This procedure has been successfully applied to a large number of real and synthetic images, four of which we present in this paper.     

基于C-B 样条的三角形和四边形曲面生成

文章给出了基于C-B 样条的由网格数据产生三角形和四边形曲面片的方 法,C-B 样条是由基底函数{sin t, cos t, t, 1}导出的一种新型样条曲线,它可以克服现在正在 使用的B 样条和有理B 样条为了满足数据网格的拓扑结构而增加多余的控制点,求导求积 分复杂繁琐,阶数过高,从而讨论其连续拼接时增加了困难等缺点,如何将它推广成曲面就 成为一个重要问题。作者利用边-顶点方法构造插值算子,再将这些算子进行凸性组合,将 C-B 样条曲线推广成三角形曲面片和四边形曲面片,它可以用于CAD 的逆向工程中散乱数 据的曲面重构。     

Construction of Bézier surface patches with Bézier curves as geodesic boundaries

Given four polynomial or rational Bézier curves defining a curvilinear rectangle, we consider the problem of constructing polynomial or rational tensor-product Bézier patches bounded by these curves, such that they are geodesics of the constructed surface. The existence conditions and interpolation scheme, developed in a general context in earlier studies, are adapted herein to ensure that the geodesic-bounded surface patches are compatible with the usual polynomial/rational representation schemes of CAD systems. Precise conditions for four Bézier curves to constitute geodesic boundaries of a polynomial or rational surface patch are identified, and an interpolation scheme for the construction of such surfaces is presented when these conditions are satisfied. The method is illustrated with several computed examples.     

一种参数多项式曲面片的逐点生成算法

在计算机绘图中，一般来说，曲线实际上是由折线代替，而曲面实为小平面拼接而成，在使计算量降到最低的情况下画出真正的曲线方面，已有许多文章研究了曲线的逐点生成方法，并取得了一定的进展，但是尚无有效的快速逐点生成曲面的方法，为了快速逐点生成曲面，在建立多项式函数递推计算公式和算法的基础上，给出了一种逐点生成参数多项式曲面片的算法，由于此算法中只用到整数加法运算，且点数的适当选取可使计算量达到极小，因此是一种很有效的算法，该方法还可以加以改进，而用于有理函数，这无疑对有理曲线曲面（如NURBS曲线曲面）的快速生成以及对计算机图形学的其他一些领域都是有意义的。     

基于多分辨率模型的三角曲面特征线辨识技术

由于特征线在反求工程 CAD建模中具有非常重要的作用 ,因此利用图形图象处理中的多分辨率模型概念 ,通过研究三角曲面模型的特征线 ,提出了一种三角曲面特征线的计算方法 .将计算得到的初始特征线通过编辑、修改等手段进行处理 ,得到清晰的特征线 ,并将其作为进一步划分重构 B样条曲面边界的依据和参考 ,从而为实现基于三角曲面模型的 B样条曲面重构奠定了基础 .实验结果证明 ,该算法能够在三角曲面上提取出令人满意的特征线 ,并据此重构出拓扑划分合理的 B样条曲面 .     

Adaptive reconstruction of free-form surfaces using Bernstein basis function networks

Many computer graphics and computer-aided design (CAD) applications require mathematical models to be generated from measured coordinate data. The three-dimensional surface model of a complex object can be created by fitting the data with low-order parametric surface patches, and adjusting the control parameters such that the constituent patches meet seamlessly at their common boundaries. Most neural networks that are designed for function approximation produce a solution that is not easily transferable to CAD software. An adaptive technique to reconstruct a smooth surface from Bézier patches is presented in this paper. The approach utilizes a neural network that performs a weighted summation of Bernstein polynomial basis functions. The number of basis neurons is related to the degree of the Bernstein polynomials and is equivalent to the number of control parameters. Free-form surfaces are reconstructed by simultaneously updating networks that correspond to the separate patches. A smooth transition between adjacent Bézier surface patches is achieved by imposing positional and tangential continuity constraints on the weights during the adaptation process. The final weights of the various networks correspond to the control points of the stitched Bézier surface, and can therefore be used directly in many commercial CAD packages. This method has been used to create a closed surface by adaptively fitting two adjacent patches to synthetic range data and a complex open surface by fitting four patches to experimentally measured range data.     

Modelling and animation of generalized cylinders with variable radius offset space curves

A method is presented for the modelling and animation of generalized cylinders with variable radius offset space curves. The boundary surface of a generalized cylinder is constructed: either as a translational sweep of cross-sectional curves along the skeleton curve, or as a rotational sweep of profile curves around the skeleton curve. The cross-sectional curves are computed as the variable radius offset curves of a circle in the normal plane, and the profile curves are computed as the variable radius offset space curves of the skeleton curve. The offset curves are approximated by spline curves, and the boundary surface of a generalized cylinder is approximated by the tensor product surface patches of the offset spline curves.     

CAD-based sampling for CMM inspection of models with sculptured features

This paper addresses sampling models for trimmed sculptured surfaces, and multiple patches with boundary conditions. A CAD-based sampling system is developed and implemented in this work. The sculptured features are sampled along their isoparametric curves. These curves are then used to re-construct the model geometry using the skinning of cross section curves. We refer to the re-constructed model as the substitute geometry. The problem is to determine the sample curve locations such that the substitute geometry satisfies certain geometric conditions. These are, the form error, and the continuity of the substitute geometry across the boundaries of adjacent surfaces. Three criteria are integrated to determine the sample locations: the surface curvature change, the substitute geometry deviation from the CAD model, and the significance of trimmed portions of the surface. A boundary representation-based methodology for the sampling of trimmed surfaces is developed and implemented. This methodology is extended to handle n-sided surfaces obtained through filling n-sided regions with quadrilateral surface patches, and models that may include multiple surface patches. Furthermore, a tool to assess the sampling plans based on the continuity of the substitute geometry across boundaries of adjacent surface patches is developed. The developed algorithms, their implementations, and case studies are presented in this paper.     

Detection of loops and singularities of surface intersections

Two surface patches intersecting each other generally at a set of points (singularities), form open curves or closed loops. While open curves are easily located by following the boundary curves of the two patches, closed loops and singularities pose a robustness challenge since such points or loops can easily be missed by any subdivision or marching-based intersection algorithms, especially when the intersecting patches are flat and ill-positioned. This paper presents a topological method to detect the existence of closed loops or singularities when two flat surface patches intersect each other. The algorithm is based on an oriented distance function defined between two intersecting surfaces. The distance function is evaluated in a vector field to identify the existence of singular points of the distance function since these singular points indicate possible existence of closed intersection loops. The algorithm detects the existence rather than the absence of closed loops and singularities. This algorithm requires general C² parametric surfaces.     

Triangular bubble spline surfaces

We present a new method for generating a Gⁿ-surface from a triangular network of compatible surface strips. The compatible surface strips are given by a network of polynomial curves with an associated implicitly defined surface, which fulfill certain compatibility conditions. Our construction is based on a new concept, called bubble patches, to represent the single surface patches. The compatible surface strips provide a simple Gⁿ-condition between two neighboring bubble patches, which are used to construct surface patches, connected with Gⁿ-continuity. For n≤2, we describe the obtained Gⁿ-condition in detail. It can be generalized to any n≥3. The construction of a single surface patch is based on Gordon–Coons interpolation for triangles.Our method is a simple local construction scheme, which works uniformly for vertices of arbitrary valency. The resulting surface is a piecewise rational surface, which interpolates the given network of polynomial curves. Several examples of G⁰, G¹ and G²-surfaces are presented, which have been generated by using our method. The obtained surfaces are visualized with reflection lines to demonstrate the order of smoothness.     

一种三角网格模型的轮廓生成方法

从三维网格模型中提取轮廓信息是一个具有挑战性的过程.现有的方法一般是基于局部形状特征分析,如曲面的曲率和相邻面法向之间的夹角,但其特性通常对模型中的局部特征变化敏感.为了解决这个问题,提出一种基于三维形状几何近似的轮廓提取方法.利用完善的变分几何分割算法来得到一套完整的描述性特征曲线,首先基于变分几何近似方法划分模型为...