Searched refs:curves (Results 1 - 25 of 27) sorted by relevance

12

/inkscape/src/2geom/
H A Dpath.cpp2 * @brief Path - a sequence of contiguous curves (implementation file)
130 // If dcurve == 0, it actually means that all curves are included in the domain
247 _data->curves.push_back(new LineSegment(r.corner(i), r.corner(i+1)));
249 _data->curves.push_back(_closing_seg);
259 _data->curves.push_back(_closing_seg);
269 _data->curves.push_back(new LineSegment(last, ch[i]));
273 _data->curves.push_back(_closing_seg);
285 _data->curves.push_back(new EllipticalArc(p1, c.radius(), c.radius(), 0, false, true, p2));
286 _data->curves.push_back(new EllipticalArc(p2, c.radius(), c.radius(), 0, false, true, p1));
288 _data->curves
[all...]
H A Dpath.h2 * @brief Path - a sequence of contiguous curves
59 Sequence curves; member in struct:Geom::PathInternal::PathData
119 * This class exists because when mapping the range of multiple curves onto the same interval
120 * as the curve index, we lose some precision. For instance, a path with 16 curves will
278 /** @brief Sequence of contiguous curves, aka spline.
280 * Path represents a sequence of contiguous curves, also known as a spline.
287 * first curve. This way the curves form a closed loop even for open paths.
357 _data->curves.push_back(_closing_seg);
360 /// Construct a path containing a range of curves.
368 _data->curves
[all...]
H A D2geom.h50 // curves and paths
51 #include <2geom/curves.h>
H A Dpath-sink.h37 #include <2geom/curves.h>
/inkscape/src/live_effects/
H A Dlpe-spiro.cpp13 #include <2geom/curves.h>
15 #include "helper/geom-curves.h"
82 // Determine type of spiro node this is, determined by the tangents (angles) of the curves
/inkscape/src/
H A Dsp-polygon.cpp19 #include <2geom/curves.h>
20 #include "helper/geom-curves.h"
H A Dsnapper.h28 std::list<Inkscape::SnappedCurve> curves; member in struct:IntermSnapResults
H A Dsp-path.cpp31 #include <2geom/curves.h>
32 #include "helper/geom-curves.h"
104 // only add curves for straight line segments
H A Dsnap.cpp498 std::cout << " Curves : " << isr.curves.size()<< std::endl;
507 for (std::list<Inkscape::SnappedCurve>::const_iterator i = isr.curves.begin(); i != isr.curves.end(); i++) {
532 if (getClosestCurve(isr.curves, closestCurve, exclude_paths)) {
556 // search for the closest snapped intersection of curves
558 if (getClosestIntersectionCS(isr.curves, p.getPoint(), closestCurvesIntersection, _desktop->dt2doc())) {
567 if (getClosestIntersectionCL(isr.curves, isr.guide_lines, p.getPoint(), closestCurveGuideIntersection, _desktop->dt2doc())) {
H A Dobject-snapper.cpp37 #include "helper/geom-curves.h"
225 // When snapping to paths, we will get a collection of snapped lines and snapped curves. findBestSnap() will
520 // n curves will return n time values with 0 <= t <= 1
566 isr.curves.push_back(SnappedCurve(sp_dt, sp_tangent_dt, num_path, index, dist, getSnapperTolerance(), getSnapperAlwaysSnap(), false, curve, p.getSourceType(), p.getSourceNum(), it_p->target_type, it_p->target_bbox));
829 // any line segments and lets only snap to higher order curves
/inkscape/src/libdepixelize/
H A Dkopftracer2011.cpp47 int curves(const PixelGraph &graph, PixelGraph::const_iterator a,
451 weights[i].first += Heuristics::curves(graph, a, d)
453 weights[i].second += Heuristics::curves(graph, b, c)
506 inline int Heuristics::curves(const PixelGraph &graph, function in class:Tracer::Heuristics
/inkscape/src/svg/
H A Dsvg-path.cpp25 #include <2geom/curves.h>
/inkscape/share/extensions/
H A Dbezmisc.py153 according to <http://www.cit.gu.edu.au/~anthony/info/graphics/bezier.curves>
166 "Adaptive subdivision and the length of Bezier curves"
250 curves = [((0,0),(1,5),(4,5),(5,5)), variable
256 for curve in curves:
270 for curve in curves:
H A Dgcodetools.py15 Removed the biarc curves - straight lines are better.
3586 self.OptionParser.add_option("", "--max-area-curves", action="store", type="int", dest="max_area_curves", default="100", help="Maximum area curves for each area")
3587 self.OptionParser.add_option("", "--area-inkscape-radius", action="store", type="float", dest="area_inkscape_radius", default="0", help="Area curves overlaping (depends on tool diameter [0,0.9])")
3588 self.OptionParser.add_option("", "--area-tool-overlap", action="store", type="float", dest="area_tool_overlap", default="-10", help="Radius for preparing curves using inkscape")
4499 def sort_curves(curves):
4501 for curve in curves:
4543 curves = []
4587 curves += [
4593 # for c in curves
[all...]
/inkscape/src/display/
H A Dcurve-test.h4 #include <2geom/curves.h>
H A Ddrawing-shape.cpp13 #include <2geom/curves.h>
26 #include "helper/geom-curves.h"
H A Dcairo-utils.cpp21 #include <2geom/curves.h>
31 #include "helper/geom-curves.h"
/inkscape/src/extension/internal/
H A Dlatex-pstricks.cpp20 #include <2geom/curves.h>
24 #include "helper/geom-curves.h"
H A Dwmf-print.cpp38 #include <2geom/curves.h>
40 #include "helper/geom-curves.h"
922 int curves = 0; local
935 curves++;
944 U_POINT16 *lpPoints = new U_POINT16[moves + lines + curves * 3];
1036 } else if (moves == 1 && nodes == 5 && moves + curves == nodes && closed) {
H A Dpov-out.cpp33 #include <2geom/curves.h>
35 #include "helper/geom-curves.h"
621 //# Lets do the curves first, to get the stats
624 err("Could not output curves for %s", filename_utf8);
H A Demf-print.cpp36 #include <2geom/curves.h>
40 #include "helper/geom-curves.h"
1505 int curves = 0; local
1518 curves++;
1527 U_POINT *lpPoints = new U_POINT[moves + lines + curves * 3];
1621 } else if (moves == 1 && nodes == 5 && moves + curves == nodes && closed) {
H A Djavafx-out.cpp38 #include <2geom/curves.h>
40 #include "helper/geom-curves.h"
856 //# Lets do the curves first, to get the stats
H A Dmetafile-print.cpp20 #include <2geom/curves.h>
/inkscape/src/helper/
H A Dgeom.cpp14 #include "helper/geom-curves.h"
18 #include <2geom/curves.h>
189 // should handle all not-so-easy curves:
523 else { /* all others must be Bezier curves */
/inkscape/src/livarot/
H A DPathCutting.cpp27 #include <2geom/curves.h>
28 #include "helper/geom-curves.h"

Completed in 1240 milliseconds

12