Searched refs:intersect (Results 1 - 25 of 45) sorted by relevance

12

/inkscape/src/2geom/
H A Dint-rect.h49 inline OptIntRect intersect(IntRect const &a, IntRect const &b) { function in namespace:Geom
52 inline OptIntRect intersect(OptIntRect const &a, OptIntRect const &b) { function in namespace:Geom
H A Dcircle.h102 std::vector<ShapeIntersection> intersect(Line const &other) const;
103 std::vector<ShapeIntersection> intersect(LineSegment const &other) const;
104 std::vector<ShapeIntersection> intersect(Circle const &other) const;
H A Dellipse.h201 std::vector<ShapeIntersection> intersect(Line const &line) const;
203 std::vector<ShapeIntersection> intersect(LineSegment const &seg) const;
205 std::vector<ShapeIntersection> intersect(Ellipse const &other) const;
207 std::vector<ShapeIntersection> intersect(D2<Bezier> const &other) const;
H A Dbezier-curve.cpp153 BezierCurve::intersect(Curve const &other, Coord eps) const function in class:Geom::BezierCurve
161 result = ls.intersect(other);
178 result = other.intersect(*this, eps);
298 std::vector<CurveIntersection> BezierCurveN<1>::intersect(Curve const &other, Coord eps) const function in class:Geom::BezierCurveN
306 result = this_line.intersect(other_line);
312 result = other.intersect(*this, eps);
H A Dcurve.cpp99 std::vector<CurveIntersection> Curve::intersect(Curve const &/*other*/, Coord /*eps*/) const function in class:Geom::Curve
109 // Thus, we can split the curve at roots and intersect the portions.
137 std::vector<CurveIntersection> xs = parts[i].intersect(parts[j], eps);
H A Dline.cpp252 std::vector<ShapeIntersection> Line::intersect(Line const &other) const function in class:Geom::Line
268 std::vector<ShapeIntersection> Line::intersect(Ray const &r) const function in class:Geom::Line
271 std::vector<ShapeIntersection> result = intersect(other);
276 std::vector<ShapeIntersection> Line::intersect(LineSegment const &ls) const function in class:Geom::Line
279 std::vector<ShapeIntersection> result = intersect(other);
H A Dbezier-curve.h162 virtual std::vector<CurveIntersection> intersect(Curve const &other, Coord eps = EPSILON) const;
278 virtual std::vector<CurveIntersection> intersect(Curve const &other, Coord eps = EPSILON) const { function in class:Geom::BezierCurveN
280 return BezierCurve::intersect(other, eps);
321 template <> std::vector<CurveIntersection> BezierCurveN<1>::intersect(Curve const &, Coord) const;
H A Dcircle.cpp163 std::vector<ShapeIntersection> Circle::intersect(Line const &l) const function in class:Geom::Circle
198 std::vector<ShapeIntersection> Circle::intersect(LineSegment const &l) const
200 std::vector<ShapeIntersection> result = intersect(Line(l));
205 std::vector<ShapeIntersection> Circle::intersect(Circle const &other) const
H A Drect.h228 inline OptRect intersect(Rect const &a, Rect const &b) { function in namespace:Geom
231 inline OptRect intersect(OptRect const &a, OptRect const &b) { function in namespace:Geom
H A Dellipse.cpp401 std::vector<ShapeIntersection> Ellipse::intersect(Line const &line) const function in class:Geom::Ellipse
408 // TODO intersect with line segment.
454 std::vector<ShapeIntersection> Ellipse::intersect(LineSegment const &seg) const function in class:Geom::Ellipse
458 std::vector<ShapeIntersection> result = intersect(Line(seg));
463 std::vector<ShapeIntersection> Ellipse::intersect(Ellipse const &other) const function in class:Geom::Ellipse
514 // of two ellipses, this corresponds to cross-lines. These intersect the ellipses
564 // intersect with the obtained lines and report intersections
566 std::vector<ShapeIntersection> as = intersect(lines[li]);
567 std::vector<ShapeIntersection> bs = other.intersect(lines[li]);
580 std::vector<ShapeIntersection> Ellipse::intersect(D function in class:Geom::Ellipse
[all...]
H A Dpathvector.cpp184 std::vector<PathIntersection> px = ii->path->intersect(*i->path, _precision);
217 std::vector<PVIntersection> PathVector::intersect(PathVector const &other, Coord precision) const function in class:Geom::PathVector
H A Delliptical-arc.cpp585 std::vector<CurveIntersection> EllipticalArc::intersect(Curve const &other, Coord eps) const function in class:Geom::EllipticalArc
589 return ls.intersect(other, eps);
596 result = _ellipse.intersect(ls);
603 result = _ellipse.intersect(bez->fragment());
610 result = _ellipse.intersect(arc->_ellipse);
617 result = other.intersect(*this, eps);
H A Dbezier-clipping.cpp374 double intersect (Point const& p1, Point const& p2, double y) function in namespace:Geom::detail::bezier_clipping
435 t = intersect(p[i-1], p[i], bound.min());
445 t = intersect(p[i-1], p[i], bound.max());
461 t = intersect(p[last], p[0], bound.min());
469 t = intersect(p[last], p[0], bound.max());
666 t = intersect(p[i-1], p[i], 0);
681 t = intersect(p[last], p[0], 0);
H A Dline.h369 std::vector<ShapeIntersection> intersect(Line const &other) const;
370 std::vector<ShapeIntersection> intersect(Ray const &r) const;
371 std::vector<ShapeIntersection> intersect(LineSegment const &ls) const;
H A Dconcepts.h123 ivec = shape.intersect(other);
H A Dconic_section_clipper_impl.h124 bool intersect (std::vector<Point> & crossing_points) const;
/inkscape/src/
H A Dsnapped-curve.h30 Inkscape::SnappedPoint intersect(SnappedCurve const &curve, Geom::Point const &p, Geom::Affine dt2doc) const; //intersect with another SnappedCurve
31 Inkscape::SnappedPoint intersect(SnappedLine const &line, Geom::Point const &p, Geom::Affine dt2doc) const; //intersect with a SnappedLine
H A Dsnapped-line.h28 Inkscape::SnappedPoint intersect(SnappedLineSegment const &line) const; //intersect with another SnappedLineSegment
44 Inkscape::SnappedPoint intersect(SnappedLine const &line) const; //intersect with another SnappedLine
H A Dsnapped-line.cpp52 Inkscape::SnappedPoint Inkscape::SnappedLineSegment::intersect(SnappedLineSegment const &line) const function in class:Inkscape::SnappedLineSegment
75 * See the comment in Inkscape::SnappedLine::intersect
130 Inkscape::SnappedPoint Inkscape::SnappedLine::intersect(SnappedLine const &line) const function in class:Inkscape::SnappedLine
198 Inkscape::SnappedPoint sp = (*i).intersect(*j);
243 Inkscape::SnappedPoint sp = (*i).intersect(*j);
271 Inkscape::SnappedPoint sp = (*i).intersect(*j);
H A Dsnapped-curve.cpp61 Inkscape::SnappedPoint Inkscape::SnappedCurve::intersect(SnappedCurve const &curve, Geom::Point const &p, Geom::Affine dt2doc) const function in class:Inkscape::SnappedCurve
80 // Never try to intersect a segment with itself
114 Inkscape::SnappedPoint Inkscape::SnappedCurve::intersect(SnappedLine const &line, Geom::Point const &p, Geom::Affine dt2doc) const function in class:Inkscape::SnappedCurve
196 Inkscape::SnappedPoint sp = (*i).intersect(*j, p, dt2doc);
229 Inkscape::SnappedPoint sp = (*i).intersect(*j, p, dt2doc);
H A Dline-geometry.cpp59 boost::optional<Geom::Point> Line::intersect(Line const &line) { function in class:Box3D::Line
79 boost::optional<Geom::Point> result = this->intersect(Line(pt, (this->v_dir).ccw(), false));
199 return this->intersect (line);
H A Dline-geometry.h32 virtual boost::optional<Geom::Point> intersect(Line const &line);
/inkscape/src/helper/
H A Dgeom-pathstroke.cpp232 // Arcs line join. If two circles don't intersect, expand inner circle.
244 std::vector<Geom::ShapeIntersection> chord1_pts = outer_circle.intersect(secant1);
249 std::vector<Geom::ShapeIntersection> chord2_pts = outer_circle.intersect(bisector);
261 std::vector<Geom::ShapeIntersection> chord3_pts = outer_circle.intersect(da);
278 std::vector<Geom::ShapeIntersection> center_new = bisector2.intersect( diameter );
288 // Arcs line join. If two circles don't intersect, adjust both circles so they just touch.
343 std::vector<Geom::ShapeIntersection> points = circle1.intersect( bisector );
433 points = circle1.intersect(circle2);
436 // std::cout << " Circles do not intersect, do backup" << std::endl;
488 points = circle2.intersect(secan
[all...]
/inkscape/src/display/
H A Dnr-filter-flood.cpp84 Geom::OptRect optoverlap = intersect( fp_cairo, sa );
/inkscape/share/extensions/
H A Dvoronoi.py212 p = lbnd.intersect(bisector)
224 p = bisector.intersect(rbnd)
295 # if left HE and the new bisector don't intersect, then delete
297 p = llbnd.intersect(bisector)
302 # if right HE and the new bisector don't intersect, then reinsert it
303 p = bisector.intersect(rrbnd)
503 # create a new site where the Halfedges el1 and el2 intersect
504 def intersect(self,other): member in class:Halfedge

Completed in 175 milliseconds

12