Searched refs:point (Results 1 - 25 of 166) sorted by relevance

1234567

/inkscape/share/extensions/
H A Dwhirl.py45 for point in csp:
46 point[0] -= view_center[0]
47 point[1] -= view_center[1]
48 dist = math.sqrt((point[0] ** 2) + (point[1] ** 2))
51 theta = math.atan2(point[1], point[0]) + a
52 point[0] = (dist * math.cos(theta))
53 point[1] = (dist * math.sin(theta))
54 point[
[all...]
H A Dvoronoi2svg.py140 for point in interpoints:
141 minx = min(point[0],minx)
142 maxx = max(point[0],maxx)
143 miny = min(point[1],miny)
144 maxy = max(point[1],maxy)
154 for point in interpoints:
155 if point[2]: #The point is a bounding box intersection
158 return [[start[0],start[1]],[point[0],point[
[all...]
/inkscape/src/libavoid/
H A Dvisibility.h37 extern void vertexVisibility(VertInf *point, VertInf *partner, bool knownNew,
39 extern void vertexSweep(VertInf *point);
H A Dvisibility.cpp122 void vertexVisibility(VertInf *point, VertInf *partner, bool knownNew, argument
125 Router *router = point->_router;
126 const VertID& pID = point->id;
133 point->removeFromGraph();
138 router->generateContains(point);
143 vertexSweep(point);
156 EdgeInf::checkEdgeVisibility(point, k, knownNew);
160 EdgeInf::checkEdgeVisibility(point, partner, knownNew);
181 double x = vInf->point.x - centerPoint.x;
182 double y = vInf->point
376 sweepVisible(SweepEdgeList& T, const PointPair& point, std::set<unsigned int>& onBorderIDs, int *blocker) argument
[all...]
H A Dmakepath.cpp94 // the highest timeStamp. This corresponds to the furthest point
146 connRoute.ps[routeSize - 1] = inf3->point;
147 connRoute.ps[routeSize - 2] = inf2->point;
151 connRoute.ps[routeSize] = done[curr].inf->point;
159 // possibly the previous point (inf1) [from inf1--inf2], return a
179 Point p1 = inf1->point;
180 Point p2 = inf2->point;
181 Point p3 = inf3->point;
353 // Target point is back in the direction of the first point,
[all...]
H A Dvertices.cpp155 point(vpoint),
166 point.id = vid.objID;
167 point.vn = vid.vn;
184 point = vpoint;
185 point.id = id.objID;
186 point.vn = id.vn;
192 point = vpoint;
193 point.id = id.objID;
194 point.vn = id.vn;
243 Point& p = src->point;
[all...]
H A Dgraph.cpp75 // Gives an order value between 0 and 3 for the point c, given the last
77 // 0 : Point c is directly backwards from point b.
128 // point, then the order is north, east, south, then west.
129 // Note: This method assumes the two Edges that share a common point.
141 // Determine common Point and the comparison point on the left- and
168 const Point& lhsPt = lhsV->point;
169 const Point& rhsPt = rhsV->point;
170 const Point& commonPt = commonV->point;
173 Point lastPt = (lastV) ? lastV->point : Point(commonPt.x - 10, commonPt.y);
332 return std::make_pair(_v1->point, _v
[all...]
H A Dconnector.cpp43 ConnEnd::ConnEnd(const Point& point) argument
44 : _point(point),
51 ConnEnd::ConnEnd(const Point& point, const ConnDirFlags visDirs) argument
52 : _point(point),
68 const Point ConnEnd::point(void) const function in class:Avoid::ConnEnd
86 Point point; local
91 point.vn = kUnassignedVertexNumber;
94 point.x = x_min + _insideOffset;
95 point.vn = 6;
99 point
276 const Point& point = connEnd.point(); local
296 _srcVert->Reset(VertID(_id, isShape, type), point); local
311 _dstVert->Reset(VertID(_id, isShape, type), point); local
385 Point& point = vInf->point; local
[all...]
H A Dconnector.h61 //! which sides of a shape this point should have visibility to if
64 //! Like SVG, libavoid considers the Y-axis to point downwards, that is,
70 //! @brief This option specifies the point should be given visibility
73 //! @brief This option specifies the point should be given visibility
76 //! @brief This option specifies the point should be given visibility
79 //! @brief This option specifies the point should be given visibility
82 //! @brief This option, provided for convenience, specifies the point
108 //! @brief Constructs a ConnEnd from a free-floating point.
110 //! @param[in] point The position of the connector endpoint.
112 ConnEnd(const Point& point);
357 Point *point; member in class:Avoid::PointRep
[all...]
H A Dshape.h107 VertInf *getPointVertex(const Point& point);
/inkscape/src/live_effects/
H A Dlpe-test-doEffect-stack.cpp23 point(_("Point param:"), "tooltip of point parameter", "point_param", &wr, this),
27 registerParameter( dynamic_cast<Parameter *>(&point) );
30 point.set_oncanvas_looks(SP_KNOT_SHAPE_SQUARE, SP_KNOT_MODE_XOR, 0x00ff0000);
31 point.param_setValue(point,true);
H A Dlpe-test-doEffect-stack.h18 #include "live_effects/parameter/point.h"
35 PointParam point; member in class:Inkscape::LivePathEffect::LPEdoEffectStackTest
/inkscape/src/livarot/
H A Dsweep-event.h7 #include <2geom/point.h>
/inkscape/src/
H A Dtransf_mat_3x4.cpp55 TransfMat3x4::image (Pt3 const &point) { argument
56 double x = tmat[0][0] * point[0] + tmat[0][1] * point[1] + tmat[0][2] * point[2] + tmat[0][3] * point[3];
57 double y = tmat[1][0] * point[0] + tmat[1][1] * point[1] + tmat[1][2] * point[2] + tmat[1][3] * point[3];
58 double w = tmat[2][0] * point[
[all...]
H A Dsnap-candidate.h17 #include <2geom/point.h>
33 SnapCandidatePoint(Geom::Point const &point, Inkscape::SnapSourceType const source, long const source_num, Inkscape::SnapTargetType const target, Geom::OptRect const &bbox) argument
34 : _point(point),
43 SnapCandidatePoint(Geom::Point const &point, Inkscape::SnapSourceType const source, Inkscape::SnapTargetType const target) argument
44 : _point(point),
53 SnapCandidatePoint(Geom::Point const &point, Inkscape::SnapSourceType const source) argument
54 : _point(point),
82 // Coordinates of the point
84 // For perpendicular or tangential snapping of a ROTATING line we need to know its (stationary) starting point.
88 // vector will be stored in the same way as the starting point i
[all...]
H A Dconn-avoid-ref.h16 #include <2geom/point.h>
H A Dproj_pt.h15 #include <2geom/point.h>
27 Pt2 (Geom::Point const &point) { pt[0] = point[Geom::X]; pt[1] = point[Geom::Y]; pt[2] = 1; } argument
/inkscape/src/ui/
H A Ddraw-anchor.h8 #include <2geom/point.h>
/inkscape/src/2geom/
H A Dsolver.h38 #include <2geom/point.h>
H A Dintersection.h38 #include <2geom/point.h>
51 * By default, the intersection point will be halfway between the evaluated
60 /// Additionally report the intersection point.
67 /// Intersection point, as calculated by the intersection algorithm.
68 Point point() const { function in class:Geom::Intersection
100 // Recalculation of the intersection point from the time values is in many cases
120 result.push_back(Intersection<A, B>(in[i].second, in[i].first, in[i].point()));
/inkscape/src/display/
H A Dnr-filter-diffuselighting.h42 SPFePointLight *point; member in union:Inkscape::Filters::FilterDiffuseLighting::__anon25
H A Dnr-filter-specularlighting.h43 SPFePointLight *point; member in union:Inkscape::Filters::FilterSpecularLighting::__anon28
H A Dnr-filter-turbulence.h24 #include <2geom/point.h>
/inkscape/src/helper/
H A Dmathfns.h15 #include <2geom/point.h>
/inkscape/src/live_effects/parameter/
H A Darray.cpp13 #include <2geom/point.h>

Completed in 714 milliseconds

1234567