2007
DOI: 10.1016/j.mechmachtheory.2006.07.005
|View full text |Cite
|
Sign up to set email alerts
|

Flexible cam profile synthesis method using smoothing spline curves

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
27
0

Year Published

2009
2009
2022
2022

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 46 publications
(32 citation statements)
references
References 20 publications
0
27
0
Order By: Relevance
“…2 If the knot sequence is increasing, but not strictly increasing (that is, coincident knots are present), the continuity condition (2) has to be relaxed. (i) Simplifying spline optimization by providing a set of fixed candidate knots and only optimizing spline coefficients is not a new idea [4,[7][8][9][10][11]13]. Contrary to our approach, however, the number of knots was previously always kept limited (generally 5-20, as opposed to a few hundreds or thousands here), even if the effect of increasing the number of knots was investigated [7,9,11].…”
Section: Contributionsmentioning
confidence: 97%
See 3 more Smart Citations
“…2 If the knot sequence is increasing, but not strictly increasing (that is, coincident knots are present), the continuity condition (2) has to be relaxed. (i) Simplifying spline optimization by providing a set of fixed candidate knots and only optimizing spline coefficients is not a new idea [4,[7][8][9][10][11]13]. Contrary to our approach, however, the number of knots was previously always kept limited (generally 5-20, as opposed to a few hundreds or thousands here), even if the effect of increasing the number of knots was investigated [7,9,11].…”
Section: Contributionsmentioning
confidence: 97%
“…The important role of convexity as the key criterion making an optimization problem 'easy' or 'difficult' seems to be little known in the area of spline optimization for motion systems. While Sections 3 and 4 focus on linear programs, a subclass of convex programs, Section 5 makes the extension to convex programs by reviewing the known optimization methods [4,[7][8][9][10][11][12][13] thereby showing that some of these methods can be extended or simplified based on insights from convex optimization theory.…”
Section: Contributionsmentioning
confidence: 99%
See 2 more Smart Citations
“…Up to now, a number of works dealing with finding the way to describe accurately these surfaces have been proposed. Mostly, researchers derived mathematically expressions for the surface geometry of the globoidal cam based on coordinate transformation, differential geometry, and theory of conjugate surfaces [2][3][4][5][6]. In that way, it is so complex to infer the equations requiring designers to have solid mathematical knowledge.…”
Section: Introductionmentioning
confidence: 99%