0-Ph dZddlmZddlZddlmZmZddlm Z ddl m Z dd l m Z dd lmZdd lmZd d gZdZdZ ddZdddZdS)z Convex Hull.)productN) ConvexHull QhullError)grid_points_in_poly) possible_hull)label) unique_rows)warnconvex_hull_imageconvex_hull_objectctjd|z|f}ttt |dD]\}\}}||||f<|S)Nr)gg?)npzeros enumeraterrange)ndimoffsetsvertexaxisoffsets ^/var/www/html/test/jupyter/venv/lib/python3.11/site-packages/skimage/morphology/convex_hull.py_offsets_diamondrs`hD$'((G"+GE$KK,M,M"N"N''v &  Nc|j\}}|jd}tj|t}tj|tj}tj|tj}tj|t} t |D]`} tj|| d|f||tj||| |df|tj ||| || z}a|S)a`Checks 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 rdtypeN)out) shaperonesboolemptyfloat64rdotaddless) gridcoordshull_equations tolerancern_coordsn_hull_equationscoords_in_hull dot_arraytest_ineq_tempcoords_single_ineqidxs r_check_coords_in_hullr2s@ %ND(%+A.WXT222N444IXhbj999N($777%&&-- ~c5D5j):9EEEE y.dee4.IIII  /ABBBB,, rT绽|=c |j}tj|dkr5tdttj|jtS|dkr.ttj |tj }ntj tj |}|rl t|}nI#t$r<}td|tj|jtcYd}~Sd}~wwxYw|j|j}|rDt#|j}|ddtjddf|zd|}t)|} t|} nI#t$r<}td|tj|jtcYd}~Sd}~wwxYw| j| j} |dkr&t+|j| d } |r| d kn| d k} n|tjtjt/t1t2|j|df} t5| | j|}tj||j} | S) aCompute 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/ rzIInput image is entirely zero, no valid convex hull. Returning empty imagerrzQFailed to get convex hull image. Returning empty image, see error message below: NF)binarizer)rr count_nonzeror UserWarningrr r"r ascontiguousarrayuint8 transposenonzerorrpointsverticesrnewaxisreshaper rmgridtuplemapslicer2 equations)imageoffset_coordinatesr*include_bordersrcoordshull0errrhullr>labelsmaskr(r-s rr r JsB :D !##  $    x 40000 qyyr3EJJJKKbj//00  2 9"6** 9 9 9 x 4888888888  9\%.1FH"5:..BJ)*W4==b$GG F1&!! 111       x 4000000000 1{4=)H qyy$U[(UKKK.>v{{6Q;Zs5%+/F/F)G)G H4QS*UU .z4>9UUz.%+66 Ks<2C D 1D=DD3F G  1G>G G ) connectivityc|jdkrtd|dvrtdt||d}tj|jt }tj|jt }td|dzD]*}t||k}tj ||}+|S) 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``. rzInput must be a 2D image)rrz%`connectivity` must be either 1 or 2.r)rO backgroundrr) r ValueErrorr rrr r"rmaxr logical_or)rFrO labeled_im convex_obj convex_imgis rrrsF zA~~34446!!@AAAurds 00000000000000''''''""""""  4 5111jFJ````F/01111111r