Lines Matching refs:paths
157 CrossingPoints::CrossingPoints(Geom::PathVector const &paths) : std::vector<CrossingPoint>(){
159 for( unsigned i=0; i<paths.size(); i++){
160 for( unsigned ii=0; ii < size_nondegenerate(paths[i]); ii++){
161 for( unsigned j=i; j<paths.size(); j++){
162 for( unsigned jj=(i==j?ii:0); jj < size_nondegenerate(paths[j]); jj++){
167 // std::cout << paths[i][ii].toSBasis()[Geom::X] <<"\n";
168 // std::cout << paths[i][ii].toSBasis()[Geom::Y] <<"\n";
170 find_self_intersections( times, paths[i][ii].toSBasis() );
173 // std::cout << paths[i][ii].toSBasis()[Geom::X] <<"\n";
174 // std::cout << paths[i][ii].toSBasis()[Geom::Y] <<"\n";
176 // std::cout << paths[j][jj].toSBasis()[Geom::X] <<"\n";
177 // std::cout << paths[j][jj].toSBasis()[Geom::Y] <<"\n";
179 find_intersections( times, paths[i][ii].toSBasis(), paths[j][jj].toSBasis() );
189 if ( (i==j) && (ii == 0) && (jj == size_nondegenerate(paths[i])-1)
190 && paths[i].closed()
197 cp.pt = paths[i][ii].pointAt(times[k].first);
214 for( unsigned i=0; i<paths.size(); i++){
506 collectPathsAndWidths (SPLPEItem const *lpeitem, Geom::PathVector &paths, std::vector<double> &stroke_widths){
512 collectPathsAndWidths(SP_LPE_ITEM(subitem), paths, stroke_widths);
526 paths.push_back(subpaths[i]);