U ?h @sdZddlmZddlZddlmZmZddlm Z ddl m Z dd l m Z dd lmZdd lmZd d gZddZddZddd Zdddd ZdS)z Convex Hull.)productN) ConvexHull QhullError)grid_points_in_poly) possible_hull)label) unique_rows)warnconvex_hull_imageconvex_hull_objectcCsBtd||f}ttt|dD]\}\}}||||f<q$|S)Nr)gg?)npzeros enumeraterrange)ndimoffsetsZvertexZaxisoffsetrP/var/www/html/venv/lib/python3.8/site-packages/skimage/morphology/convex_hull.py_offsets_diamondsrc Cs|j\}}|jd}tj|td}tj|tjd}tj|tjd}tj|td} t|D]T} tj|| d|f||dtj||| |df|dtj ||| d|| 9}qX|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 rZdtypeN)out) shaperZonesboolemptyZfloat64rdotaddless) gridcoordsZhull_equations tolerancerZn_coordsZn_hull_equationscoords_in_hullZ dot_arrayZtest_ineq_tempZcoords_single_ineqidxrrr_check_coords_in_hulls    r$T绽|=c Cs|j}t|dkr.tdttj|jtdS|dkrLttj |tj d}nrt t |}|rz t |}WnDtk r}z&td|tj|jtdWYSd}~XYnX|j|j}|rt|j}|ddtjddf|d|}t|}z t |} WnFtk rJ}z&td|tj|jtdWYSd}~XYnX| j| j} |dkrt|j| dd } |r| d kn| d k} n>ttjttt|j|df} t| | j|}t||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)Zbinarizer)rrZ count_nonzeror UserWarningrrrrZascontiguousarrayZuint8Z transposeZnonzerorrZpointsverticesrZnewaxisZreshaper rZmgridtuplemapslicer$Z equations)imageZoffset_coordinatesr!Zinclude_bordersrZcoordsZhull0errrZhullr(labelsmaskr r"rrrr IsL  &  $ &  ) connectivitycCs|jdkrtd|dkr"tdt||dd}tj|jtd}tj|jtd}td|dD]}t ||k}t ||}qb|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)r0 backgroundrr) r ValueErrorr rrrrrmaxr logical_or)r,r0Z labeled_imZ convex_objZ convex_imgirrrr s#  )Tr%T)__doc__ itertoolsrnumpyrZ scipy.spatialrrZmeasure.pnpolyrZ _convex_hullrZmeasure._labelr utilr Z _shared.utilsr __all__rr$r r rrrrs      4 ]