+ Ai Rt^RIHt^RIt^RIHtHt^RIH t ^RI H t ^RI H t ^RIHt^RIHtR R .tR tR tRR ltR^/RltR#)z Convex Hull.)productN) ConvexHull QhullError)grid_points_in_poly) possible_hull)label) unique_rows)warnconvex_hull_imageconvex_hull_objectc\P!^V,V34p\\\ V4R44F wpwr4WAW#3&K V#))gg?)npzeros enumeraterrange)ndimoffsetsvertexaxisoffsets& \/var/www/html/photoedit/myenv/lib/python3.14/site-packages/skimage/morphology/convex_hull.py_offsets_diamondrsJhhD$'(G"+GE$K,M"N & #O Nc<VPwr4VP^,p\P!V\R7p\P!V\P R7p\P!V\P R7p\P!V\R7p \ V4Fgp \P!WRV13,WR7\P!WqWR13,VR7\P!WV R7Wi,pKi V#)aChecks all the coordinates for inclusiveness in the convex hull. Parameters ---------- gridcoords : (M, N) ndarray Coordinates of ``N`` points in ``M`` dimensions. hull_equations : (M, N) ndarray Hyperplane equations of the facets of the convex hull. tolerance : float Tolerance when determining whether a point is inside the hull. Due to numerical floating point errors, a tolerance of 0 can result in some points erroneously being classified as being outside the hull. Returns ------- coords_in_hull : ndarray of bool Binary 1D ndarray representing points in n-dimensional space with value ``True`` set for points inside the convex hull. Notes ----- Checking the inclusiveness of coordinates in a convex hull requires intermediate calculations of dot products which are memory-intensive. Thus, the convex hull equations are checked individually with all coordinates to keep within the memory limit. References ---------- .. [1] https://github.com/scikit-image/scikit-image/issues/5019 dtypeN)out) shaperonesboolemptyfloat64rdotaddless) gridcoordshull_equations tolerancern_coordsn_hull_equationscoords_in_hull dot_arraytest_ineq_tempcoords_single_ineqidxs &&& r_check_coords_in_hullr0s@ %%ND%++A.WWXT2N4IXXhbjj9N($7%& ~5D5j):E ye4.I /AB, ' rc VPp\P!V4^8Xd7\R\4\P !VP \R7#V^8Xd1\\P!V\PR74pM[\P!\P!V44pV'd*\V4pTPTP ,pV'dG\#VP4pVR\P$R3,V,P'RV4p\)V4p\V4p T PT P ,p T^8Xd/\+TP T RR7p T'dT ^8p T #T ^8Hp T #\P&!\P,\/\1\2TP 44,TR34p \5YP6T4p\P&!YP 4p T # \d?p\RT 24\P !TP \R7uRp?#Rp?ii;i \d?p\RT 24\P !TP \R7uRp?#Rp?ii;i) a@Compute the convex hull image of a binary image. The convex hull is the set of pixels included in the smallest convex polygon that surround all white pixels in the input image. Parameters ---------- image : array Binary input image. This array is cast to bool before processing. offset_coordinates : bool, optional If ``True``, a pixel at coordinate, e.g., (4, 7) will be represented by coordinates (3.5, 7), (4.5, 7), (4, 6.5), and (4, 7.5). This adds some "extent" to a pixel when computing the hull. tolerance : float, optional Tolerance when determining whether a point is inside the hull. Due to numerical floating point errors, a tolerance of 0 can result in some points erroneously being classified as being outside the hull. include_borders : bool, optional If ``False``, vertices/edges are excluded from the final hull mask. Returns ------- hull : (M, N) array of bool Binary image with pixels in convex hull set to True. References ---------- .. [1] https://blogs.mathworks.com/steve/2011/10/04/binary-image-convex-hull-algorithm-notes/ zIInput image is entirely zero, no valid convex hull. Returning empty imagerzQFailed to get convex hull image. Returning empty image, see error message below: N:NNNF)binarize)rr count_nonzeror UserWarningrrr rascontiguousarrayuint8 transposenonzerorrpointsverticesrnewaxisreshaperrmgridtuplemapslicer0 equations)imageoffset_coordinatesr(include_bordersrcoordshull0errrhullr;labelsmaskr&r+s&&&& rr r Js,B ::D !#  $  xx 400 qyr33EJKbjj/0  9"6*\\%..1F"5::.BJJ)*W4==b$G F1&!{{4==)H qy$U[[(UK.v{ K4:Q; K ZZs5%++/F)G H4QS*U .z>>9Uzz.++6 KU 9He xx 488  9* 1 @e  xx 400 1s< H. I:. I793I2,I72I7: K3J>8K>K connectivitycVP^8d \R4hVR9d \R4h\W^R7p\P!VP \ R7p\P!VP \ R7p\^VP4^,4F&p\W%8H4p\P!WC4pK( V#)aCompute the convex hull image of individual objects in a binary image. The convex hull is the set of pixels included in the smallest convex polygon that surround all white pixels in the input image. Parameters ---------- image : (M, N) ndarray Binary input image. connectivity : {1, 2}, int, optional Determines the neighbors of each pixel. Adjacent elements within a squared distance of ``connectivity`` from pixel center are considered neighbors.:: 1-connectivity 2-connectivity [ ] [ ] [ ] [ ] | \ | / [ ]--[x]--[ ] [ ]--[x]--[ ] | / | \ [ ] [ ] [ ] [ ] Returns ------- hull : ndarray of bool Binary image with pixels inside convex hull set to ``True``. Notes ----- This function uses ``skimage.morphology.label`` to define unique objects, finds the convex hull of each using ``convex_hull_image``, and combines these regions with logical OR. Be aware the convex hulls of unconnected objects may overlap in the result. If this is suspected, consider using convex_hull_image separately on each object or adjust ``connectivity``. zInput must be a 2D imagez%`connectivity` must be either 1 or 2.)rL backgroundr)r ) r ValueErrorrrrrr rmaxr logical_or)rCrL labeled_im convex_obj convex_imgis&$ rr r sF zzA~3446!@AAuAFJ%++T2J%++T2J 1jnn&* +&z7 ]]:: , r)Tg|=T)__doc__ itertoolsrnumpyr scipy.spatialrrmeasure.pnpolyr _convex_hullrmeasure._labelrutilr _shared.utilsr __all__rr0r r rrrbsI00'"  4 51h`F1a1r