left.Split(l1,r1); //subdivide left
right.Split(l2,r2); //subdivide right
left.Split(l1,r1); //subdivide left
right.Split(l2,r2); //subdivide right
- //Test each cantidate against eachother
+ //Test each cantidate against each other
recurse_intersect(l1,l2);
recurse_intersect(l1,r2);
recurse_intersect(r1,l2);
recurse_intersect(l1,l2);
recurse_intersect(l1,r2);
recurse_intersect(r1,l2);
- //need to subdivide and check recursive bounding regions against eachother
+ //need to subdivide and check recursive bounding regions against each other
//so track a list of dirty curves and compare compare compare
//so track a list of dirty curves and compare compare compare
- //postprocess for breaks too close to eachother
+ //postprocess for breaks too close to each other
Real d = 0;
Point p = f[brk.front()];
Real d = 0;
Point p = f[brk.front()];