i dZddlmZddlZddlmZmZddlm Z ddl m Z dd l m Z dd lmZdd lmZd d gZdZdZ ddZdddZy)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/ITT-ServiceAPI-Services/ITT-Document-Scan/mrzscanner/mrzenv/lib/python3.12/site-packages/skimage/morphology/convex_hull.py_offsets_diamondrsThhD$'(G"+GE$K,M"N'v & ' Nc|j\}}|jd}tj|t}tj|tj }tj|tj }tj|t} t |D]]} tj|| d|f||tj||| |df|tj||| || z}_|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.WWXT2N4IXXhbjj9N($7%&- ~c5D5j):9E y.de4.I  /AB,, - rc &|j}tj|dk(r5tdttj |j tS|dk(r/ttj|tj}nOtjtj|}|r% t|}|j|j }|rBt#|j}|ddtj$ddf|zj'd|}t)|} t|} | j| j } |dk(r(t+|j | d } |r| d k\} | S| d k(} | Stj&tj,t/t1t2|j |df} t5| | j6|}tj&||j } | S#t$r=}td|tj |j tcYd}~Sd}~wwxYw#t$r=}td|tj |j tcYd}~Sd}~wwxYw) 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 Js0B ::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 .z4>>9Uzz.%++6 KU 9He xx 488  9* 1 @e  xx 400 1s<9 H- I  I 2I<II J2J J J) connectivityc|jdkDr td|dvr tdt||d}tj|j t }tj|j t }td|jdzD]&}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)rN backgroundrr) r ValueErrorr rrr r"rmaxr logical_or)rErN labeled_im convex_obj convex_imgis rrrsF zzA~3446!@AAurcsN00'"  4 51jFJ`F/01r