Searched defs:edge (Results 1 - 8 of 8) sorted by relevance

/inkscape/src/libavoid/
H A Dshape.cpp238 EdgeInfList::const_iterator edge; local
239 while ((edge = visList.begin()) != finish)
241 // Remove each visibility edge
242 (*edge)->alertConns();
243 delete (*edge);
248 while ((edge = invisList.begin()) != finish)
250 // Remove each invisibility edge
251 delete (*edge);
256 while ((edge = orthogList.begin()) != finish)
258 // Remove each orthogonal visibility edge
[all...]
H A Dvertices.cpp214 EdgeInfList::const_iterator edge; local
215 while ((edge = visList.begin()) != finish)
217 // Remove each visibility edge
218 (*edge)->alertConns();
219 delete (*edge);
223 while ((edge = orthogVisList.begin()) != finish)
225 // Remove each orthogonal visibility edge.
226 (*edge)->alertConns();
227 delete (*edge);
231 while ((edge
[all...]
H A Dgraph.cpp136 // Effectively the same visibility edge, so they are equal.
350 db_printf("\tChecking visibility for existing invisibility edge..."
356 db_printf("\tChecking visibility for existing visibility edge..."
389 // Don't even check this edge, it should be zero,
413 // Don't even check this edge, it should be zero,
423 // if i and j see each other, add edge
424 db_printf("\tSetting visibility edge... \n\t\t");
441 // if i and j can't see each other, add blank edge
442 db_printf("\tSetting invisibility edge... \n\t\t");
524 // Returns true if this edge i
552 EdgeInf *edge = NULL; local
662 addEdge(EdgeInf *edge) argument
691 removeEdge(EdgeInf *edge) argument
[all...]
H A Dvisibility.cpp396 // blocking edge then ignore that edge.
416 // This is not a containing edge so do the normal
426 // Touching, but centerPoint is on another edge of
432 // This was a containing edge, so consider the next along.
439 // edge blocking this ray.
448 // Touching, but centerPoint is on another edge of
508 // Don't include edge points of containing shapes.
620 EdgeInf *edge = EdgeInf::existingEdge(centerInf, currInf); local
621 if (edge
[all...]
H A Dconnector.cpp397 EdgeInf *edge = new EdgeInf( local
401 edge->setDist(0.001);
840 // TODO: Could we know this edge already?
841 EdgeInf *edge = EdgeInf::existingEdge(_srcVert, tar); local
842 COLA_ASSERT(edge != NULL);
843 edge->addCycleBlocker();
860 // TODO: Again, we could know this edge without searching.
861 EdgeInf *edge = EdgeInf::existingEdge(i, i->pathNext); local
862 COLA_ASSERT(edge != NULL);
863 edge
[all...]
H A Dorthogonal.cpp257 // Find the first Node above in the scanline that is a shape edge,
274 // Find the first Node below in the scanline that is a shape edge,
292 // to see to this shape edge.
307 // to see to this shape edge.
332 // Find the first blocking edge above this point. Don't count the
361 // Find the first blocking edge below this point. Don't count the
785 // Add visibility edge(s) for this segment. There may be multiple if
795 // Add visibility edge(s) for this segment up until an intersection.
934 EdgeInf *edge = new local
936 edge
951 EdgeInf *edge = new local
976 EdgeInf *edge = local
[all...]
/inkscape/src/libcola/
H A Dstraightener.cpp146 //cerr << "edge(intersections="<<bs.size()<<":("<<e->startNode<<","<<e->endNode<<"))"<<endl;
155 // if edge is connected (start or end) to v then skip
156 // need to record start and end positions of edge segment!
160 //cerr << "edge("<<e->startNode<<","<<e->endNode<<",pts="<<e->pts<<")"<<endl;
176 // if edge is connected (start or end) to v then skip
177 // need to record start and end positions of edge segment!
181 //cerr << "edge("<<e->startNode<<","<<e->endNode<<",pts="<<e->pts<<")"<<endl;
267 // node is on an edge
268 Edge *edge=(*i)->edge; local
[all...]
H A Dstraightener.h96 Edge *edge; member in class:straightener::Node
104 edge(NULL),dummy(false),weight(-0.1),open(false) { }
113 edge(e),dummy(true),weight(-0.1) {

Completed in 181 milliseconds