Searched defs:curves (Results 1 - 6 of 6) sorted by relevance
/inkscape/share/extensions/ |
H A D | bezmisc.py | 153 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:
|
/inkscape/src/libdepixelize/ |
H A D | kopftracer2011.cpp | 47 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/ |
H A D | snapper.h | 28 std::list<Inkscape::SnappedCurve> curves; member in struct:IntermSnapResults
|
/inkscape/src/2geom/ |
H A D | path.h | 2 * @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...] |
/inkscape/src/extension/internal/ |
H A D | wmf-print.cpp | 38 #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 D | emf-print.cpp | 36 #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) {
|
Completed in 50 milliseconds