)+CihSSKJr SSKJr SSKJr /SQr\"SSS/5r\"S/S Q5rS r S r g ) ) namedtuple)chain) itemgetter) bounding_box convex_hullPointRectrxyr )lefttopwidthheightc[[[S5U55n[U5[ U5p2[[[S5U55n[U5[ U5pe[ X%X2- Xe- 5$)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 J/home/james-whalen/.local/lib/python3.13/site-packages/pyzbar/locations.pyrr s_C 1 y12Hx=#h-5C 1 y12Hx=#h-5 emU] ;;c^SmU4Sjn[[U55n[U5S:aUO [U"U5U"[ U555n[ [ [RU55$)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 cfSUSUS- USUS- -USUS- USUS- -- :*$)Nrr)p0p1p2s ris_not_clockwise%convex_hull..is_not_clockwise,sT URU]r!ur!u} - URU]r!ur!u} - .  rc>/nUHnnS[U5:aKT"USUSU5(a6UR5 S[U5:aT"USUSU5(aM6URU5 Mp UR5 U$)Nr)lenpopappend)points_respr%s rgoconvex_hull..go2s|Ac#h,#3CGSWa#H#H c#h,#3CGSWa#H#H JJqM   r) sortedsetr*rreversedrrr_make)pointsr0hullr%s @rrrs` CK Ff+/uRZHVr=s>" ; 7S#J'&<= < )(r