2014
DOI: 10.1364/ao.53.004752
|View full text |Cite
|
Sign up to set email alerts
|

Dwell-time algorithm for polishing large optics

Abstract: The calculation of the dwell time plays a crucial role in polishing precision large optics. Although some studies have taken place, it remains a challenge to develop a calculation algorithm which is absolutely stable, together with a high convergence ratio and fast solution speed even for extremely large mirrors. For this aim, we introduced a self-adaptive iterative algorithm to calculate the dwell time in this paper. Simulations were conducted in bonnet polishing (BP) to test the performance of this method on… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
24
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
7
3

Relationship

0
10

Authors

Journals

citations
Cited by 61 publications
(26 citation statements)
references
References 26 publications
(47 reference statements)
0
24
0
Order By: Relevance
“…Although practical fluid jet polishing is hardly affected by the polishing edge effect [21], the edge-up phenomenon occurs when performing polishing removal simulations, which is a common problem that is difficult to avoid when solving the dwell time [22,23]. In this algorithm, to avoid the influence of this phenomenon on the solution in the region of interest, the polished surface and its form error will extend outward by a specified distance, and so does the planned polishing path, as shown in Figure 7b.…”
Section: Variable Pitch Spiral Path Planning Methodsmentioning
confidence: 99%
“…Although practical fluid jet polishing is hardly affected by the polishing edge effect [21], the edge-up phenomenon occurs when performing polishing removal simulations, which is a common problem that is difficult to avoid when solving the dwell time [22,23]. In this algorithm, to avoid the influence of this phenomenon on the solution in the region of interest, the polished surface and its form error will extend outward by a specified distance, and so does the planned polishing path, as shown in Figure 7b.…”
Section: Variable Pitch Spiral Path Planning Methodsmentioning
confidence: 99%
“…The polishing time at each dwell point (i.e. the dwell map) can be solved with various algorithms such as discrete convolution model, the linear equation model and so forth [17]. Finally, the CNC code can be generated according to the dwell point on the path and the dwell time map.…”
Section: Development Of the Multi-pitch Tool Pathmentioning
confidence: 99%
“…Spiral tool path is adopted, and the dwell points are generated according to Eq. (7) [29]. Afterwards the pad shape correction process is conducted and the resultant pad shape is shown in Figure 14.…”
Section: Correction Of the Pad Shape And Polishing Experimentsmentioning
confidence: 99%