Lines Matching refs:edges
39 * removes all problems a polygon can present: duplicate points or edges, self-intersection. you end up with a
46 shape_graph = 0, // it's just a graph; a bunch of edges, maybe intersections
47 shape_polygon = 1, // a polygon: intersection-free, edges oriented so that the inside is on their left
72 { // info for edges, treated as approximation of edges of the voronoi diagram
126 // -reset the graph, and ensure there's room for n points and m edges
138 // -edges:
149 void SwapEdges(int a, int b); // swaps 2 edges
150 void SwapEdges(int a, int b, int c); // swaps 3 edges
151 void SortEdges(); // sort the edges if needed (checks the need_edges_sorting falg)
259 // invert=true: make as if you inverted all edges in the source
261 // all that's missing are the correct directions of the edges
265 // duplicate edges+no duplicate points)
291 // the offset is dec, with joins between edges of type "join" (see LivarotDefs.h)
362 // lists of the nodes and edges
391 int weight; // weight of the edge (to handle multiple edges)
396 // used to determine the "most horizontal" edge between 2 edges
420 int ind; // order of the edges during the depth-first search
449 { // temporary array of edges for easier sorting
479 void SortEdgesList(edge_list *edges, int s, int e);
534 bool _need_edges_sorting; ///< edges have been added: maybe they are not ordered clockwise