The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper is devoted to shape modification of NURBS surfaces, in which a method based on energy optimization is proposed. By applying systems of constraints and minimizing the thin plate energy of error surface, geometric features (such as position, partial derivative and normal vector) at a selected point on a NURBS surface are modified. We also discuss shape modification in three special cases...
The B-spline curve is one of the most famous curves in computer graphics, computational geometry and CAGD. Developing more convenient techniques for designing and modifying B-spline curves is an important problem, and is also an important research issue. In this study, the shape modification of B-spline curves by geometric constraints is presented. A new method based on changing the control points...
This paper presents a novel circular augmented rotational trajectory (CART) algorithm to compute an R-space based shape descriptors which allow efficient shape matching, generalization and classification. The rotation invariant R-space representation can be used to detect invariant geometric features despite the presence of considerable noise and quantization errors. Moreover, the CART method is corner...
Sparse signal representations and approximations from overcomplete dictionaries have become an invaluable tool recently. In this paper, we develop a new, heuristic, graph-structured, sparse signal representation algorithm for overcomplete dictionaries that can be decomposed into subdictionaries and whose dictionary elements can be arranged in a hierarchy. Around this algorithm, we construct a methodology...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.