{"responseHeader":{"status":0,"QTime":3,"params":{"q":"{!q.op=AND}id:\"96064\"","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":"/42/50/42502487a9e38f28729b6b7899567f13d38881b2.jpg","oldid_t":"compsci 3882","setname_s":"ir_computersa","file_s":"/84/3e/843ed5e7ade88648a2bf905b75fa2a1543539819.pdf","title_t":"Page 26","ocr_t":"16 at which the vector (P - Q) is perpendicular to the surface tangent plane. This property results in a system of nonlinear equat ions which are solved by using a Newton/Raphson search procedure. In order to make the search procedure robust and efficient, a voxel based structure is stored that contains a list of candidate initial points for each voxel. After a cut, the updated dexel point is converted into a voxel grid location, and surface near calculations are performed from each of the initial points in the voxellist. The minimum of all candidate solutions is taken as the milling error. 2.2.3.2 Toolpath Correction A gouge elimination algorithm has been developed that checks the intersection volume between the cutting tool and the workpiece for gouges and translates the tool position in such a way that the gouges are removed. If at any given tool instance m gouged dexel points are detected, a guide vector is computed as follows. where di is the depth of cut at a gouged dexel point, ni is the outward normal vector generated from the surface near point algorithm at each dexel point, and t is the tolerance. The guide vector specifies the direction along which the tool is translated. The magnitude of translation is set to the value of the maximum gouge. This process is repeated until the gouge is eliminated. Figure 2.5 shows the application of this algorithm to a tool motion. The tool motion is defined by the endpoints P and Q. The gouge at Q is iteratively eliminated and a new point Q' is generated. The entire tool motion PQ' is then reevaluated and the first gouge point is found at S. Letting R be the previous tool instance point, the remaining tool motion is broken into two segments, RS' and S'Q'. These two segments are recursively checked for gouges and subdivided, until no gouges remain or the dexel buffer resolution is reached.","restricted_i":0,"id":96064,"created_tdt":"2015-11-02T00:00:00Z","format_t":"application/pdf","parent_i":96117,"_version_":1642982571803410434}]},"highlighting":{"96064":{"ocr_t":[]}}}