Searched defs:crossings (Results 1 - 6 of 6) sorted by relevance

/inkscape/src/2geom/
H A Dpath-intersection.h59 Crossings cc = t.crossings(a[i], b[*jp]);
73 Crossings crossings(Curve const &a, Curve const &b);
74 Crossings crossings(Path const &a, Path const &b) { return curve_sweep<SimpleCrosser>(a, b); } function in struct:Geom::SimpleCrosser
75 CrossingSet crossings(PathVector const &a, PathVector const &b) { return Crosser<Path>::crossings(a, b); } function in struct:Geom::SimpleCrosser
79 Crossings crossings(Path const &a, Path const &b) { return crossings(PathVector(a), PathVector(b))[0]; } function in struct:Geom::MonoCrosser
80 CrossingSet crossings(PathVector const &a, PathVector const &b);
90 inline Crossings crossings(Curve const & a, Curve const & b) { function in namespace:Geom
92 return c.crossings(
95 inline Crossings crossings(Path const & a, Path const & b) { function in namespace:Geom
100 inline CrossingSet crossings(PathVector const & a, PathVector const & b) { function in namespace:Geom
[all...]
H A Dcrossing.h161 virtual Crossings crossings(T const &a, T const &b) { function in struct:Geom::Crosser
162 return crossings(CrossingTraits<T>::vector_one(a), CrossingTraits<T>::vector_one(b))[0]; }
163 virtual CrossingSet crossings(VectorT const &a, VectorT const &b) { function in struct:Geom::Crosser
171 Crossings cr = crossings(a[i], b[j]);
174 //Sort & add A-sorted crossings
180 //Sort & add B-sorted crossings
H A Dpath-intersection.cpp293 Crossings SimpleCrosser::crossings(Curve const &a, Curve const &b) { function in class:Geom::SimpleCrosser
460 * Finds crossings between two sets of paths, yielding a CrossingSet. [0, a.size()) of the return correspond
461 * to the sorted crossings of a with paths of b. The rest of the return, [a.size(), a.size() + b.size()],
462 * corresponds to the sorted crossings of b with paths of a.
467 CrossingSet MonoCrosser::crossings(PathVector const &a, PathVector const &b) { function in class:Geom::MonoCrosser
710 Crossings res = cc.crossings(p[i], p[j]);
H A Dconicsec.cpp496 std::vector<Point> xAx::crossings(Rect r) const { function in class:Geom::xAx
511 std::vector<Point> crs = crossings(bnd);
/inkscape/src/libavoid/
H A Dmakepath.cpp245 CrossingsInfoPair crossings = countRealCrossings( local
248 result += (crossings.first * cluster_crossing_penalty);
275 CrossingsInfoPair crossings = countRealCrossings( local
280 if ((crossings.second & CROSSING_SHARES_PATH) &&
281 (crossings.second & CROSSING_SHARES_FIXED_SEGMENT) &&
282 !(crossings.second & CROSSING_SHARES_PATH_AT_END))
312 CrossingsInfoPair crossings = countRealCrossings( local
315 result += (crossings.first * crossing_penalty);
763 // If the connector hates crossings or there are clusters present,
H A Dorthogonal.cpp1969 int crossings = 0; local
1973 crossings += countRealCrossings(route2, true, route, i,
1977 if (crossings > 0)
1979 crossingsN += crossings;

Completed in 642 milliseconds