Ti[f2dZddlZddlmZmZddlmZmZm Z m Z m Z m Z ddl mZmZdZGdd Zd Zd"d ZdZdZ d#dZ d$dedede ede ede e de ef dZdZdZdedede e fdZd%d!ZdS)&zT packing.py ------------ Pack rectangular regions onto larger rectangular regions. N)logtol) ArrayLikeIntegerNDArrayNumberOptionalfloat64)allclose bounds_treeg-q=c6eZdZdZdZedZddZdS) RectangleBina An N-dimensional binary space partition tree for packing hyper-rectangles. Split logic is pure `numpy` but behaves similarly to `scipy.spatial.Rectangle`. Mostly useful for packing 2D textures and 3D boxes and has not been tested outside of 2 and 3 dimensions. Original article about using this for packing textures: http://www.blackpawn.com/texts/lightmaps/ clg|_d|_tj|tj|_dS)z Create a rectangular bin. Parameters ------------ bounds : (2, dimension *) float Bounds array are `[mins, maxes]` FdtypeN)childoccupiednparrayr boundsselfrs N/DATA/AppData/hermes/venv/lib/python3.11/site-packages/trimesh/path/packing.py__init__zRectangleBin.__init__s.  hvRZ888 c2|j}|d|dz S)z Bounding box size. Returns ---------- extents : (dimension,) float Edge lengths of bounding box rrrs rextentszRectangleBin.extents0say6!9$$rTcf|jD]}|||}||cS |jrdS|j}|d|dz }|rit t |D]G}|t||z }|t k } | rt||}nH| sdSn%||z }|t k rdSd|_|tk r|S| } tj ||f} |d| || z| dd| f<t| ddt| ddf|jdd<|jd||S) aP Insert a rectangle into the bin. Parameters ------------- size : (dimension,) float Size of rectangle to insert/ Returns ---------- inserted : (2,) float or None Position of insertion in the tree or None if the insertion was unsuccessful. )sizerotateNrrTrr#)rinsertrrcopyrangelen_roll _TOL_ZEROallanyargmaxrvstackr) rr"r#rattemptrr roll size_testfitsaxissplitss rr&zRectangleBin.insert=sZ  EllVl<mG2:666G a I Xs7||Q 2 3 3Fhs7||4000G Jw{{{** + +DDbD 1E1  &&u--EEI))%00E |uy('"&q2I2I2I2P2P2R2R*ST uy($/  { + + +DS"S"EN ;;y;88   [FfV!,,,G6Dc'll++  '5D+A+A!BCC WUYYAY..Wq0ABB UYYAY%6%6777!gbq111 ??$$t++ G"-"4"4"6"6K&{3DEQi'+"66GQinn&&G K GK$8 8 )VAY$899==1=EEK'-ay'=K $6!9,1133 3 336!9k":;;J7G"455J$VAY$899H $H *:66 Z8P8PQHN#.+2226&q3I3I3IRX2YYK***KN1-s33 5w;q>!#44N1%,,Yv,FFE$$$!F5M!GENDD  !$F5M!GEN z3!&/22222 '?G ##rc <ddlm}g}g}t|D]h\}}|jdd}||g|z||j|jdg|zitdd|i|\}} g} ttj | d|D]O\}} ||| } | | | | P|| } | || fS)a Pack a list of Path2D objects into a rectangle. Parameters ------------ paths: (n,) Path2D Geometry to be packed Returns ------------ packed : trimesh.path.Path2D All paths packed into a single path object. transforms : (m, 3, 3) float Homogeneous transforms to move paths from their original position to the new one. consume : (n,) bool Which of the original paths were inserted, i.e. `consume.sum() == m` r)r>quantityrpolygonsr;)utilr> enumeratemetadatagetextendpolygons_closedr^rsziprnonzeror'apply_transformappend)pathskwargsr>packableoriginalr_pathrr transformsr[ positionedmatrixrbpackeds rr~r~9sM("!!!!!HH ''II t=$$Z33(*+++-dil;g|]\}}tj||Sr;rdot).0r?bs r zpolygons..s&LLLDAq26!Q<<LLLrc<g|]\}}||S))rr;)rr_mrrss rrzpolygons..s@   E1xq999   rrr;)rsrr rectanglesrdebugrRr)roll_transformrrrzrrVrWr{) rsrrobbr rr[r1r check_boundrs ` @rrsrsgsM,76666666 <))LC!;;;F;;OFGI4gkkmmS]]SSS 1A B B BDLLCG d4K4KLLLMMJ z /!&)))))h      #BJw$7$7$:J G G     "+..... w rGz?2c$tj|tj}|jd}|||dzz }tj|d} d} d} |d} n tj|} t|D]} t||| dk|| \}}| }tj | d |fd}|tj ||z |z}| | tj|z }|| ks|| kr$|} |} ||g}||kr| rn||dxx|g| gggz cc<tj|d | d |S) a Run multiple iterations of rectangle packing, this is the core function for all rectangular packing. Parameters ------------ extents : (n, dimension) float Size of hyper-rectangle to be packed size : None or (dimension,) float Size of sheet to pack onto. If not passed tree will be allowed to create new volume-minimizing parent nodes. density_escape : float Exit early if rectangular density is above this threshold. spacing : float Distance to allow between rectangles iterations : int Number of iterations to run rotate : bool Allow right angle rotations or not. quanta : None or float Discrete "snap" interval. seed If deterministic results are needed seed the RNG here. Returns --------- bounds : (m, 2, dimension) float Axis aligned bounding boxes of inserted hyper-rectangle. inserted : (n,) bool Which of the original rect were packed. rrN@rCrEr)seed)r r"rXr#rMrDz iterations packed with density z0.3f)rrr rGrSrM default_rngr(rprRrNreshapeceilr,rr)r r"density_escapespacing iterationsr#quantardimarea best_density best_countrMirr&r@ extents_alldensityresults rrrsThwbj111G - C7S=  77 # # #DLJ |&&D&11 :  +$aPV    fV^^RI66Q???  gkF233f.%s( / / /1T!))++   / / /rT) return_indexreturn_inversec*g|]}|jSr;r")rrimagess rrzimages..)s333VAY^333rF)r r#rrrrrCcg|] }|j Sr;rrs rrzimages..3s3K3K3KqAF3K3K3Krcg|] }|j Sr;rrs rrzimages..7s,,,QV,,,rN)rDrrch|] }|j Sr;)rrs r zimages..Os---af---rc,g|]}t|Sr;)r))rrs rrzimages..Rs6661A666rbox)PILrruniquerr,r rNintroundastyperrlog2int64listr.newtuplesetrzr"pasteadd)rrrrrrrr_r_inverserr&rZr r"modesrdoneimgoffcorners` rrrsFI / / / / /dSW   5'$3333U333!    zz|||{26&q1113K3KF3K3K3KLLLLLL$,,V,,,!    zz|||g,,AAAqD\   ! ! ( ( - -FfV^^G,,15551EG ==?? ! !# & &D>RWRWT]]+++33BH== |--f---..RY66666778YYtU4[[ ) )F 55D''!!S ::T ! !!fd1g 3c!f<=F LL&L ) ) ) ) HHU3ZZ 6>rc dD}tjd|D}tjd|D}t|fi|\}}tjdt||t |||Dtj}fdttj|d|D}|||fS) aG Pack 3D meshes into a rectangular volume using box packing. Parameters ------------ meshes : (n,) trimesh.Trimesh Input geometry to pack **kwargs : dict Passed to `packing.rectangles` Returns ------------ placed : (m,) trimesh.Trimesh Meshes moved into the rectangular volume. transforms : (m, 4, 4) float Homogeneous transform moving mesh from original position to being packed in a rectangular volume. consume : (n,) bool Which of the original meshes were inserted, i.e. `consume.sum() == m` cg|] }|j Sr;)bounding_box_orientedrs rrzmeshes..{s 4 4 4A # 4 4 4rc&g|]}|jjSr;) primitiver rs rrzmeshes..|s===11;.===rc&g|]}|jjSr;)r transform)ros rrzmeshes..}sBBBak3BBBrcxg|]7\}}tj|tj|8Sr;)rrlinalginv)rrrs rrzmeshes..sF   1 F1bimmA&& ' '   rrrcpg|]2\}}||3Sr;)r'r|)rr_Tmeshess rrzmeshes..sK E1 u ,,Q//rr)rrrrzrr r{) rrobbs obb_extent obb_transformrr[rplaceds ` rrrds!. 5 4V 4 4 4D=====>>JHBBTBBBCCM!66v66OFG  g&fj6IJJJ   j   JBJw//2J??F :w &&rc6 ddlm ddlm}ddlm}t ||} fd|D}t|||D]K\}}}||tj |j |sJ||j_ L||S)a( Visualize a 3D box packing. Parameters ------------ extents : (n, 3) float AABB size before packing. bounds : (n, 2, 3) float AABB location after packing. Returns ------------ scene : trimesh.Scene Scene with boxes at requested locations. rr)Scene) random_colorrc(g|]}|S)r r;)rers rrzvisualize..s# . . .cc!nnn . . .r) creationrscenervisualrrrzr|rr r face_colors) r rrrrrrrcheckrs @r visualizers %%%%%% vw???J . . . .g . . .F F;;..65 &!!!{18U++++++|~~ 5==rrr returnc X t|t|krtdt|dkrgStj|d}|jd}tjtj|dzt|ddf}tjtjdtjgdgdgdggtjtjd gd gd gd gd ggdgdgd gd ggg}t|jdD]}tj ||d}tj||z dtk}| sP||dz | tjtj|dz| ddf} |dddf|||dz z| ddd||f< fd| D||<tjr|dkr3ddlm t# fdt%|||DsJnH|dkr3ddlm t# fdt%|||DsJntd|S)aw Packing returns rotations with integer "roll" which needs to be converted into a homogeneous rotation matrix. Currently supports `dimension=2` and `dimension=3`. Parameters -------------- bounds : (n, 2, dimension) float Axis aligned bounding boxes of packed position extents : (n, dimension) float Original pre-rolled extents will be used to determine rotation to move to `bounds`. Returns ---------- transforms : (n, dimension + 1, dimension + 1) float Homogeneous transformation to move cuboid at the origin into the position determined by `bounds`. z`bounds` must match `extents`rrrCr$)rErE)?rErE)rErEr)rrr)rrrr)rErrErE)rErErEr)rrrr)rErErrErNrc:g|]}tj|Sr;r)rrmats rrz"roll_transform..s#555bfQnn555rrc3K|]:\}}}t||j|V;dS)rNr r|r)rrrrrs r z!roll_transform.. sbAq!Q77::A1EEr)r`c3K|]C\}}}t| dz |dz g|j|VDdS)rrNr)rrrrr`s rrz!roll_transform..stAq!A261q5/:::JJ1MMTVWXXrzunsupported dimension)r) ValueErrorrrNrGrPeyerr(r1r+r-rRrrVrrr,rzr`) rr passedrYrrAr1rolledokrZrrr`s @@@rrrsQ* 6{{c'll""8999 7||q VF # # #F QIWRVIM**S[[!Q,? @ @F  VAYY"2"2"2OOO___!UVV W   q ,,,,,,(((((( -,,(((,,,(((    F0gmA&''66$Q///VVf_A . . . :vvxx  Y]#D) A ..1a0@AA+1!!!Q$<+;fRj3>N+Nqqq*9*i'(5555f555r  z6 >> & & & & & &"67F;;   !^^ + + + + + +"67F;;    455 5 Mr:0yE>ctj|tj|| gdz}t|t fdt |DS)a Check to see if multiple axis-aligned bounding boxes contains overlaps using `rtree`. Parameters ------------ bounds : (n, 2, dimension) float Axis aligned bounding boxes epsilon : float Amount to shrink AABB to avoid spurious floating point hits. Returns -------------- overlap : bool True if any bound intersects any other bound. )rrrc3K|]@\}}t||hkVAdS)N)r intersectionravel)rrrbtrees rrz!bounds_overlap..2s];E1gD  gmmoo . .//A36r)rrrr r-ru)repsilonpaddedr s @rrWrWsz&Xf   GgX+> J J JF v  D IRSYIZIZ  r)NFTN)NrNrTNN)FFrNNN)r)r9numpyr constantsrrtypedrrrr r r rtr r r+rr*rpr~rsrrIstrrrrrrWr;rrrs& JJJJJJJJJJJJJJJJ((((((((  q9q9q9q9q9q9q9q9h888:S$S$S$S$l+'+'+'\111l     ____H$&" $dddd! d 7  d f  d 3-ddddN1'1'1'h>b9bybWW=MbbbbJr