| /dports/graphics/wdune/wdune-1.926/src/ |
| H A D | sweep.h | 49 struct TriEdge;
95 void EdgeEvent(SweepContext& tcx, TriEdge* edge, TriNode* node);
215 void FillEdgeEvent(SweepContext& tcx, TriEdge* edge, TriNode* node);
217 void FillRightAboveEdgeEvent(SweepContext& tcx, TriEdge* edge, TriNode* node);
219 void FillRightBelowEdgeEvent(SweepContext& tcx, TriEdge* edge, TriNode& node);
221 void FillRightConcaveEdgeEvent(SweepContext& tcx, TriEdge* edge, TriNode& node);
223 void FillRightConvexEdgeEvent(SweepContext& tcx, TriEdge* edge, TriNode& node);
225 void FillLeftAboveEdgeEvent(SweepContext& tcx, TriEdge* edge, TriNode* node);
227 void FillLeftBelowEdgeEvent(SweepContext& tcx, TriEdge* edge, TriNode& node);
229 void FillLeftConcaveEdgeEvent(SweepContext& tcx, TriEdge* edge, TriNode& node);
[all …]
|
| H A D | shapes.h | 43 struct TriEdge;
57 std::vector<TriEdge*> edge_list;
123 struct TriEdge { struct
128 TriEdge(Point& p1, Point& p2) : p(&p1), q(&p2) in TriEdge() argument
171 void MarkConstrainedEdge(TriEdge& edge);
189 bool Contains(const TriEdge& e);
301 inline bool Triangle::Contains(const TriEdge& e) in Contains()
|
| H A D | sweep_context.h | 48 struct TriEdge;
97 std::vector<TriEdge*> edge_list;
121 TriEdge* constrained_edge;
|
| H A D | sweep.cpp | 91 void Sweep::EdgeEvent(SweepContext& tcx, TriEdge* edge, TriNode* node) in EdgeEvent()
562 void Sweep::FillEdgeEvent(SweepContext& tcx, TriEdge* edge, TriNode* node) in FillEdgeEvent()
571 void Sweep::FillRightAboveEdgeEvent(SweepContext& tcx, TriEdge* edge, TriNode* node) in FillRightAboveEdgeEvent()
583 void Sweep::FillRightBelowEdgeEvent(SweepContext& tcx, TriEdge* edge, TriNode& node) in FillRightBelowEdgeEvent()
598 void Sweep::FillRightConcaveEdgeEvent(SweepContext& tcx, TriEdge* edge, TriNode& node) in FillRightConcaveEdgeEvent()
616 void Sweep::FillRightConvexEdgeEvent(SweepContext& tcx, TriEdge* edge, TriNode& node) in FillRightConvexEdgeEvent()
634 void Sweep::FillLeftAboveEdgeEvent(SweepContext& tcx, TriEdge* edge, TriNode* node) in FillLeftAboveEdgeEvent()
646 void Sweep::FillLeftBelowEdgeEvent(SweepContext& tcx, TriEdge* edge, TriNode& node) in FillLeftBelowEdgeEvent()
661 void Sweep::FillLeftConvexEdgeEvent(SweepContext& tcx, TriEdge* edge, TriNode& node) in FillLeftConvexEdgeEvent()
679 void Sweep::FillLeftConcaveEdgeEvent(SweepContext& tcx, TriEdge* edge, TriNode& node) in FillLeftConcaveEdgeEvent()
|
| H A D | sweep_context.cpp | 103 edge_list.push_back(new TriEdge(*polyline[i], *polyline[j])); in InitEdges()
|
| H A D | shapes.cpp | 195 void Triangle::MarkConstrainedEdge(TriEdge& edge) in MarkConstrainedEdge()
|
| /dports/math/py-matplotlib/matplotlib-3.4.3/src/tri/ |
| H A D | _tri.h | 79 struct TriEdge struct
81 TriEdge();
82 TriEdge(int tri_, int edge_);
83 bool operator<(const TriEdge& other) const;
84 bool operator==(const TriEdge& other) const;
85 bool operator!=(const TriEdge& other) const;
173 typedef std::vector<TriEdge> Boundary;
212 void get_boundary_edge(const TriEdge& triEdge,
225 TriEdge get_neighbor_edge(int tri, int edge) const;
420 TriEdge& tri_edge,
[all …]
|
| H A D | _tri.cpp | 20 TriEdge::TriEdge() in TriEdge() function in TriEdge
24 TriEdge::TriEdge(int tri_, int edge_) in TriEdge() function in TriEdge
28 bool TriEdge::operator<(const TriEdge& other) const in operator <()
36 bool TriEdge::operator==(const TriEdge& other) const in operator ==()
41 bool TriEdge::operator!=(const TriEdge& other) const in operator !=()
244 typedef std::set<TriEdge> BoundaryEdges; in calculate_boundaries()
268 boundary.push_back(TriEdge(tri, edge)); in calculate_boundaries()
342 typedef std::map<Edge, TriEdge> EdgeToTriEdgeMap; in calculate_neighbors()
489 return TriEdge(-1,-1); in get_neighbor_edge()
491 return TriEdge(neighbor_tri, in get_neighbor_edge()
[all …]
|
| /dports/math/py-matplotlib2/matplotlib-2.2.4/lib/matplotlib/tri/ |
| H A D | _tri.h | 79 struct TriEdge struct
81 TriEdge();
82 TriEdge(int tri_, int edge_);
83 bool operator<(const TriEdge& other) const;
84 bool operator==(const TriEdge& other) const;
85 bool operator!=(const TriEdge& other) const;
173 typedef std::vector<TriEdge> Boundary;
212 void get_boundary_edge(const TriEdge& triEdge,
225 TriEdge get_neighbor_edge(int tri, int edge) const;
420 TriEdge& tri_edge,
[all …]
|
| H A D | _tri.cpp | 20 TriEdge::TriEdge() in TriEdge() function in TriEdge
24 TriEdge::TriEdge(int tri_, int edge_) in TriEdge() function in TriEdge
28 bool TriEdge::operator<(const TriEdge& other) const in operator <()
36 bool TriEdge::operator==(const TriEdge& other) const in operator ==()
41 bool TriEdge::operator!=(const TriEdge& other) const in operator !=()
244 typedef std::set<TriEdge> BoundaryEdges; in calculate_boundaries()
268 boundary.push_back(TriEdge(tri, edge)); in calculate_boundaries()
342 typedef std::map<Edge, TriEdge> EdgeToTriEdgeMap; in calculate_neighbors()
489 return TriEdge(-1,-1); in get_neighbor_edge()
491 return TriEdge(neighbor_tri, in get_neighbor_edge()
[all …]
|
| /dports/cad/meshlab/meshlab-Meshlab-2020.05/src/meshlabplugins/filter_isoparametrization/ |
| H A D | diam_topology.h | 35 typedef std::pair<AbstractFace*,int> TriEdge; typedef
38 std::map<TriEdge,int> edgeMap;
58 TriEdge key=TriEdge(f0,j); in InsertEdges()
59 edgeMap.insert(std::pair<TriEdge,int>(key,index)); in InsertEdges()
|