| /dports/graphics/qgis/qgis-3.22.3/src/core/pal/ |
| H A D | geomfunction.cpp | 181 return convexHull; in convexHullId()
199 if ( qgsDoubleNear( y[id[convexHull[i]]], y[id[convexHull[0]]] ) ) in convexHullId()
202 …tan[i] = ( x[id[convexHull[0]]] - x[id[convexHull[i]]] ) / ( y[id[convexHull[i]]] - y[id[convexHul… in convexHullId()
209 stack[0] = convexHull[0]; in convexHullId()
262 return convexHull; in convexHullId()
274 if ( pts[convexHull[0]] < pts[convexHull[1]] && pts[convexHull[1]] < pts[convexHull[2]] ) in reorderPolygon()
276 else if ( pts[convexHull[0]] > pts[convexHull[1]] && pts[convexHull[1]] > pts[convexHull[2]] ) in reorderPolygon()
278 …else if ( pts[convexHull[0]] > pts[convexHull[1]] && pts[convexHull[1]] < pts[convexHull[2]] && pt… in reorderPolygon()
280 …else if ( pts[convexHull[0]] > pts[convexHull[1]] && pts[convexHull[1]] < pts[convexHull[2]] && pt… in reorderPolygon()
282 …else if ( pts[convexHull[0]] < pts[convexHull[1]] && pts[convexHull[1]] > pts[convexHull[2]] && pt… in reorderPolygon()
[all …]
|
| H A D | pointset.cpp | 87 convexHull = ps.convexHull; in PointSet()
351 x[shape->convexHull[ihn]], y[shape->convexHull[ihn]], in splitPolygons()
364 x[shape->convexHull[ihn]], y[shape->convexHull[ihn]] ); in splitPolygons()
366 b = GeomFunction::dist_euc2d( x[shape->convexHull[ihs]], y[shape->convexHull[ihs]], in splitPolygons()
369 … const double c = GeomFunction::dist_euc2d( x[shape->convexHull[ihn]], y[shape->convexHull[ihn]], in splitPolygons()
464 for ( k = shape->convexHull[holeS]; k != shape->convexHull[holeE]; k = ( k + 1 ) % nbp ) in splitPolygons()
739 if ( x[convexHull[i]] < bbox[0] ) in computeConvexHullOrientedBoundingBox()
740 bbox[0] = x[convexHull[i]]; in computeConvexHullOrientedBoundingBox()
743 bbox[2] = x[convexHull[i]]; in computeConvexHullOrientedBoundingBox()
746 bbox[1] = y[convexHull[i]]; in computeConvexHullOrientedBoundingBox()
[all …]
|
| /dports/graphics/geos/geos-3.9.1/tests/unit/algorithm/ |
| H A D | ConvexHullTest.cpp | 73 ensure(nullptr != convexHull.get()); in test()
75 geom_ = line->convexHull(); in test()
92 ensure(nullptr != convexHull.get()); in test()
94 geom_ = geom->convexHull(); in test()
111 ensure(nullptr != convexHull.get()); in test()
113 geom_ = geom->convexHull(); in test()
130 ensure(nullptr != convexHull.get()); in test()
132 geom_ = geom->convexHull(); in test()
151 geom_ = geom->convexHull(); in test()
190 geom_ = geom->convexHull(); in test()
[all …]
|
| /dports/math/jts/jts-jts-1.18.1/modules/core/src/test/java/org/locationtech/jts/algorithm/ |
| H A D | ConvexHullTest.java | 76 assertTrue(convexHull.equalsExact(lineString.convexHull())); in test1()
83 assertTrue(convexHull.equalsExact(geometry.convexHull())); in test2()
89 LineString convexHull = (LineString) reader.read("LINESTRING (0 0, 10 0)"); in test3() local
90 assertTrue(convexHull.equalsExact(geometry.convexHull())); in test3()
96 LineString convexHull = (LineString) reader.read("LINESTRING (0 0, 10 0)"); in test4() local
97 assertTrue(convexHull.equalsExact(geometry.convexHull())); in test4()
103 LineString convexHull = (LineString) reader.read("LINESTRING (0 0, 10 0)"); in test5() local
104 assertTrue(convexHull.equalsExact(geometry.convexHull())); in test5()
120 Object[] array1 = convexHull.toCoordinateArray(stack); in testToArray()
140 LineString convexHull = (LineString) reader.read("LINESTRING (0 0, 10 0)"); in test7() local
[all …]
|
| /dports/graphics/wdune/wdune-1.926/vcglib/vcg/complex/algorithms/ |
| H A D | convex_hull.h | 149 …fi = vcg::tri::Allocator<CHMesh>::AddFace(convexHull, &convexHull.vert[3], convexHull.face[0].V0(1… in InitConvexHull()
151 …fi = vcg::tri::Allocator<CHMesh>::AddFace(convexHull, &convexHull.vert[3], convexHull.face[0].V1(1… in InitConvexHull()
153 …fi = vcg::tri::Allocator<CHMesh>::AddFace(convexHull, &convexHull.vert[3], convexHull.face[0].V2(1… in InitConvexHull()
172 vcg::tri::RequireFFAdjacency(convexHull); in ComputeConvexHull()
173 vcg::tri::RequirePerFaceNormal(convexHull); in ComputeConvexHull()
179 InitConvexHull(mesh, convexHull); in ComputeConvexHull()
190 ScalarType dist = (mesh.vert[i].P() - convexHull.face[j].P(0)).dot(convexHull.face[j].N()); in ComputeConvexHull()
261 …CHFaceIterator fi = vcg::tri::Allocator<CHMesh>::AddFace(convexHull, &convexHull.vert.back(), f->V… in ComputeConvexHull()
263 f = &convexHull.face[indexFace]; in ComputeConvexHull()
326 if (!convexHull.face[visFace[j]].IsD()) in ComputeConvexHull()
[all …]
|
| /dports/devel/vcglib/vcglib-2020.09/vcg/complex/algorithms/ |
| H A D | convex_hull.h | 148 …fi = vcg::tri::Allocator<CHMesh>::AddFace(convexHull, &convexHull.vert[3], convexHull.face[0].V0(1… in InitConvexHull()
150 …fi = vcg::tri::Allocator<CHMesh>::AddFace(convexHull, &convexHull.vert[3], convexHull.face[0].V1(1… in InitConvexHull()
152 …fi = vcg::tri::Allocator<CHMesh>::AddFace(convexHull, &convexHull.vert[3], convexHull.face[0].V2(1… in InitConvexHull()
172 vcg::tri::RequireFFAdjacency(convexHull);
173 vcg::tri::RequirePerFaceNormal(convexHull);
179 InitConvexHull(mesh, convexHull);
190 ScalarType dist = (mesh.vert[i].P() - convexHull.face[j].P(0)).dot(convexHull.face[j].N());
261 …CHFaceIterator fi = vcg::tri::Allocator<CHMesh>::AddFace(convexHull, &convexHull.vert.back(), f->V…
263 f = &convexHull.face[indexFace];
326 if (!convexHull.face[visFace[j]].IsD())
[all …]
|
| /dports/misc/elki/elki-release0.7.1-1166-gfb1fffdf3/elki-index-mtree/src/main/java/de/lmu/ifi/dbs/elki/index/tree/metrical/mtreevariants/mktrees/mkcop/ |
| H A D | MkCoPTree.java | 402 ConvexHull convexHull = new ConvexHull(log_k, log_kDist); in approximateKnnDistances() local
420 int u = convexHull.getNumberOfPointsInUpperHull(); in approximateKnnDistances()
421 int[] upperHull = convexHull.getUpperHull(); in approximateKnnDistances()
458 int[] lowerHull = convexHull.getLowerHull(); in approximateLowerHull()
459 int l = convexHull.getNumberOfPointsInLowerHull(); in approximateLowerHull()
511 int[] upperHull = convexHull.getUpperHull(); in approximateUpperHull()
512 int u = convexHull.getNumberOfPointsInUpperHull(); in approximateUpperHull()
559 int[] upperHull = convexHull.getUpperHull(); in approximateUpperHullPaper()
560 int u = convexHull.getNumberOfPointsInUpperHull(); in approximateUpperHullPaper()
647 int[] upperHull = convexHull.getUpperHull(); in approximateUpperHullOld()
[all …]
|
| /dports/math/octave-forge-matgeom/matgeom-1.2.3/inst/polygons2d/ |
| H A D | convexHull.m | 28 function [hull, inds] = convexHull(points, varargin) function
31 % POLY = convexHull(POINTS)
36 % [POLY, INDS] = convexHull(POINTS)
40 % ... = convexHull(POINTS, 'simplify', BOOL)
42 % the convexHull functions uses simplify equals to TRUE (contrary to the
50 % hull = convexHull(pts);
58 % hull = convexHull(poly);
|
| /dports/games/openmw/openmw-openmw-0.47.0/components/sceneutil/ |
| H A D | mwshadowtechnique.cpp | 2554 ConvexHull convexHull; in cropShadowCameraToMainFrustum() local
2572 if (convexHull.valid()) in cropShadowCameraToMainFrustum()
2601 xMin = convexHull.min(0); in cropShadowCameraToMainFrustum()
2602 xMax = convexHull.max(0); in cropShadowCameraToMainFrustum()
2603 yMin = convexHull.min(1); in cropShadowCameraToMainFrustum()
2644 ConvexHull convexHull; in adjustPerspectiveShadowMapCameraSettings() local
2765 if (convexHull.valid()) in adjustPerspectiveShadowMapCameraSettings()
2767 double widest_x = osg::maximum(fabs(convexHull.min(0)), fabs(convexHull.max(0))); in adjustPerspectiveShadowMapCameraSettings()
2801 convexHull.transform(m); in adjustPerspectiveShadowMapCameraSettings()
2890 min_x_ratio = convexHull.valid() ? convexHull.minRatio(virtual_eye,0) : -dbl_max; in adjustPerspectiveShadowMapCameraSettings()
[all …]
|
| /dports/graphics/osg/OpenSceneGraph-OpenSceneGraph-3.6.5/src/osgShadow/ |
| H A D | ViewDependentShadowMap.cpp | 1984 ConvexHull convexHull; in adjustPerspectiveShadowMapCameraSettings() local
1988 OSG_NOTICE<<"ws ConvexHull xMin="<<convexHull.min(0)<<", xMax="<<convexHull.max(0)<<std::endl; in adjustPerspectiveShadowMapCameraSettings()
1989 OSG_NOTICE<<"ws ConvexHull yMin="<<convexHull.min(1)<<", yMax="<<convexHull.max(1)<<std::endl; in adjustPerspectiveShadowMapCameraSettings()
1990 OSG_NOTICE<<"ws ConvexHull zMin="<<convexHull.min(2)<<", zMax="<<convexHull.max(2)<<std::endl; in adjustPerspectiveShadowMapCameraSettings()
2000 OSG_NOTICE<<"ls ConvexHull xMin="<<convexHull.min(0)<<", xMax="<<convexHull.max(0)<<std::endl; in adjustPerspectiveShadowMapCameraSettings()
2001 OSG_NOTICE<<"ls ConvexHull yMin="<<convexHull.min(1)<<", yMax="<<convexHull.max(1)<<std::endl; in adjustPerspectiveShadowMapCameraSettings()
2083 if (convexHull.valid()) in adjustPerspectiveShadowMapCameraSettings()
2085 double widest_x = osg::maximum(fabs(convexHull.min(0)), fabs(convexHull.max(0))); in adjustPerspectiveShadowMapCameraSettings()
2119 convexHull.transform(m); in adjustPerspectiveShadowMapCameraSettings()
2207 min_x_ratio = convexHull.valid() ? convexHull.minRatio(virtual_eye,0) : -DBL_MAX; in adjustPerspectiveShadowMapCameraSettings()
[all …]
|
| /dports/graphics/osg34/OpenSceneGraph-OpenSceneGraph-3.4.1/src/osgShadow/ |
| H A D | ViewDependentShadowMap.cpp | 1991 ConvexHull convexHull;
1995 OSG_NOTICE<<"ws ConvexHull xMin="<<convexHull.min(0)<<", xMax="<<convexHull.max(0)<<std::endl;
1996 OSG_NOTICE<<"ws ConvexHull yMin="<<convexHull.min(1)<<", yMax="<<convexHull.max(1)<<std::endl;
1997 OSG_NOTICE<<"ws ConvexHull zMin="<<convexHull.min(2)<<", zMax="<<convexHull.max(2)<<std::endl;
2007 OSG_NOTICE<<"ls ConvexHull xMin="<<convexHull.min(0)<<", xMax="<<convexHull.max(0)<<std::endl;
2008 OSG_NOTICE<<"ls ConvexHull yMin="<<convexHull.min(1)<<", yMax="<<convexHull.max(1)<<std::endl;
2090 if (convexHull.valid())
2092 double widest_x = osg::maximum(fabs(convexHull.min(0)), fabs(convexHull.max(0)));
2126 convexHull.transform(m);
2214 min_x_ratio = convexHull.valid() ? convexHull.minRatio(virtual_eye,0) : -DBL_MAX;
[all …]
|
| /dports/science/chrono/chrono-7.0.1/src/chrono_thirdparty/HACDv2/ |
| H A D | ConvexHull.cpp | 64 dgConvexHull3d convexHull(bigVertices,sizeof(HaF64)*3,ovcount,0.0001f,desc.mMaxVertices); in CreateConvexHull() local
66 if ( convexHull.GetCount() ) in CreateConvexHull()
68 HaF32 *hullVertices = (HaF32 *)HACD_ALLOC( sizeof(HaF32)*3*convexHull.GetVertexCount() ); in CreateConvexHull()
71 for (HaU32 i=0; i<(HaU32)convexHull.GetVertexCount(); i++) in CreateConvexHull()
73 const dgBigVector &v = convexHull.GetVertex(i); in CreateConvexHull()
80 HaU32 triangleCount = convexHull.GetCount(); in CreateConvexHull()
83 dgList<dgConvexHull3DFace>::Iterator iter(convexHull); in CreateConvexHull()
97 …hacd::HaF32 *vscratch = (hacd::HaF32 *) HACD_ALLOC( sizeof(hacd::HaF32)*convexHull.GetVertexCount(… in CreateConvexHull()
98 …BringOutYourDead(hullVertices,convexHull.GetVertexCount(),vscratch, ovcount, indices, triangleCoun… in CreateConvexHull()
|
| /dports/math/py-Diofant/Diofant-0.13.0/diofant/geometry/ |
| H A D | util.py | 291 convexHull = tuple(L + U[1:-1])
293 if len(convexHull) == 2:
294 return Segment(convexHull[0], convexHull[1])
295 return Polygon(*convexHull)
|
| /dports/misc/dartsim/dart-6.11.1/unittests/unit/ |
| H A D | test_TriMesh.cpp | 144 auto convexHull = mesh.generateConvexHull(); in TEST() local
145 ASSERT_NE(convexHull, nullptr); in TEST()
146 EXPECT_EQ(convexHull->getVertices().size(), vertices.size()); in TEST()
147 EXPECT_EQ(convexHull->getTriangles().size(), 4); in TEST()
|
| /dports/multimedia/chilitags/chilitags-2.0.0-169-g0d9854f/src/ |
| H A D | ReadBits.cpp | 81 cv::Mat convexHull; in operator ()() local
82 cv::convexHull(cornersCopy, convexHull, true); in operator ()()
83 if (convexHull.rows != 4) { in operator ()()
84 cornersCopy = convexHull; in operator ()()
|
| /dports/misc/dartsim/dart-6.11.1/dart/gui/osg/render/ |
| H A D | MultiSphereShapeNode.cpp | 227 auto convexHull = mesh.generateConvexHull(); in refresh() local
228 convexHull->computeVertexNormals(); in refresh()
229 const auto& meshVertices = convexHull->getVertices(); in refresh()
230 const auto& meshNormals = convexHull->getVertexNormals(); in refresh()
231 const auto& meshTriangles = convexHull->getTriangles(); in refresh()
|
| /dports/databases/sfcgal/SFCGAL-815d5097f684dbc48b22041bf2047beab36df0a1/test/unit/SFCGAL/algorithm/ |
| H A D | ConvexHullTest.cpp | 51 std::unique_ptr< Geometry > hull( algorithm::convexHull( collect ) ); in BOOST_AUTO_TEST_CASE()
63 std::unique_ptr< Geometry > hull( algorithm::convexHull( lineString ) ); in BOOST_AUTO_TEST_CASE()
83 std::unique_ptr< Geometry > hull( algorithm::convexHull( lineString ) ); in BOOST_AUTO_TEST_CASE()
96 std::unique_ptr< Geometry > hull( algorithm::convexHull( lineString ) ); in BOOST_AUTO_TEST_CASE()
|
| /dports/graphics/autopano-sift-c/autopano-sift-C-2.5.1/ |
| H A D | MatchKeys.c | 558 while (ArrayList_Count(convexHull) > bestMatches) { in MultiMatch_FilterMatchesByArea()
565 for (n = 0 ; n < ArrayList_Count(convexHull) ; ++n) { in MultiMatch_FilterMatchesByArea()
566 ArrayList* convexHullMinusOne = ArrayList_clone(convexHull); in MultiMatch_FilterMatchesByArea()
577 ArrayList_RemoveAt(convexHull, removeIndex); in MultiMatch_FilterMatchesByArea()
581 *areaPixels = AreaFilter_PolygonArea(areaF, convexHull); in MultiMatch_FilterMatchesByArea()
589 while (ArrayList_Count(convexHull) < bestMatches) in MultiMatch_FilterMatchesByArea()
599 for(j=0; j<ArrayList_Count(convexHull); j++) { in MultiMatch_FilterMatchesByArea()
618 for(k=0; k<ArrayList_Count(convexHull); k++) { in MultiMatch_FilterMatchesByArea()
640 ArrayList_AddItem(convexHull, pNew); in MultiMatch_FilterMatchesByArea()
645 for(j=0; j<ArrayList_Count(convexHull); j++) { in MultiMatch_FilterMatchesByArea()
[all …]
|
| /dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/libslic3r/ |
| H A D | MinAreaBoundingBox.cpp | 80 libnest2d::sl::convexHull(p); in MinAreaBoundigBox()
93 libnest2d::sl::convexHull(p); in MinAreaBoundigBox()
106 libnest2d::sl::convexHull(pts); in MinAreaBoundigBox()
|
| /dports/math/py-sympy/sympy-1.9/sympy/geometry/ |
| H A D | util.py | 439 convexHull = tuple(L + U[1:-1])
441 if len(convexHull) == 2:
442 s = Segment(convexHull[0], convexHull[1])
445 return Polygon(*convexHull)
|
| /dports/math/octave-forge-interval/interval-3.2.0/inst/@infsup/ |
| H A D | union.m | 86 %! testcases = testdata.NoSignal.infsup.convexHull;
95 %! testcases = testdata.NoSignal.infsup.convexHull;
103 %! testcases = testdata.NoSignal.infsup.convexHull;
|
| /dports/math/jts/jts-jts-1.18.1/modules/core/src/main/java/org/locationtech/jts/algorithm/ |
| H A D | MinimumBoundingCircle.java | 287 Geometry convexHull = input.convexHull(); in computeCirclePoints() local
289 Coordinate[] hullPts = convexHull.getCoordinates(); in computeCirclePoints()
|
| /dports/devel/bullet/bullet3-3.21/examples/Importers/ImportURDFDemo/ |
| H A D | BulletUrdfImporter.cpp | 566 convexHull->addPoint(pt * geomScale, false); in createConvexHullFromShapes()
571 convexHull->addPoint(pt * geomScale, false); in createConvexHullFromShapes()
576 convexHull->addPoint(pt * geomScale, false); in createConvexHullFromShapes()
579 convexHull->recalcLocalAabb(); in createConvexHullFromShapes()
580 convexHull->optimizeConvexHull(); in createConvexHullFromShapes()
583 convexHull->initializePolyhedralFeatures(); in createConvexHullFromShapes()
586 compound->addChildShape(identity, convexHull); in createConvexHullFromShapes()
881 convexHull->optimizeConvexHull(); in convertURDFToCollisionShape()
884 convexHull->initializePolyhedralFeatures(); in convertURDFToCollisionShape()
887 convexHull->recalcLocalAabb(); in convertURDFToCollisionShape()
[all …]
|
| /dports/devel/py-bullet3/bullet3-3.21/examples/Importers/ImportURDFDemo/ |
| H A D | BulletUrdfImporter.cpp | 566 convexHull->addPoint(pt * geomScale, false); in createConvexHullFromShapes()
571 convexHull->addPoint(pt * geomScale, false); in createConvexHullFromShapes()
576 convexHull->addPoint(pt * geomScale, false); in createConvexHullFromShapes()
579 convexHull->recalcLocalAabb(); in createConvexHullFromShapes()
580 convexHull->optimizeConvexHull(); in createConvexHullFromShapes()
583 convexHull->initializePolyhedralFeatures(); in createConvexHullFromShapes()
586 compound->addChildShape(identity, convexHull); in createConvexHullFromShapes()
881 convexHull->optimizeConvexHull(); in convertURDFToCollisionShape()
884 convexHull->initializePolyhedralFeatures(); in convertURDFToCollisionShape()
887 convexHull->recalcLocalAabb(); in convertURDFToCollisionShape()
[all …]
|
| /dports/math/octave-forge-interval/interval-3.2.0/inst/@infsupdec/ |
| H A D | union.m | 89 %! testcases = testdata.NoSignal.infsupdec.convexHull;
98 %! testcases = testdata.NoSignal.infsupdec.convexHull;
106 %! testcases = testdata.NoSignal.infsupdec.convexHull;
|