Dwell time algorithm for computer-controlled polishing of small axis-symmetrical aspherical lens mold

Optical Engineering

Volumn 40, Issue 9, 2001, Pages 1936-1943

  Lee, Hocheol ^a   Yang, Minyang ^b  

^a SAMSUNG Electronics   (South Korea)

^b Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Computer controlled polishing; Dwell time algorithm; Spatially varying case; Spherical polyurethane tool; Tool mark removal

Indexed keywords

ALGORITHMS; ASPHERICS; COMPUTER CONTROL; COMPUTER SIMULATION; LENSES; LINEAR EQUATIONS; MOLDS;

COMPUTER-CONTROLLED POLISHING;

POLISHING;

EID: 0035454035     PISSN: 00913286     EISSN: None     Source Type: Journal    
DOI: 10.1117/1.1396323     Document Type: Article

References (19)

1. Computer assisted optical surfacing
2. Computer-controlled optical surfacing with orbital tool motion
3. Magnetorheological finishing: A deterministic process for optics manufacturing
4. Fabrication of aspherics using a mathematical model for material removal
5. Automated polishing of large optical components with a small tool
6. Surface figuring using neutral ion beams
7. Neutral ion figuring of chemical deposited SIC
8. Computer numerically controlled plasma chemical vaporization machining with a pipe electrode for optical fabrication
9. Studies on super-smooth polishing (2nd report)
10. Optimizing the technological process of automated grinding and polishing of high-precision large optical elements with a small tool
11. Contouring algorithm for ion figuring
12. Advanced matrix-based algorithms for ion beam milling of optical components
13. Microcomputer-controlled polishing machine for very smooth and deep aspherical surfaces
14. Study on aspherical surface polishing of single crystal silicon lens
15. A process planning strategy for removing arbitrary and axially symmetric profile by a polishing process
16. PC-based numerically controlled polishing machine for aspherical surfaces with dwell time control
17. The theory and design of plate glass polishing machines
18. Linear least squares with linear inequality constraints