Home
last modified time | relevance | path

Searched refs:convex (Results 1 – 25 of 6377) sorted by relevance

12345678910>>...256

/dports/math/couenne/Couenne-releases-0.5.8/Couenne/src/expression/
H A DMakefile.am40 ../convex/operators/conv-exprAbs.cpp \
41 ../convex/operators/conv-exprDiv.cpp \
42 ../convex/operators/conv-exprMul.cpp \
49 ../convex/operators/conv-exprOpp.cpp \
50 ../convex/operators/conv-exprPow.cpp \
53 ../convex/operators/powNewton.cpp \
54 ../convex/operators/conv-exprSub.cpp \
55 ../convex/operators/conv-exprSum.cpp \
56 ../convex/operators/conv-exprInv.cpp \
62 ../convex/operators/trigNewton.cpp \
[all …]
H A DMakefile.in373 ../convex/operators/conv-exprAbs.cpp \
374 ../convex/operators/conv-exprDiv.cpp \
375 ../convex/operators/conv-exprMul.cpp \
382 ../convex/operators/conv-exprOpp.cpp \
383 ../convex/operators/conv-exprPow.cpp \
386 ../convex/operators/powNewton.cpp \
387 ../convex/operators/conv-exprSub.cpp \
388 ../convex/operators/conv-exprSum.cpp \
389 ../convex/operators/conv-exprInv.cpp \
395 ../convex/operators/trigNewton.cpp \
[all …]
/dports/math/vtk8/VTK-8.2.0/Common/DataModel/Testing/Cxx/
H A DTestPolygon.cxx66 bool convex; in TestPolygon() local
67 convex = polygon->IsConvex(); in TestPolygon()
68 convex &= vtkPolygon::IsConvex(polygon->GetPoints(), in TestPolygon()
71 convex &= vtkPolygon::IsConvex(polygon->GetPoints()); in TestPolygon()
73 if (!convex) in TestPolygon()
120 bool convex; in TestPolygon() local
121 convex = polygon->IsConvex(); in TestPolygon()
127 if (!convex) in TestPolygon()
148 bool convex; in TestPolygon() local
149 convex = polygon->IsConvex(); in TestPolygon()
[all …]
/dports/math/vtk9/VTK-9.1.0/Common/DataModel/Testing/Cxx/
H A DTestPolygon.cxx66 bool convex; in TestPolygon() local
67 convex = polygon->IsConvex(); in TestPolygon()
70 convex &= vtkPolygon::IsConvex(polygon->GetPoints()); in TestPolygon()
72 if (!convex) in TestPolygon()
117 bool convex; in TestPolygon() local
118 convex = polygon->IsConvex(); in TestPolygon()
121 convex &= vtkPolygon::IsConvex(polygon->GetPoints()); in TestPolygon()
123 if (!convex) in TestPolygon()
142 bool convex; in TestPolygon() local
143 convex = polygon->IsConvex(); in TestPolygon()
[all …]
/dports/astro/stellarium/stellarium-0.21.3/src/core/
H A DStelGeodesicGrid.cpp332 for (int h=0;h<convex.size();h++) in searchZones()
334 const SphericalCap& half_space(convex.at(h)); in searchZones()
343 convex,halfs_used,convex.size(), in searchZones()
356 const QVector<SphericalCap>&convex, in searchZones() argument
418 const SphericalCap& half_space(convex.at(i)); in searchZones()
424 convex,halfs_used,halfs_used_count, in searchZones()
428 convex,halfs_used,halfs_used_count, in searchZones()
432 convex,halfs_used,halfs_used_count, in searchZones()
436 convex,halfs_used,halfs_used_count, in searchZones()
465 lastSearchRegion = convex; in search()
[all …]
/dports/devel/py-bullet3/bullet3-3.21/src/Bullet3Collision/NarrowPhaseCollision/
H A Db3CpuNarrowPhase.cpp236 convex.mC = convexPtr->mC; in registerConvexHullShapeInternal()
237 convex.mE = convexPtr->mE; in registerConvexHullShapeInternal()
238 convex.m_extents = convexPtr->m_extents; in registerConvexHullShapeInternal()
239 convex.m_localCenter = convexPtr->m_localCenter; in registerConvexHullShapeInternal()
240 convex.m_radius = convexPtr->m_radius; in registerConvexHullShapeInternal()
242 convex.m_numUniqueEdges = convexPtr->m_uniqueEdges.size(); in registerConvexHullShapeInternal()
244 convex.m_uniqueEdgesOffset = edgeOffset; in registerConvexHullShapeInternal()
256 convex.m_faceOffset = faceOffset; in registerConvexHullShapeInternal()
257 convex.m_numFaces = convexPtr->m_faces.size(); in registerConvexHullShapeInternal()
279 convex.m_numVertices = convexPtr->m_vertices.size(); in registerConvexHullShapeInternal()
[all …]
/dports/devel/godot/godot-3.2.3-stable/thirdparty/bullet/Bullet3Collision/NarrowPhaseCollision/
H A Db3CpuNarrowPhase.cpp236 convex.mC = convexPtr->mC; in registerConvexHullShapeInternal()
237 convex.mE = convexPtr->mE; in registerConvexHullShapeInternal()
238 convex.m_extents = convexPtr->m_extents; in registerConvexHullShapeInternal()
239 convex.m_localCenter = convexPtr->m_localCenter; in registerConvexHullShapeInternal()
240 convex.m_radius = convexPtr->m_radius; in registerConvexHullShapeInternal()
242 convex.m_numUniqueEdges = convexPtr->m_uniqueEdges.size(); in registerConvexHullShapeInternal()
244 convex.m_uniqueEdgesOffset = edgeOffset; in registerConvexHullShapeInternal()
256 convex.m_faceOffset = faceOffset; in registerConvexHullShapeInternal()
257 convex.m_numFaces = convexPtr->m_faces.size(); in registerConvexHullShapeInternal()
279 convex.m_numVertices = convexPtr->m_vertices.size(); in registerConvexHullShapeInternal()
[all …]
/dports/devel/godot-tools/godot-3.2.3-stable/thirdparty/bullet/Bullet3Collision/NarrowPhaseCollision/
H A Db3CpuNarrowPhase.cpp236 convex.mC = convexPtr->mC; in registerConvexHullShapeInternal()
237 convex.mE = convexPtr->mE; in registerConvexHullShapeInternal()
238 convex.m_extents = convexPtr->m_extents; in registerConvexHullShapeInternal()
239 convex.m_localCenter = convexPtr->m_localCenter; in registerConvexHullShapeInternal()
240 convex.m_radius = convexPtr->m_radius; in registerConvexHullShapeInternal()
242 convex.m_numUniqueEdges = convexPtr->m_uniqueEdges.size(); in registerConvexHullShapeInternal()
244 convex.m_uniqueEdgesOffset = edgeOffset; in registerConvexHullShapeInternal()
256 convex.m_faceOffset = faceOffset; in registerConvexHullShapeInternal()
257 convex.m_numFaces = convexPtr->m_faces.size(); in registerConvexHullShapeInternal()
279 convex.m_numVertices = convexPtr->m_vertices.size(); in registerConvexHullShapeInternal()
[all …]
/dports/devel/bullet/bullet3-3.21/src/Bullet3Collision/NarrowPhaseCollision/
H A Db3CpuNarrowPhase.cpp236 convex.mC = convexPtr->mC; in registerConvexHullShapeInternal()
237 convex.mE = convexPtr->mE; in registerConvexHullShapeInternal()
238 convex.m_extents = convexPtr->m_extents; in registerConvexHullShapeInternal()
239 convex.m_localCenter = convexPtr->m_localCenter; in registerConvexHullShapeInternal()
240 convex.m_radius = convexPtr->m_radius; in registerConvexHullShapeInternal()
242 convex.m_numUniqueEdges = convexPtr->m_uniqueEdges.size(); in registerConvexHullShapeInternal()
244 convex.m_uniqueEdgesOffset = edgeOffset; in registerConvexHullShapeInternal()
256 convex.m_faceOffset = faceOffset; in registerConvexHullShapeInternal()
257 convex.m_numFaces = convexPtr->m_faces.size(); in registerConvexHullShapeInternal()
279 convex.m_numVertices = convexPtr->m_vertices.size(); in registerConvexHullShapeInternal()
[all …]
/dports/graphics/krita/krita-4.4.8/plugins/flake/pathshapes/star/
H A DStarShapeConfigWidget.cpp33 connect(widget.convex, SIGNAL(stateChanged(int)), this, SIGNAL(propertyChanged())); in StarShapeConfigWidget()
34 connect(widget.convex, SIGNAL(clicked()), this, SLOT(typeChanged())); in StarShapeConfigWidget()
53 widget.convex->blockSignals(true); in open()
58 widget.convex->setCheckState(m_star->convex() ? Qt::Checked : Qt::Unchecked); in open()
64 widget.convex->blockSignals(false); in open()
76 m_star->setConvex(widget.convex->checkState() == Qt::Checked); in save()
85 … widget.outerRadius->value(), widget.convex->checkState() == Qt::Checked); in createCommand()
90 if (widget.convex->checkState() == Qt::Checked) { in typeChanged()
/dports/editors/calligra/calligra-3.2.1/plugins/pathshapes/star/
H A DStarShapeConfigWidget.cpp31 connect(widget.convex, SIGNAL(stateChanged(int)), this, SIGNAL(propertyChanged())); in StarShapeConfigWidget()
32 connect(widget.convex, SIGNAL(clicked()), this, SLOT(typeChanged())); in StarShapeConfigWidget()
50 widget.convex->blockSignals(true); in open()
55 widget.convex->setCheckState(m_star->convex() ? Qt::Checked : Qt::Unchecked); in open()
61 widget.convex->blockSignals(false); in open()
72 m_star->setConvex(widget.convex->checkState() == Qt::Checked); in save()
81 widget.outerRadius->value(), widget.convex->checkState() == Qt::Checked); in createCommand()
86 if (widget.convex->checkState() == Qt::Checked) { in typeChanged()
/dports/games/wesnoth/wesnoth-1.14.17/data/core/images/terrain/castle/
H A Dcastle-walls.tmpl7 convex-ne
8 convex-e
9 convex-se
10 convex-sw
11 convex-w
12 convex-nw
/dports/math/R-cran-geometry/geometry/man/
H A Dintersectn.Rd5 \title{Compute convex hull of intersection of two sets of points}
16 within the convex hulls of both points and to round off the
20 \item{return.chs}{If \code{TRUE} (default) return the convex hulls
21 of the first and second sets of points, as well as the convex
41 List containing named elements: \code{ch1}, the convex
45 the intersection points of convex hulls \code{ch1} and
46 \code{ch2}; and \code{ch}, the convex hull of the intersection
50 Compute convex hull of intersection of two sets of points
62 message("Volume of 1st convex hull: ", out$ch1$vol)
63 message("Volume of 2nd convex hull: ", out$ch2$vol)
[all …]
/dports/graphics/urho3d/Urho3D-1.7.1/Source/ThirdParty/StanHull/
H A Dhull.cpp1688 if(convex.edges[estart].p!= convex.edges[i].p) { in AssertIntact()
1692 if(inext>= convex.edges.count || convex.edges[inext].p != convex.edges[i].p) { in AssertIntact()
1695 assert(convex.edges[inext].p == convex.edges[i].p); in AssertIntact()
1704 assert(COPLANAR==PlaneTest(convex.facets[convex.edges[i].p],convex.vertices[convex.edges[i].v])); in AssertIntact()
1705 …if(COPLANAR!=PlaneTest(convex.facets[convex.edges[i].p],convex.vertices[convex.edges[i].v])) retur… in AssertIntact()
1706 if(convex.edges[estart].p!= convex.edges[i].p) { in AssertIntact()
1710 if(i1>= convex.edges.count || convex.edges[i1].p != convex.edges[i].p) { in AssertIntact()
1714 if(i2>= convex.edges.count || convex.edges[i2].p != convex.edges[i].p) { in AssertIntact()
1746 return convex; in test_btbq()
1797 return convex; in test_cube()
[all …]
/dports/devel/bullet/bullet3-3.21/Extras/ConvexDecomposition/
H A Dcd_hull.cpp1797 if (convex.edges[estart].p != convex.edges[i].p) in AssertIntact()
1802 if (inext >= convex.edges.count || convex.edges[inext].p != convex.edges[i].p) in AssertIntact()
1806 assert(convex.edges[inext].p == convex.edges[i].p); in AssertIntact()
1815 …assert(COPLANAR == PlaneTest(convex.facets[convex.edges[i].p], convex.vertices[convex.edges[i].v])… in AssertIntact()
1816 …if (COPLANAR != PlaneTest(convex.facets[convex.edges[i].p], convex.vertices[convex.edges[i].v])) r… in AssertIntact()
1817 if (convex.edges[estart].p != convex.edges[i].p) in AssertIntact()
1822 if (i1 >= convex.edges.count || convex.edges[i1].p != convex.edges[i].p) in AssertIntact()
1827 if (i2 >= convex.edges.count || convex.edges[i2].p != convex.edges[i].p) in AssertIntact()
1833 convex.vertices[convex.edges[i1].v], in AssertIntact()
1834 convex.vertices[convex.edges[i2].v]); in AssertIntact()
[all …]
/dports/science/chrono/chrono-7.0.1/src/chrono/collision/gimpact/ConvexDecomposition/
H A Dcd_hull.cpp1722 if(convex.edges[estart].p!= convex.edges[i].p) { in AssertIntact()
1726 if(inext>= convex.edges.count || convex.edges[inext].p != convex.edges[i].p) { in AssertIntact()
1729 assert(convex.edges[inext].p == convex.edges[i].p); in AssertIntact()
1737 assert(COPLANAR==PlaneTest(convex.facets[convex.edges[i].p],convex.vertices[convex.edges[i].v])); in AssertIntact()
1738 …if(COPLANAR!=PlaneTest(convex.facets[convex.edges[i].p],convex.vertices[convex.edges[i].v])) retur… in AssertIntact()
1739 if(convex.edges[estart].p!= convex.edges[i].p) { in AssertIntact()
1743 if(i1>= convex.edges.count || convex.edges[i1].p != convex.edges[i].p) { in AssertIntact()
1747 if(i2>= convex.edges.count || convex.edges[i2].p != convex.edges[i].p) { in AssertIntact()
1779 return convex; in test_btbq()
1830 return convex; in test_cube()
[all …]
/dports/devel/emscripten/emscripten-2.0.3/tests/third_party/bullet/Extras/ConvexDecomposition/
H A Dcd_hull.cpp1722 if(convex.edges[estart].p!= convex.edges[i].p) { in AssertIntact()
1726 if(inext>= convex.edges.count || convex.edges[inext].p != convex.edges[i].p) { in AssertIntact()
1729 assert(convex.edges[inext].p == convex.edges[i].p); in AssertIntact()
1737 assert(COPLANAR==PlaneTest(convex.facets[convex.edges[i].p],convex.vertices[convex.edges[i].v])); in AssertIntact()
1738 …if(COPLANAR!=PlaneTest(convex.facets[convex.edges[i].p],convex.vertices[convex.edges[i].v])) retur… in AssertIntact()
1739 if(convex.edges[estart].p!= convex.edges[i].p) { in AssertIntact()
1743 if(i1>= convex.edges.count || convex.edges[i1].p != convex.edges[i].p) { in AssertIntact()
1747 if(i2>= convex.edges.count || convex.edges[i2].p != convex.edges[i].p) { in AssertIntact()
1779 return convex; in test_btbq()
1830 return convex; in test_cube()
[all …]
/dports/devel/py-bullet3/bullet3-3.21/Extras/ConvexDecomposition/
H A Dcd_hull.cpp1797 if (convex.edges[estart].p != convex.edges[i].p) in AssertIntact()
1802 if (inext >= convex.edges.count || convex.edges[inext].p != convex.edges[i].p) in AssertIntact()
1806 assert(convex.edges[inext].p == convex.edges[i].p); in AssertIntact()
1815 …assert(COPLANAR == PlaneTest(convex.facets[convex.edges[i].p], convex.vertices[convex.edges[i].v])… in AssertIntact()
1816 …if (COPLANAR != PlaneTest(convex.facets[convex.edges[i].p], convex.vertices[convex.edges[i].v])) r… in AssertIntact()
1817 if (convex.edges[estart].p != convex.edges[i].p) in AssertIntact()
1822 if (i1 >= convex.edges.count || convex.edges[i1].p != convex.edges[i].p) in AssertIntact()
1827 if (i2 >= convex.edges.count || convex.edges[i2].p != convex.edges[i].p) in AssertIntact()
1833 convex.vertices[convex.edges[i1].v], in AssertIntact()
1834 convex.vertices[convex.edges[i2].v]); in AssertIntact()
[all …]
/dports/math/curv/curv-0.5/ideas/sketches/
H A Dpolygon2 * Classify each vertex as convex or concave, based on the angle it makes with
5 * Make a convex polyhedron from just the convex vertices.
11 * Classify each vertex as convex or concave, based on the angle it makes with
17 convex polyhedron.
23 convex = n bools, true if vertex is convex, false if concave
24 if not(any convex) then
26 else if all convex then
/dports/textproc/kibana7/kibana-7.16.2-darwin-x86_64/node_modules/@turf/convex/
H A DREADME.md1 # @turf/convex
5 ## convex section in @turf/convex
7 Takes a [Feature][1] or a [FeatureCollection][2] and returns a convex hull [Polygon][3].
10 the [convex-hull][4] module that
17 …- `options.concavity` **[number][8]** 1 - thin shape. Infinity - convex hull. (optional, default…
32 var hull = turf.convex(points);
38 Returns **[Feature][9]&lt;[Polygon][10]>** a convex hull
46 [4]: https://github.com/mikolalysenko/convex-hull
76 $ npm install @turf/convex
/dports/math/fcl/fcl-0.7.0/test/geometry/shape/
H A Dtest_convex.cpp54 static bool find_extreme_via_neighbors(const Convex<S>& convex) { in find_extreme_via_neighbors() argument
55 return convex.find_extreme_via_neighbors_; in find_extreme_via_neighbors()
61 convex->find_extreme_via_neighbors_ = true; in force_find_extreme_via_neighbors()
283 Convex<double> convex = cube.MakeConvex(); in testConvexConstruction() local
287 EXPECT_EQ(convex.getNodeType(), GEOM_CONVEX); in testConvexConstruction()
297 Convex<S> convex = shape.MakeConvex(); in testAABBComputation() local
298 convex.computeLocalAABB(); in testAABBComputation()
301 EXPECT_NEAR(shape.aabb_radius(), convex.aabb_radius, eps); in testAABBComputation()
315 Convex<S> convex = shape.MakeConvex(); in testVolume() local
338 Convex<S> convex = shape.MakeConvex(); in testCenterOfMass() local
[all …]
/dports/astro/kstars/kstars-3.5.6/kstars/htmesh/
H A DHTMesh.cpp82 convex->setOlevel(m_level); in performIntersection()
84 convex->intersect(htm, &range); in performIntersection()
108 RangeConvex convex; in intersect() local
109 convex.add(c); // [ed:RangeConvex::add] in intersect()
111 if (!performIntersection(&convex, bufNum)) in intersect()
130 RangeConvex convex(&p1, &p2, &p3); in intersect() local
132 if (!performIntersection(&convex, bufNum)) in intersect()
156 RangeConvex convex(&p1, &p2, &p3, &p4); in intersect() local
158 if (!performIntersection(&convex, bufNum)) in intersect()
249 RangeConvex convex(&p1, &p0, &p2); in intersect() local
[all …]
/dports/math/reduce/Reduce-svn5758-src/psl/dist/distrib/macg5/
H A Dmake_disks7 …k-aviion sparc spectrum snake ibmxa* fuji os2 sun4 solaris stardent low* convex conv32 88k-aviion …
11 …k-aviion sparc spectrum snake ibmxa* fuji os2 sun4 solaris stardent low* convex conv32 88k-aviion …
14 …k-aviion sparc spectrum snake ibmxa* fuji os2 sun4 solaris stardent low* convex conv32 88k-aviion …
17 …k-aviion sparc spectrum snake ibmxa* fuji os2 sun4 solaris stardent low* convex conv32 88k-aviion …
20 …k-aviion sparc spectrum snake ibmxa* fuji os2 sun4 solaris stardent low* convex conv32 88k-aviion …
23 …k-aviion sparc spectrum snake ibmxa* fuji os2 sun4 solaris stardent low* convex conv32 88k-aviion …
83 …k-aviion sparc spectrum snake ibmxa* fuji os2 sun4 solaris stardent low* convex conv32 88k-aviion …
90 …k-aviion sparc spectrum snake ibmxa* fuji os2 sun4 solaris stardent low* convex conv32 88k-aviion …
93 …k-aviion sparc spectrum snake ibmxa* fuji os2 sun4 solaris stardent low* convex conv32 88k-aviion …
96 …k-aviion sparc spectrum snake ibmxa* fuji os2 sun4 solaris stardent low* convex conv32 88k-aviion …
[all …]
/dports/math/reduce/Reduce-svn5758-src/psl/dist/distrib/ibmrs/
H A Dmake_disks7 …k-aviion sparc spectrum snake ibmxa* fuji os2 sun4 solaris stardent low* convex conv32 88k-aviion …
11 …k-aviion sparc spectrum snake ibmxa* fuji os2 sun4 solaris stardent low* convex conv32 88k-aviion …
14 …k-aviion sparc spectrum snake ibmxa* fuji os2 sun4 solaris stardent low* convex conv32 88k-aviion …
17 …k-aviion sparc spectrum snake ibmxa* fuji os2 sun4 solaris stardent low* convex conv32 88k-aviion …
20 …k-aviion sparc spectrum snake ibmxa* fuji os2 sun4 solaris stardent low* convex conv32 88k-aviion …
23 …k-aviion sparc spectrum snake ibmxa* fuji os2 sun4 solaris stardent low* convex conv32 88k-aviion …
83 …k-aviion sparc spectrum snake ibmxa* fuji os2 sun4 solaris stardent low* convex conv32 88k-aviion …
90 …k-aviion sparc spectrum snake ibmxa* fuji os2 sun4 solaris stardent low* convex conv32 88k-aviion …
93 …k-aviion sparc spectrum snake ibmxa* fuji os2 sun4 solaris stardent low* convex conv32 88k-aviion …
96 …k-aviion sparc spectrum snake ibmxa* fuji os2 sun4 solaris stardent low* convex conv32 88k-aviion …
[all …]
/dports/math/reduce/Reduce-svn5758-src/psl/dist/distrib/macg4/
H A Dmake_disks7 …k-aviion sparc spectrum snake ibmxa* fuji os2 sun4 solaris stardent low* convex conv32 88k-aviion …
11 …k-aviion sparc spectrum snake ibmxa* fuji os2 sun4 solaris stardent low* convex conv32 88k-aviion …
14 …k-aviion sparc spectrum snake ibmxa* fuji os2 sun4 solaris stardent low* convex conv32 88k-aviion …
17 …k-aviion sparc spectrum snake ibmxa* fuji os2 sun4 solaris stardent low* convex conv32 88k-aviion …
20 …k-aviion sparc spectrum snake ibmxa* fuji os2 sun4 solaris stardent low* convex conv32 88k-aviion …
23 …k-aviion sparc spectrum snake ibmxa* fuji os2 sun4 solaris stardent low* convex conv32 88k-aviion …
83 …k-aviion sparc spectrum snake ibmxa* fuji os2 sun4 solaris stardent low* convex conv32 88k-aviion …
90 …k-aviion sparc spectrum snake ibmxa* fuji os2 sun4 solaris stardent low* convex conv32 88k-aviion …
93 …k-aviion sparc spectrum snake ibmxa* fuji os2 sun4 solaris stardent low* convex conv32 88k-aviion …
96 …k-aviion sparc spectrum snake ibmxa* fuji os2 sun4 solaris stardent low* convex conv32 88k-aviion …
[all …]

12345678910>>...256