/jhddlmZddlmZddlmZgdZedddgZedgd Zd Z d Z y ) ) namedtuple)chain) itemgetter) bounding_box convex_hullPointRectrxyr )lefttopwidthheightctttd|}t|t |}}tttd|}t|t |}}t ||||z ||z S)zComputes the bounding box of an iterable of (x, y) coordinates. Args: locations: iterable of (x, y) tuples. Returns: `Rect`: Coordinates of the bounding box. r)listmaprminmaxr ) locationsx_valuesx_minx_maxy_valuesy_miny_maxs O/var/www/html/serviGia/entorno/lib/python3.12/site-packages/pyzbar/locations.pyrr siC 1 y12Hx=#h-5EC 1 y12Hx=#h-5E ueemUU] ;;cdfd}tt|}t|dkr|n t|||t |}t t tj|S)aComputes the convex hull of an iterable of (x, y) coordinates. Args: points: iterable of (x, y) tuples. Returns: `list`: instances of `Point` - vertices of the convex hull in counter-clockwise order, starting from the vertex with the lexicographically smallest coordinates. Andrew's monotone chain algorithm. O(n log n) complexity. https://en.wikibooks.org/wiki/Algorithm_Implementation/Geometry/Convex_hull/Monotone_chain cfd|d|dz |d|dz z|d|dz |d|dz zz kS)Nrr)p0p1p2s ris_not_clockwisez%convex_hull..is_not_clockwise,sT URU]r!ur!u} - URU]r!ur!u} - .  rcg}|D]`}dt|kr?|d|d|r/|jdt|kr|d|d|r/|j|b|j|S)Nr)lenpopappend)points_respr%s rgozconvex_hull..go2s{ Ac#h,#3CGSWa#H c#h,#3CGSWa#H JJqM    r) sortedsetr)rreversedrrr_make)pointsr/hullr%s @rrrs` CK Ff+/uRZHVr;s>" ; 7S#J'&<= < )(r