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

/inkscape/src/libavoid/
H A Drouter.h148 VertInfList vertices; member in class:Avoid::Router
/inkscape/src/libdepixelize/priv/
H A Dhomogeneoussplines.h54 std::vector< Point<T> > vertices; member in struct:Tracer::HomogeneousSplines::Polygon
197 CommonEdge common_edge = _common_edge(polygon_it->vertices,
198 cell_it->vertices);
207 = _common_edge(polygon_it->vertices,
208 polygon2_it->vertices);
223 polygon.vertices = cell_it->vertices;
234 SelfCommonEdge ce = _common_edge(it->vertices, it->vertices.rbegin());
237 it->vertices
[all...]
H A Dsimplifiedvoronoi.h46 // There may not exist more than 8 vertices per cell and a
50 // The vertices are filled in clockwise order
51 std::vector< Point<T> > vertices; member in struct:Tracer::SimplifiedVoronoi::Cell
305 cells_it->vertices.push_back(Point<T>(i, 0, false));
308 cells_it->vertices.push_back(Point<T>(i + 1, 0, false));
322 cells_it->vertices.push_back(Point<T>(i, 0, false));
325 cells_it->vertices.push_back(Point<T>(i + 1, 0, false));
328 cells_it->vertices.push_back(Point<T>(i + 1, 1, false));
331 cells_it->vertices.push_back(Point<T>(i, 1, false));
354 cells_it->vertices
924 Point<T> vertices[2] = {initial, initial}; local
[all...]
/inkscape/src/2geom/
H A Dtoposweep.h113 unsigned size() const { return vertices.size(); }
115 Vertex &operator[](unsigned ix) { return vertices[ix]; }
116 Vertex const &operator[](unsigned ix) const { return vertices[ix]; }
118 //removes both edges, and returns the vertices[ix][jx] one
121 //returns a graph with all zero degree vertices and unused edges removed
127 std::vector<Vertex> vertices; member in class:Geom::TopoGraph
H A Dtoposweep.cpp44 Vertex &v = vertices[ix];
49 v = vertices[ret.other];
62 for(unsigned i = 0; i < vertices.size(); i++) {
64 if(vertices[i].degree() != 0) vertices[ix++] = vertices[i];
68 for(unsigned j = 0; j < vertices[i].degree(); j++)
69 vertices[i][j].other = vix[vertices[i][j].other];
74 for(unsigned i = 0; i < vertices
223 find_vertex(std::vector<TopoGraph::Vertex> const &vertices, Point p, double tol) argument
[all...]
/inkscape/src/extension/internal/
H A Demf-print.cpp797 returned PathVector is an empty path. If the input path is already just straight lines and vertices the output will be the
800 Geom::Path PrintEmf::pathv_to_simple_polygon(Geom::PathVector const &pathv, int *vertices) argument
813 *vertices = 0;
821 *vertices = 0;
833 if(!*vertices){
841 *vertices += 2;
845 *vertices += 1;
863 int vertices; local
864 Geom::Path pR = pathv_to_simple_polygon(pathv, &vertices);
866 if(vertices
[all...]

Completed in 27 milliseconds