{"responseHeader":{"status":0,"QTime":7,"params":{"q":"{!q.op=AND}id:\"100570\"","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":[{"file_name_t":"Peterson-PRT_High_Quality.pdf","thumb_s":"/ab/ae/abae753d1589017b1bca1142d640286aab27a1da.jpg","oldid_t":"compsci 8683","setname_s":"ir_computersa","restricted_i":0,"format_t":"application/pdf","modified_tdt":"2016-05-25T00:00:00Z","file_s":"/6b/47/6b470e3236c59b4597c645cb8d73fd0cc6889a6b.pdf","title_t":"Page 30","ocr_t":"20 functions, and piecewise Bezier curves by table lookup. 2.6.4 Fast implementation of the recurrence relations The equations for Bi,k are typically specified by the recurrence relation [2) B { 1 Ui :::; u < Ui+l i,t ( u) = 0 otherwise and for r = 2, 3, ... , k. Implementing this relation recursively however, introduces a significant amount of function call overhead. To eliminate this overhead, the equations were reformu-lated as for j = 0 to k - 1 { 1 Ui :::; U < Ui+l blends1 ( u) +- 0 otherwise for level = 2 to k for j = 0 to k - level ni +- i + j blendsj +- _ _.;...u_-.;_jun.u.i _ blends j + Una+ Ievei-l -Uni Bi,k +- blends0 Unj+level-u Uni+leveJ-Una+l blendsi+l The recursive formulation does have one advantage, however. If one considers the 'tree' of values: Bo,t Bo2 ' Bt,I Bo,3 B1,2 Bo,4 B2,1 BI,3 B2,2 B3,t","id":100570,"created_tdt":"2016-05-25T00:00:00Z","parent_i":100643,"_version_":1642982773936357377}]},"highlighting":{"100570":{"ocr_t":[]}}}