Remeshing aims to produce a more regular mesh from a given input mesh, while representing the original geometry as accurately as possible. Many existing remeshing methods focus on where to place new mesh vertices; these samples are placed exactly on the input mesh. However, considering the output mesh as a piecewise linear approximation of some geometry, this simple scheme leads to significant systematic error in non-planar regions. Here, we use parameterised meshes and the recent mathematical development of orthogonal approximation using Sobolev-type inner products to develop a novel sampling scheme which allows vertices to lie in space near the input surface, rather than exactly on it. The algorithm requires little extra computational effort and can be readily incorporated into many remeshing approaches. Experimental results show that on average, approximation error can be reduced by 40% with the same number of vertices.
Non-rigid registration of 3D shapes is an essential task of increasing importance as commodity depth sensors become more widely available for scanning dynamic scenes. Non-rigid registration is much more challenging than rigid registration as it estimates a set of local transformations instead of a single global transformation, and hence is prone to the overfitting issue due to underdetermination. The common wisdom in previous methods is to impose an l2-norm regularization on the local transformation differences. However, the l2-norm regularization tends to bias the solution towards outliers and noise with heavy-tailed distribution, which is verified by the poor goodness- of-fit of the Gaussian distribution over transformation differences. On the contrary, Laplacian distribution fits well with the transformation differences, suggesting the use of a sparsity prior. We propose a sparse non-rigid registration (SNR) method with an l1-norm regularized model for transformation estimation, which is effectively solved by an alternate direction method (ADM) under the augmented Lagrangian framework. We also devise a multi-resolution scheme for robust and progressive registration. Results on both public datasets and our scanned datasets show the superiority of our method, particularly in handling large-scale deformations as well as outliers and noise.
Shuai LinNational University of Defense Technology, ChinaYu-Kun LaiCardiff University, UKRalph R. MartinCardiff University, UKShiyao JinNational University of Defense Technology, ChinaZhi-Quan ChengAvatar Science Company, China
Geometric Modeling and Processingmathscidoc:1608.16083
Shape registration is fundamental to 3D object acquisition; it is used to fuse scans from multiple views. Existing algorithms mainly utilize geometric information to determine alignment, but this typically results in noticeable misalignment of textures (i.e. surface colors) when using RGB-depth cameras. We address this problem using a novel approach to color-aware registration, which takes both color and geometry into consideration simultaneously. Color information is exploited throughout the pipeline to provide more effective sampling, correspondence and alignment, in particular for surfaces with detailed textures. Our method can furthermore tackle both rigid and non-rigid registration problems (arising, for example, due to small changes in the object during scanning, or camera distortions). We demonstrate that our approach produces significantly better results than previous methods.
This paper deals with the merging problem, i.e. to approximate two adjacent Bézier curves by a single Bézier curve. A novel approach for approximate merging is introduced in the paper by using the constrained optimization method. The basic idea of this method is to find conditions for the precise merging of Bézier curves first, and then compute the constrained optimization solution by moving the control points. “Discrete” coefficient norm in L2 sense and “squared difference integral” norm are used in our method. Continuity at the endpoints of curves are considered in the merging process, and approximate merging with points constraints are also discussed. Further, it is shown that the degree elevation of original Bézier curves will reduce the merging error.
Ahn Y J, Lee B, Park Y, et al. Constrained polynomial degree reduction in the L 2 -norm equals best weighted Euclidean approximation of Bézier coefficients[J]. Computer Aided Geometric Design, 2004, 21(2): 181-191.
Tai C, Hu S, Huang Q, et al. Approximate merging of B-spline curves via knot adjustment and constrained optimization[J]. Computer-aided Design, 2003, 35(10): 893-899.
Cheng M, Wang G. Approximate merging of multiple Bézier segments[J]. Progress in Natural Science, 2008, 18(6): 757-762.
Pungotra H, Knopf G K, Canas R, et al. Merging multiple B-spline surface patches in a virtual reality environment[J]. Computer-aided Design, 2010, 42(10): 847-859.
Chen X, Ma W, Paul J, et al. Multi-degree reduction of Bézier curves using reparameterization[J]. Computer-aided Design, 2011, 43(2): 161-169.
Ahn Y J. FUNCTION APPROXIMATION OVER TRIANGULAR DOMAIN USING CONSTRAINED Legendre POLYNOMIALS[C]., 2005, 9(2): 99-106.
Chen Guojin. Multi-degree reduction of tensor product Bézier surfaces with conditions of corners interpolations. 2002.
Kim H S, Ahn Y J. Constrained degree reduction of polynomials in Bernstein-Bézier form over simplex domain[J]. Journal of Computational and Applied Mathematics, 2008, 216(1): 14-19.
Pan R, Weng B. Recursive representation and application of transformation matrices of B-spline bases[J]. Computer Aided Geometric Design, 2009, 26(1): 82-93.
Cheng M, Wang G. Multi-degree reduction of NURBS curves based on their explicit matrix representation and polynomial approximation theory[J]. Science in China Series F: Information Sciences, 2004, 47(1): 44-54.
In this paper, we propose the generalized B divided difference, with which the $(k−1)$th derivative of B-spline curves of order $k$ can be obtained directly without the need to compute the first $(k−2)$ derivatives as before. Based on the generalized B divided difference, the necessary and sufficient condition for degree-reducible B-spline curves is presented. Algorithms for degree reduction of B-spline curves are proposed using the constrained optimization methods.
The ability to directly manipulate an embedded object in the free-form deformation (FFD) method improves controllability. However, the existing solution to this problem involves a pseudo-inverse matrix that requires complicated calculations. This paper solves the problem using a constrained optimization method. We derive the explicit solutions for deforming an object which is to pass through a given target point. For constraints with multiple target points, the proposed solution also involves simple calculations, only requiring solving a system of linear equations.We show that the direct manipulations exhibit the commutative group property, namely commutative, associative, and invertible properties, which further enhance the controllability of FFD. In addition, we show that multiple point constraints can be decomposed into separate manipulations of single point constraints, thus providing the user the freedom of specifying the constraints in any appropriate order.
In this paper, two explicit conversion formulae between triangular and rectangular Bézier patches are derived. Using the formulae, one triangular Bézier patch of degree n can be converted into one rectangular Bézier patch of degree $n \times n$. And one rectangular Bézier patch of degree m × n can be converted into two triangular Bézier patches of degree $m + n$ . Besides, two stable recursive algorithms corresponding to the two conversion formulae are given. Using the algorithms, when converting triangular Bézier patches to rectangular Bézier patches, we can computer the relations between the control points of the two types of patches for any $n\ge2$ based on the relationships for $n=1$. When converting rectangular Bézier patches to triangular Bézier patches, we can computer the relations between the control points of the two types of patches for any $m\ge 2, n \subset N^+ $ and $n \ge 2, m \subset N^+$ based on the relationships for $m=n=1$.
NURBS surfaces are among the most commonly used parametric surfaces in CAGD and Computer Graphics. This paper investigates shape modification of NURBS surfaces with geometric constraints, such as point, normal vector, and curve constraints. Two new methods are presented by constrained optimization and energy minimization. The former is based on minimizing changes in control net of surfaces, whereas the latter is based on strain energy minimization. By these two methods, we change control points and weights of an original surface, such that the modified surface satisfies the given constraints. Comparison results and practical examples are also given.
Piquer A, Contero M, Naya F, et al. A survey on geometrical reconstruction as a core technology to sketch-based modeling[J]. Computers \u0026 Graphics, 2005, 29(6): 892-904.
Lee H, Han S. Reconstruction of 3D interacting solids of revolution from 2D orthographic views[J]. Computer-aided Design, 2005, 37(13): 1388-1398.
Ming Li · Frank C Langbein · Ralph R Martin. Detecting design intent in approximate CAD models using symmetry. 2010.
Soni S, Gurumoorthy B. Handling Solids of Revolution in Volume-Based Construction of Solid Models From Orthographic Views[J]. Journal of Computing and Information Science in Engineering, 2003, 3(3): 250-259.
Dimri J, Gurumoorthy B. Handling sectional views in volume-based approach to automatically construct 3D solid from 2D views[J]. Computer-aided Design, 2005, 37(5): 485-495.
Gong J, Zhang H, Zhang G, et al. Solid reconstruction using recognition of quadric surfaces from orthographic views[J]. Computer-aided Design, 2006, 38(8): 821-835.
Adem Cicek · Mahmut Gulesin. Reconstruction of 3D models from 2D orthographic views using solid extrusion and revolution. 2004.
Li M, Langbein F C, Martin R R, et al. Constructing regularity feature trees for solid models[J]. geometric modeling and processing, 2006: 267-286.
Zhang S, Shi Y, Fan H, et al. Serial 3D model reconstruction for machining evolution of rotational parts by merging semantic and graphic process planning information[J]. Computer-aided Design, 2010, 42(9): 781-794.
Zhe Wang · Mohammed Latif. Reconstruction of a 3D solid model from orthographic projections. 2003.
This paper presents a new approach for reconstructing solids with planar, quadric and toroidal surfaces from three-view engineering drawings. By applying geometric theory to 3-D reconstruction, our method is able to remove restrictions placed on the axes of curved surfaces by existing methods. The main feature of our algorithm is that it combines the geometric properties of conics with affine properties to recover a wider range of 3-D edges. First, the algorithm determines the type of each 3-D candidate conic edge based on its projections in three orthographic views, and then generates that candidate edge using the conjugate diameter method. This step produces a wire-frame model that contains all candidate vertices and candidate edges. Next, a maximum turning angle method is developed to find all the candidate faces in the wire-frame model. Finally, a general and efficient searching technique is proposed for finding valid solids from the candidate faces; the technique greatly reduces the searching space and the backtracking incidents. Several examples are given to demonstrate the efficiency and capability of the proposed algorithm.