Home
last modified time | relevance | path

Searched refs:constrained_edge (Results 1 – 5 of 5) sorted by relevance

/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/poly2tri/common/
H A Dshapes.cpp40 constrained_edge[0] = constrained_edge[1] = constrained_edge[2] = false; in Triangle()
191 constrained_edge[index] = true; in MarkConstrainedEdge()
203 constrained_edge[2] = true; in MarkConstrainedEdge()
205 constrained_edge[1] = true; in MarkConstrainedEdge()
207 constrained_edge[0] = true; in MarkConstrainedEdge()
262 return constrained_edge[2]; in GetConstrainedEdgeCCW()
264 return constrained_edge[0]; in GetConstrainedEdgeCCW()
266 return constrained_edge[1]; in GetConstrainedEdgeCCW()
272 return constrained_edge[1]; in GetConstrainedEdgeCW()
274 return constrained_edge[2]; in GetConstrainedEdgeCW()
[all …]
H A Dshapes.h157 bool constrained_edge[3]; variable
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/poly2tri/sweep/
H A Dsweep_context.h121 Edge* constrained_edge; member
124 EdgeEvent() : constrained_edge(NULL), right(false) in EdgeEvent()
H A Dsweep.cpp94 tcx.edge_event.constrained_edge = edge; in EdgeEvent()
121 tcx.edge_event.constrained_edge->q = p1; in EdgeEvent()
138 tcx.edge_event.constrained_edge->q = p2; in EdgeEvent()
350 if (ot->constrained_edge[oi] || ot->delaunay_edge[oi]) { in Legalize()
351 t.constrained_edge[i] = ot->constrained_edge[oi]; in Legalize()
720 if (eq == *tcx.edge_event.constrained_edge->q && ep == *tcx.edge_event.constrained_edge->p) { in FlipEdgeEvent()
H A Dsweep_context.cpp184 if (!t->constrained_edge[i]) in MeshClean()