Computerized generation of surfaces with optimal approximation to ideal surfaces
dc.contributor.author | Litvin, F. L. | en_US |
dc.contributor.author | Chen, N. X. | en_US |
dc.contributor.author | Zhang, Y. | en_US |
dc.contributor.author | Krenzer, T. J. | en_US |
dc.contributor.author | Handschuh, R. F. | en_US |
dc.date.accessioned | 2006-04-10T15:28:29Z | |
dc.date.available | 2006-04-10T15:28:29Z | |
dc.date.issued | 1993-12 | en_US |
dc.identifier.citation | Litvin, F. L., Chen, N. X., Zhang, Y., Krenzer, T. J., Handschuh, R. F. (1993/12)."Computerized generation of surfaces with optimal approximation to ideal surfaces." Computer Methods in Applied Mechanics and Engineering 110(1-2): 39-55. <http://hdl.handle.net/2027.42/30398> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B6V29-47XF91P-92/2/f66b6e5b10bf2b24ed3853e63ba889c9 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/30398 | |
dc.description.abstract | The authors propose a new method for generation (by grinding or cutting) of a surface ([summation operator]g) with the optimal approximation to the theoretical (ideal) surface ([summation operator]p). The method is based on the following ideas: (1) A region of space is swept out by the tool surface [summation operator]t performing certain motions with respect to [summation operator]p. The surface of the tool (as grinding wheel or cutter) is a surface of revolution with a circular arc in axial section, and a circular cone in particular cases. (2) The space swept out by [summation operator]t is considered as a family of surfaces [summation operator]t, and the envelope to this family is surface [summation operator]g (generated surface) that must be in optimal approximation to the theoretical surface [summation operator]p. (3) The continuous varied setting and orientation of [summation operator]t with respect to [summation operator]p are executed by a multi-degree-of-freedom machine, that is a computer numerical controlled (CNC) machine. The approach developed can be applied for grinding of face-gears, helical involute gears with modified topology, ruled undeveloped surfaces and others. An example of application is considered. | en_US |
dc.format.extent | 1139534 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | Computerized generation of surfaces with optimal approximation to ideal surfaces | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Mechanical Engineering | en_US |
dc.subject.hlbsecondlevel | Engineering (General) | en_US |
dc.subject.hlbsecondlevel | Computer Science | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | University of Michigan at, Dearborn, MI, USA | en_US |
dc.contributor.affiliationother | University of Illinois at, Chicago, IL, USA | en_US |
dc.contributor.affiliationother | University of Illinois at, Chicago, IL, USA | en_US |
dc.contributor.affiliationother | Gleason Works, Rochester, NY, USA | en_US |
dc.contributor.affiliationother | NASA Lewis Research Center, Cleveland, OH, USA | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/30398/1/0000018.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/0045-7825(93)90018-S | en_US |
dc.identifier.source | Computer Methods in Applied Mechanics and Engineering | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.