Home
last modified time | relevance | path

Searched refs:Triangle (Results 1 – 25 of 28) sorted by relevance

12

/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/poly2tri/common/
H A Dshapes.cpp36 Triangle::Triangle(Point& a, Point& b, Point& c) in Triangle() function in p2t::Triangle
46 void Triangle::MarkNeighbor(Point* p1, Point* p2, Triangle* t) in MarkNeighbor()
59 void Triangle::MarkNeighbor(Triangle& t) in MarkNeighbor()
76 void Triangle::Clear() in Clear()
78 Triangle *t; in Clear()
91 void Triangle::ClearNeighbor(Triangle *triangle ) in ClearNeighbor()
107 void Triangle::ClearNeighbors() in ClearNeighbors()
114 void Triangle::ClearDelunayEdges() in ClearDelunayEdges()
119 Point* Triangle::OppositePoint(Triangle& t, Point& p) in OppositePoint()
126 void Triangle::Legalize(Point& point) in Legalize()
[all …]
H A Dshapes.h150 class Triangle {
154 Triangle(Point& a, Point& b, Point& c);
164 Point* OppositePoint(Triangle& t, Point& p);
166 Triangle* GetNeighbor(const int& index);
167 void MarkNeighbor(Point* p1, Point* p2, Triangle* t);
168 void MarkNeighbor(Triangle& t);
177 Triangle* NeighborCW(Point& point);
178 Triangle* NeighborCCW(Point& point);
197 void ClearNeighbor(Triangle *triangle );
204 Triangle& NeighborAcross(Point& opoint);
[all …]
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/poly2tri/sweep/
H A Dsweep.h50 class Triangle; variable
97 void EdgeEvent(SweepContext& tcx, Point& ep, Point& eq, Triangle* triangle, Point& point);
119 bool Legalize(SweepContext& tcx, Triangle& t);
161 void RotateTrianglePair(Triangle& t, Point& p, Triangle& ot, Point& op);
213 bool IsEdgeSideOfTriangle(Triangle& triangle, Point& ep, Point& eq);
233 void FlipEdgeEvent(SweepContext& tcx, Point& ep, Point& eq, Triangle* t, Point& p);
247Triangle& NextFlipTriangle(SweepContext& tcx, int o, Triangle& t, Triangle& ot, Point& p, Point& …
260 Point& NextFlipPoint(Point& ep, Point& eq, Triangle& ot, Point& op);
275 …void FlipScanEdgeEvent(SweepContext& tcx, Point& ep, Point& eq, Triangle& flip_triangle, Triangle&…
H A Dsweep_context.cpp65 std::vector<Triangle*> SweepContext::GetTriangles() in GetTriangles()
70 std::list<Triangle*> SweepContext::GetMap() in GetMap()
117 void SweepContext::AddToMap(Triangle* triangle) in AddToMap()
133 Triangle* triangle = new Triangle(*points_[0], *tail_, *head_); in CreateAdvancingFront()
155 void SweepContext::MapTriangleToNodes(Triangle& t) in MapTriangleToNodes()
166 void SweepContext::RemoveFromMap(Triangle* triangle) in RemoveFromMap()
171 void SweepContext::MeshClean(Triangle& triangle) in MeshClean()
173 std::vector<Triangle *> triangles; in MeshClean()
177 Triangle *t = triangles.back(); in MeshClean()
203 typedef std::list<Triangle*> type_list; in ~SweepContext()
[all …]
H A Dsweep_context.h46 class Triangle; variable
76 void MapTriangleToNodes(Triangle& t);
78 void AddToMap(Triangle* triangle);
84 void RemoveFromMap(Triangle* triangle);
92 void MeshClean(Triangle& triangle);
94 std::vector<Triangle*> GetTriangles();
95 std::list<Triangle*> GetMap();
136 std::vector<Triangle*> triangles_;
137 std::list<Triangle*> map_;
H A Dsweep.cpp65 Triangle* t = tcx.front()->head()->next->triangle; in FinalizationPolygon()
108 void Sweep::EdgeEvent(SweepContext& tcx, Point& ep, Point& eq, Triangle* triangle, Point& point) in EdgeEvent()
163 bool Sweep::IsEdgeSideOfTriangle(Triangle& triangle, Point& ep, Point& eq) in IsEdgeSideOfTriangle()
169 Triangle* t = triangle.GetNeighbor(index); in IsEdgeSideOfTriangle()
180 Triangle* triangle = new Triangle(point, *node.point, *node.next->point); in NewFrontTriangle()
202 Triangle* triangle = new Triangle(*node.prev->point, *node.point, *node.next->point); in Fill()
333 bool Sweep::Legalize(SweepContext& tcx, Triangle& t) in Legalize()
341 Triangle* ot = t.GetNeighbor(i); in Legalize()
430 void Sweep::RotateTrianglePair(Triangle& t, Point& p, Triangle& ot, Point& op) in RotateTrianglePair()
432 Triangle* n1, *n2, *n3, *n4; in RotateTrianglePair()
[all …]
H A Dcdt.h85 std::vector<Triangle*> GetTriangles();
90 std::list<Triangle*> GetMap();
H A Dcdt.cpp55 std::vector<p2t::Triangle*> CDT::GetTriangles() in GetTriangles()
60 std::list<p2t::Triangle*> CDT::GetMap() in GetMap()
H A Dadvancing_front.h44 Triangle* triangle;
55 Node(Point& p, Triangle& t) : point(&p), triangle(&t), next(NULL), prev(NULL), value(p.x) in Node()
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/src/mbgl/programs/
H A Dline_program.hpp39 gl::Triangle,
103 gl::Triangle,
134 gl::Triangle,
H A Dbackground_program.hpp60 gl::Triangle,
71 gl::Triangle,
H A Dfill_program.hpp61 gl::Triangle,
81 gl::Triangle,
H A Dfill_extrusion_program.hpp81 gl::Triangle,
112 gl::Triangle,
H A Dclipping_mask_program.hpp13 gl::Triangle,
H A Dextrusion_texture_program.hpp14 gl::Triangle,
H A Dheatmap_texture_program.hpp18 gl::Triangle,
H A Dheatmap_program.hpp18 gl::Triangle,
H A Dcircle_program.hpp18 gl::Triangle,
H A Dhillshade_prepare_program.hpp18 gl::Triangle,
H A Dsymbol_program.hpp344 gl::Triangle,
383 gl::Triangle,
405 gl::Triangle,
H A Dhillshade_program.hpp22 gl::Triangle,
H A Draster_program.hpp28 gl::Triangle,
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/src/mbgl/gl/
H A Ddraw_mode.hpp55 using Primitive = Triangle;
65 using Primitive = Triangle;
H A Dprimitives.hpp16 class Triangle { class
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/clip2tri/
H A Dclip2tri.cpp361 vector<p2t::Triangle*> currentOutput = cdt->GetTriangles(); in triangulateComplex()
364 p2t::Triangle *currentTriangle; in triangulateComplex()

12