1986
DOI: 10.1016/0141-6359(86)90005-x
|View full text |Cite
|
Sign up to set email alerts
|

A comparison of different algorithms for circularity evaluation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
8
0
3

Year Published

1992
1992
2017
2017

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 45 publications
(11 citation statements)
references
References 1 publication
0
8
0
3
Order By: Relevance
“…However, it is not easy to choose proper initial condition for these optimization methods which are local convergence sometimes. Also, many of these optimization algorithms are very complicated and can not be easily carried out in practical application 8,9 . Area search is a simple and efficient method which can be utilized in common roundness measurement.…”
Section: Introductionmentioning
confidence: 99%
“…However, it is not easy to choose proper initial condition for these optimization methods which are local convergence sometimes. Also, many of these optimization algorithms are very complicated and can not be easily carried out in practical application 8,9 . Area search is a simple and efficient method which can be utilized in common roundness measurement.…”
Section: Introductionmentioning
confidence: 99%
“…However, in practice, the roundness error is measured directly by form measuring equipments. On the other hand, some algorithms 2310 H. Saglam et al developed (Dhanish and Shanmugam 1991, Murthy 1986, Chetwy 1985, Chang and Lin 1992 such as Chebyshev approximation, simplex search, linear and non-linear optimization, and Monte Carlo methods have been used to evaluate roundness error in terms of the minimum zone. This paper presents an experimental study on the effects of grinding parameters on roundness and surface roughness using orthogonal array developed by Taguchi.…”
Section: Introductionmentioning
confidence: 99%
“…Different linearization procedures employed are given by Miller (1962); Whitehouse (1973); Kasa (1976); Kyusojin et al (1986); Murthy (1986); Shunmugam (1986a); Landau (1987) and Yerelan and Ventura (1988). The most common linearized equation for the errors, when the data points are given as (r i , θ i ) is:…”
Section: Introductionmentioning
confidence: 99%