Home
last modified time | relevance | path

Searched full:triangle (Results 1 – 25 of 173) sorted by relevance

1234567

/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() argument
93 if (neighbors_[0] == triangle) in ClearNeighbor()
97 else if (neighbors_[1] == triangle) in ClearNeighbor()
107 void Triangle::ClearNeighbors() in ClearNeighbors()
114 void Triangle::ClearDelunayEdges() in ClearDelunayEdges()
[all …]
H A Dshapes.h147 // Triangle-based data structures are know to have better performance than quad-edge structures
148 // See: J. Shewchuk, "Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator"
150 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);
[all …]
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/poly2tri/sweep/
H A Dsweep.h50 class Triangle; variable
79 * create a new triangle. If needed new holes and basins
97 void EdgeEvent(SweepContext& tcx, Point& ep, Point& eq, Triangle* triangle, Point& point);
100 * Creates a new front triangle and legalize it
110 * Adds a triangle to the advancing front to fill a hole.
117 * Returns true if triangle was legalized
119 bool Legalize(SweepContext& tcx, Triangle& t);
123 * 1. a,b and c form a triangle.<br>
139 * @param a - triangle point, opposite d
140 * @param b - triangle point
[all …]
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() argument
119 map_.push_back(triangle); in AddToMap()
132 // Initial triangle in CreateAdvancingFront()
133 Triangle* triangle = new Triangle(*points_[0], *tail_, *head_); in CreateAdvancingFront() local
135 map_.push_back(triangle); in CreateAdvancingFront()
137 af_head_ = new Node(*triangle->GetPoint(1), *triangle); in CreateAdvancingFront()
138 af_middle_ = new Node(*triangle->GetPoint(0), *triangle); in CreateAdvancingFront()
139 af_tail_ = new Node(*triangle->GetPoint(2)); in CreateAdvancingFront()
[all …]
H A Dsweep.cpp64 // Get an Internal triangle to start with in FinalizationPolygon()
65 Triangle* t = tcx.front()->head()->next->triangle; in FinalizationPolygon()
97 if (IsEdgeSideOfTriangle(*node->triangle, *edge->p, *edge->q)) { in EdgeEvent()
105 EdgeEvent(tcx, *edge->p, *edge->q, node->triangle, *edge->q); in EdgeEvent()
108 void Sweep::EdgeEvent(SweepContext& tcx, Point& ep, Point& eq, Triangle* triangle, Point& point) in EdgeEvent() argument
110 if (IsEdgeSideOfTriangle(*triangle, ep, eq)) { in EdgeEvent()
114 Point* p1 = triangle->PointCCW(point); in EdgeEvent()
117 if ( triangle->Contains(&eq, p1)) { in EdgeEvent()
118 triangle->MarkConstrainedEdge(&eq, p1 ); in EdgeEvent()
122 triangle = &triangle->NeighborAcross(point); in EdgeEvent()
[all …]
H A Dsweep_context.h41 // Initial triangle factor, seed triangle will extend 30% of
46 class Triangle; variable
75 /// Try to map a node to all sides of this triangle that don't have a neighbor
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_;
[all …]
H A Dadvancing_front.h44 Triangle* triangle; member
51 Node(Point& p) : point(&p), triangle(NULL), next(NULL), prev(NULL), value(p.x) in Node()
55 Node(Point& p, Triangle& t) : point(&p), triangle(&t), next(NULL), prev(NULL), value(p.x) in Node()
H A Dcdt.h85 std::vector<Triangle*> GetTriangles();
88 * Get triangle map
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()
/OK3568_Linux_fs/yocto/poky/bitbake/lib/toaster/toastergui/static/css/
H A Djquery-ui.theme.min.css5 …triangle-1-n{background-position:0 -16px}.ui-icon-triangle-1-ne{background-position:-16px -16px}.u…
H A Djquery-ui.min.css7 …triangle-1-n{background-position:0 -16px}.ui-icon-triangle-1-ne{background-position:-16px -16px}.u…
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/src/mbgl/gl/
H A Ddraw_mode.hpp55 using Primitive = Triangle;
63 // TriangleStrip is a form of "Triangle" rendering, but the element buffer
65 using Primitive = Triangle;
/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,
/OK3568_Linux_fs/external/linux-rga/samples/utils/3rdparty/libdrm/include/libdrm/
H A Dsavage_drm.h146 #define SAVAGE_PRIM_TRILIST 0 /* triangle list */
147 #define SAVAGE_PRIM_TRISTRIP 1 /* triangle strip */
148 #define SAVAGE_PRIM_TRIFAN 2 /* triangle fan */
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/libc/usr/include/drm/
H A Dsavage_drm.h146 #define SAVAGE_PRIM_TRILIST 0 /* triangle list */
147 #define SAVAGE_PRIM_TRISTRIP 1 /* triangle strip */
148 #define SAVAGE_PRIM_TRIFAN 2 /* triangle fan */
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/libc/usr/include/drm/
H A Dsavage_drm.h146 #define SAVAGE_PRIM_TRILIST 0 /* triangle list */
147 #define SAVAGE_PRIM_TRISTRIP 1 /* triangle strip */
148 #define SAVAGE_PRIM_TRIFAN 2 /* triangle fan */
/OK3568_Linux_fs/external/camera_engine_rkaiq/rkisp_demo/demo/include/libdrm/
H A Dsavage_drm.h146 #define SAVAGE_PRIM_TRILIST 0 /* triangle list */
147 #define SAVAGE_PRIM_TRISTRIP 1 /* triangle strip */
148 #define SAVAGE_PRIM_TRIFAN 2 /* triangle fan */
/OK3568_Linux_fs/kernel/include/uapi/drm/
H A Dsavage_drm.h146 #define SAVAGE_PRIM_TRILIST 0 /* triangle list */
147 #define SAVAGE_PRIM_TRISTRIP 1 /* triangle strip */
148 #define SAVAGE_PRIM_TRIFAN 2 /* triangle fan */
/OK3568_Linux_fs/external/linux-rga/samples/im2d_slt/third-party/libdrm/include/libdrm/
H A Dsavage_drm.h146 #define SAVAGE_PRIM_TRILIST 0 /* triangle list */
147 #define SAVAGE_PRIM_TRISTRIP 1 /* triangle strip */
148 #define SAVAGE_PRIM_TRIFAN 2 /* triangle fan */
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/src/mbgl/renderer/buckets/
H A Dline_bucket.cpp225 // just draw a miter join to save a triangle. in addGeometry()
281 // Bevel joins fill the gap between segments with a single pie slice triangle. in addGeometry()
386 for (const auto& triangle : triangleStore) { in addGeometry() local
387 triangles.emplace_back(index + triangle.a, index + triangle.b, index + triangle.c); in addGeometry()
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/earcut/0.12.4/include/mapbox/
H A Dearcut.hpp266 // cut off the triangle in earcutLinked()
329 // triangle bbox; min & max are calculated like this for speed in isEarHashed()
335 // z-order range for the current triangle bbox; in isEarHashed()
339 // first look for points inside the triangle in increasing z-order in isEarHashed()
484 // look for points inside the triangle of hole Vertex, segment intersection and endpoint; in findHoleBridge()
636 // check if a point lies within a convex triangle
651 // signed area of a triangle
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/plugins/geoservices/mapbox/
H A Dmapbox.qrc138 <file alias="triangle-stroked">maki-4.0.0/triangle-stroked.svg</file>
139 <file alias="triangle.svg">maki-4.0.0/triangle.svg</file>

1234567