Searched refs:edgeTree (Results 1 – 14 of 14) sorted by relevance
/dports/cad/graywolf/graywolf-0.1.6-4-gf47937b/src/Ylib/ |
H A D | graph.c | 331 graph->edgeTree = Yrbtree_init( compare_edge ); 398 Yrbtree_free( graph->edgeTree, NULL ) ; 427 return (Yrbtree_size(graph->edgeTree)); 709 Yrbtree_delete(graph->edgeTree,edge,NULL); 893 Yrbtree_enumeratePush( graph->edgeTree); 902 Yrbtree_enumeratePop( graph->edgeTree); 1000 Yrbtree_intervalPush(graph->edgeTree); 1009 Yrbtree_intervalPop(graph->edgeTree); 1187 Yrbtree_insert(graph->edgeTree,edge2); 1901 tree = graph->edgeTree; [all …]
|
/dports/cad/horizon-eda/horizon-2.1.0/3rd_party/polypartition/ |
H A D | polypartition.cpp | 1363 std::set<ScanLineEdge> edgeTree; in MonotonePartition() local 1370 edgeTreeIterators[i] = edgeTree.end(); in MonotonePartition() 1390 edgeTreeRet = edgeTree.insert(newedge); in MonotonePartition() 1414 edgeIter = edgeTree.lower_bound(newedge); in MonotonePartition() 1415 if (edgeIter == edgeTree.begin()) { in MonotonePartition() 1431 edgeTreeRet = edgeTree.insert(newedge); in MonotonePartition() 1454 edgeIter = edgeTree.lower_bound(newedge); in MonotonePartition() 1455 if (edgeIter == edgeTree.begin()) { in MonotonePartition() 1491 edgeTreeRet = edgeTree.insert(newedge); in MonotonePartition() 1498 edgeIter = edgeTree.lower_bound(newedge); in MonotonePartition() [all …]
|
H A D | polypartition.h | 269 std::set<ScanLineEdge> *edgeTree, long *helpers);
|
/dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/polypartition/ |
H A D | polypartition.cpp | 1138 set<ScanLineEdge> edgeTree; in MonotonePartition() local 1161 edgeTreeRet = edgeTree.insert(newedge); in MonotonePartition() 1178 edgeTree.erase(edgeTreeIterators[v->previous]); in MonotonePartition() 1185 edgeIter = edgeTree.lower_bound(newedge); in MonotonePartition() 1186 if(edgeIter == edgeTree.begin()) { in MonotonePartition() 1202 edgeTreeRet = edgeTree.insert(newedge); in MonotonePartition() 1225 edgeIter = edgeTree.lower_bound(newedge); in MonotonePartition() 1226 if(edgeIter == edgeTree.begin()) { in MonotonePartition() 1262 edgeTreeRet = edgeTree.insert(newedge); in MonotonePartition() 1269 edgeIter = edgeTree.lower_bound(newedge); in MonotonePartition() [all …]
|
H A D | polypartition.h | 256 std::set<ScanLineEdge> *edgeTree, long *helpers);
|
/dports/devel/godot/godot-3.2.3-stable/thirdparty/misc/ |
H A D | triangulator.cpp | 1126 Set<ScanLineEdge> edgeTree; in MonotonePartition() local 1161 edgeTree.erase(edgeTreeIterators[v->previous]); in MonotonePartition() 1168 edgeIter = edgeTree.lower_bound(newedge); in MonotonePartition() 1169 if(edgeIter == edgeTree.front()) { in MonotonePartition() 1200 edgeTree.erase(edgeTreeIterators[v->previous]); in MonotonePartition() 1204 edgeIter = edgeTree.lower_bound(newedge); in MonotonePartition() 1205 if(edgeIter == edgeTree.front()) { in MonotonePartition() 1232 edgeTree.erase(edgeTreeIterators[v->previous]); in MonotonePartition() 1243 edgeIter = edgeTree.lower_bound(newedge); in MonotonePartition() 1244 if(edgeIter == edgeTree.front()) { in MonotonePartition() [all …]
|
H A D | triangulator.h | 183 Set<ScanLineEdge> *edgeTree, long *helpers);
|
/dports/devel/godot-tools/godot-3.2.3-stable/thirdparty/misc/ |
H A D | triangulator.cpp | 1126 Set<ScanLineEdge> edgeTree; in MonotonePartition() local 1161 edgeTree.erase(edgeTreeIterators[v->previous]); in MonotonePartition() 1168 edgeIter = edgeTree.lower_bound(newedge); in MonotonePartition() 1169 if(edgeIter == edgeTree.front()) { in MonotonePartition() 1200 edgeTree.erase(edgeTreeIterators[v->previous]); in MonotonePartition() 1204 edgeIter = edgeTree.lower_bound(newedge); in MonotonePartition() 1205 if(edgeIter == edgeTree.front()) { in MonotonePartition() 1232 edgeTree.erase(edgeTreeIterators[v->previous]); in MonotonePartition() 1243 edgeIter = edgeTree.lower_bound(newedge); in MonotonePartition() 1244 if(edgeIter == edgeTree.front()) { in MonotonePartition() [all …]
|
H A D | triangulator.h | 183 Set<ScanLineEdge> *edgeTree, long *helpers);
|
/dports/devel/godot2-tools/godot-2.1.6-stable/thirdparty/misc/ |
H A D | triangulator.cpp | 1126 Set<ScanLineEdge> edgeTree; in MonotonePartition() local 1161 edgeTree.erase(edgeTreeIterators[v->previous]); in MonotonePartition() 1168 edgeIter = edgeTree.lower_bound(newedge); in MonotonePartition() 1169 if(edgeIter == edgeTree.front()) { in MonotonePartition() 1200 edgeTree.erase(edgeTreeIterators[v->previous]); in MonotonePartition() 1204 edgeIter = edgeTree.lower_bound(newedge); in MonotonePartition() 1205 if(edgeIter == edgeTree.front()) { in MonotonePartition() 1232 edgeTree.erase(edgeTreeIterators[v->previous]); in MonotonePartition() 1243 edgeIter = edgeTree.lower_bound(newedge); in MonotonePartition() 1244 if(edgeIter == edgeTree.front()) { in MonotonePartition() [all …]
|
H A D | triangulator.h | 183 Set<ScanLineEdge> *edgeTree, long *helpers);
|
/dports/devel/godot2/godot-2.1.6-stable/thirdparty/misc/ |
H A D | triangulator.cpp | 1126 Set<ScanLineEdge> edgeTree; in MonotonePartition() local 1161 edgeTree.erase(edgeTreeIterators[v->previous]); in MonotonePartition() 1168 edgeIter = edgeTree.lower_bound(newedge); in MonotonePartition() 1169 if(edgeIter == edgeTree.front()) { in MonotonePartition() 1200 edgeTree.erase(edgeTreeIterators[v->previous]); in MonotonePartition() 1204 edgeIter = edgeTree.lower_bound(newedge); in MonotonePartition() 1205 if(edgeIter == edgeTree.front()) { in MonotonePartition() 1232 edgeTree.erase(edgeTreeIterators[v->previous]); in MonotonePartition() 1243 edgeIter = edgeTree.lower_bound(newedge); in MonotonePartition() 1244 if(edgeIter == edgeTree.front()) { in MonotonePartition() [all …]
|
H A D | triangulator.h | 183 Set<ScanLineEdge> *edgeTree, long *helpers);
|
/dports/graphics/wdune/wdune-1.926/vcglib/vcg/complex/algorithms/ |
H A D | curve_on_manifold.h | 379 KdTree<ScalarType> edgeTree(vdw); in MarkFauxEdgeWithPolyLine() 388 edgeTree.doQueryClosest(fi->P(i),veInd,sqdist); in MarkFauxEdgeWithPolyLine()
|