o e¾!ã@sœdZddlmZddlZddlmZmZddlm Z ddl m Z dd l m Z dd lmZdd lmZd d gZdd„Zdd„Z  ddd „Zddœdd „ZdS)z Convex Hull.é)ÚproductN)Ú ConvexHullÚ QhullErroré)Úgrid_points_in_polyé)Ú possible_hull)Úlabel)Ú unique_rows)ÚwarnÚconvex_hull_imageÚconvex_hull_objectcCsBt d||f¡}ttt|ƒdƒƒD] \}\}}||||f<q|S)Nr)gà¿gà?)ÚnpÚzerosÚ enumeraterÚrange)ÚndimÚoffsetsZvertexZaxisÚoffset©rúND:\Projects\ConvertPro\env\Lib\site-packages\skimage/morphology/convex_hull.pyÚ_offsets_diamondsrc Cs²|j\}}|jd}tj|td}tj|tjd}tj|tjd}tj|td} t|ƒD]*} tj|| d|…f||dtj||| |d…f|dtj ||| d|| 9}q,|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 r©ZdtypeN)Úout) ÚshaperZonesÚboolÚemptyZfloat64rÚdotÚaddÚless) Ú gridcoordsZhull_equationsÚ tolerancerZn_coordsZn_hull_equationsÚcoords_in_hullZ dot_arrayZtest_ineq_tempZcoords_single_ineqÚidxrrrÚ_check_coords_in_hulls   r$T绽×Ùß|Û=c CsÈ|j}t |¡dkrtdtƒtj|jtdS|dkr&ttj |tj dƒ}n8t  t  |¡¡}|r^zt |ƒ}Wn!tyW}ztd|›ƒtj|jtdWYd}~Sd}~ww|j|j}|rwt|jƒ}|dd…tjdd…f| d|¡}t|ƒ}zt |ƒ} Wn!ty¢}ztd|›ƒtj|jtdWYd}~Sd}~ww| j| j} |dkrÃt|j| dd } |r½| d k} | S| d k} | St tjttt|jƒƒ|df¡} t| | j|ƒ}t ||j¡} | S) 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/ rzIInput image is entirely zero, no valid convex hull. Returning empty imagerrzQFailed to get convex hull image. Returning empty image, see error message below: NéÿÿÿÿF)Zbinarizer)rrZ count_nonzeror Ú UserWarningrrrrZascontiguousarrayZuint8Z transposeZnonzerorrZpointsÚverticesrZnewaxisZreshaper rZmgridÚtupleÚmapÚslicer$Z equations)ÚimageZoffset_coordinatesr!Zinclude_bordersrÚcoordsZhull0ÚerrrZhullr(ÚlabelsÚmaskr r"rrrr Is` ÿ þ€ü  $ þ€ü   ÷ ùÿÿ)Ú connectivitycCs„|jdkr tdƒ‚|dvrtdƒ‚t||dd}tj|jtd}tj|jtd}td| ¡dƒD]}t ||kƒ}t  ||¡}q1|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)r1Ú backgroundrr) rÚ ValueErrorr rrrrrÚmaxr Ú logical_or)r,r1Z labeled_imZ convex_objZ convex_imgÚirrrr ¦s # )Tr%T)Ú__doc__Ú itertoolsrÚnumpyrZ scipy.spatialrrZmeasure.pnpolyrZ _convex_hullrZmeasure._labelr Úutilr Z _shared.utilsr Ú__all__rr$r r rrrrÚs       4 ÿ]