Loop and Catmull-Clark are the most famous approximation subdivision schemes, but their limit surfaces do not interpolate the vertices of the given mesh. Progressive-iterative approximation (PIA) is an efficient method for data interpolation and has a wide range of applications in many fields such as subdivision surface fitting, parametric curve and surface fitting among others. However, the convergence rate of classical PIA is slow. In this paper, we present a new and fast PIA format for constructing interpolation subdivision surface that interpolates the vertices of a mesh with arbitrary topology. The proposed method, named Conjugate-Gradient Progressive-Iterative Approximation (CG-PIA), is based on the Conjugate-Gradient Iterative algorithm and the Progressive Iterative Approximation (PIA) algorithm. The method is presented using Loop and Catmull-Clark subdivision surfaces. CG-PIA preserves the features of the classical PIA method, such as the advantages of both the local and global scheme and resemblance with the given mesh. Moreover, CG-PIA has the following features. 1) It has a faster convergence rate compared with the classical PIA and W-PIA. 2) CG-PIA avoids the selection of weights compared with W-PIA. 3) CG-PIA does not need to modify the subdivision schemes compared with other methods with fairness measure. Numerous examples for Loop and Catmull-Clark subdivision surfaces are provided in this paper to demonstrate the efficiency and effectiveness of CG-PIA.
- Article type
- Year
- Co-author
Open Access
Research Article
Issue
Diffusion curves can be used to generate vector graphics images with smooth variation by solving Poisson equations. However, using the classical diffusion curve model, it is difficult to ensure that the generated diffusion image satisfies desired constraints. In this paper, we develop a model for producing a diffusion image by solving a diffusion equation with diffusion coefficients, in which color layers and coefficient layers are introduced to facilitate the generation of the diffusion image. Doing so allows us to impose various constraints on the diffusion image, such as diffusion strength, diffusion direction, diffusion points, etc., in a unified computational framework. Various examples are presented in this paper to illustrate the capabilities of our model.
Open Access
Research Article
Issue
Visual curve completion is a fundamental problem in understanding the principles of the human visual system. This problem is usually divided into two problems: a grouping problem and a shape problem. On one hand, though perception of the visually completed curve is clearly a global task (for example, a human perceives the Kanizsa triangle only when seeing all three black objects), conventional methods for solving the grouping problem are generally based on local Gestalt laws. On the other hand, the shape of the visually completed curve is usually recovered by minimizing shape energy in existing methods. However, not only do these methods lack mechanisms to adjust the shape of the recovered visual curve using perceptual, psychophysical, and neurophysiological knowledge, but it is also difficult to calculate an explicit representation of the visually completed curve. In this paper, we present a systematic computational model for generating a visually completed curve. Firstly, based on recent studies of perception, psychophysics, and neurophysiology, we formulate a grouping procedure based on the human visual system by seeking a minimum Hamiltonian cycle in a graph, solving the grouping problem in a global manner. Secondly, we employ a Bézier curve-based model to represent the visually completed curve. Not only is an explicit representation deduced, but we also present a means to integrate knowledge from related areas, such as perception, psychophysics, and neurophysiology, and so on. The proposed computational model has been validated using many modal and amodal completion examples, and desirable results were obtained.
京公网安备11010802044758号