{"responseHeader":{"status":0,"QTime":5,"params":{"q":"{!q.op=AND}id:\"96054\"","hl":"true","hl.simple.post":"","hl.fragsize":"5000","fq":"!embargo_tdt:[NOW TO *]","hl.fl":"ocr_t","hl.method":"unified","wt":"json","hl.simple.pre":""}},"response":{"numFound":1,"start":0,"docs":[{"modified_tdt":"2015-11-02T00:00:00Z","thumb_s":"/b4/9c/b49cd23dac089726f1f111c11a89a688776a6529.jpg","oldid_t":"compsci 3872","setname_s":"ir_computersa","file_s":"/0e/91/0e91762571fad8d28b6cbdbe68516adb44277245.pdf","title_t":"Page 16","ocr_t":"6 The key aspects of t heir research are discretization of the surface being machin d, intersection calculations, and localization of the surface vectors to be intersected. The following two subsections give detailed descriptions of their work in the 3-axis case and the results of extending it to 5-axis. 2.1.1 3-axis In this approach, the surface is discretized by a series of subdivisions. First , a triangulated polyhedron is generated, all of whose vertices are on the surface. These triangles are then subdivided into smaller triangles and this process is repeated until the triangulation is good enough to satisfy the user defined bounds on simulation error. The method used for finding the error bound at any given stage of triangulation is explained below. The discrete approximation of the surface can introduce simulation errors in the following two ways. • The first kind of simulation error occurs because of the approximation of the surface. The triangulated polyhedron may not accurately represent the surface and in areas with high curvature the difference between the two may be large. This kind of error is denoted by e8 • • The other type of error results from the fact that cutting error is measured only at the sample points. If two sample points are very far apart , i.e. , the distance between them is more than the tool radius, then information is lost about the cutting that takes place between them. This kind of error is denoted by ep. The actual simulation error e is a function of es and eP. In the worst case it is es + ep while in the best case it is max( e8 , ep)· It can be shown [12) that if r is the radius of the tool and d is the maximum distance between the vertices of any triangle, then","restricted_i":0,"id":96054,"created_tdt":"2015-11-02T00:00:00Z","format_t":"application/pdf","parent_i":96117,"_version_":1664094501025611777}]},"highlighting":{"96054":{"ocr_t":[]}}}