@cornerstonejs/tools 1.55.0 → 1.56.0

package/dist/umd/985.index.js.map

@@ -1 +1 @@
-{"version":3,"file":"985.index.js","mappings":"CAAA,SAA2CA,EAAMC,GAC1B,iBAAZC,SAA0C,iBAAXC,OACxCA,OAAOD,QAAUD,EAAQG,QAAQ,8CAA+CA,QAAQ,yCAA0CA,QAAQ,uBAAwBA,QAAQ,cACjJ,mBAAXC,QAAyBA,OAAOC,IAC9CD,OAAO,CAAC,6CAA8C,wCAAyC,sBAAuB,aAAcJ,GAC1G,iBAAZC,QACdA,QAA4B,mBAAID,EAAQG,QAAQ,8CAA+CA,QAAQ,yCAA0CA,QAAQ,uBAAwBA,QAAQ,cAEzLJ,EAAyB,mBAAIC,EAAQD,EAAK,8CAA+CA,EAAK,yCAA0CA,EAAoB,cAAGA,EAAa,OAC7K,CATD,CASGO,MAAM,CAACC,EAAkCC,EAAkCC,EAAkCC,I,uBCT5GC,ECAAC,E,oFCGJ,MAAM,QAAEC,GAAYC,EAAAA,UAqGb,SAASC,EACdC,EACAC,GAEA,OAlGF,SACED,EACAE,GAEa,IAAAC,EAAA,IADbC,EAAOC,UAAAC,OAAA,QAAAC,IAAAF,UAAA,IAAAA,UAAA,GAEHG,EAAOC,IACPC,EAAON,GAAU,IAAY,EAC7BO,EAAOF,IACPG,EAAOR,GAAU,IAAY,EAC7BS,EAAOJ,IACPK,EAAOV,GAAU,IAAY,EAEjC,MAAMW,EAA6B,KAAb,QAATZ,EAAAH,EAAO,UAAE,IAAAG,OAAA,EAATA,EAAWG,QAGxB,IAAK,IAAIU,EAAI,EAAGA,EAAIhB,EAAOM,OAAQU,IAAK,CACtC,MAAMC,EAAIjB,EAAOgB,GAMP,IAAAE,EAAAC,EALVX,EAAOY,KAAKC,IAAIJ,EAAE,GAAIT,GACtBE,EAAOU,KAAKE,IAAIL,EAAE,GAAIP,GACtBC,EAAOS,KAAKC,IAAIJ,EAAE,GAAIN,GACtBC,EAAOQ,KAAKE,IAAIL,EAAE,GAAIL,GAElBG,IACFF,EAAOO,KAAKC,IAAQ,QAALH,EAACD,EAAE,UAAE,IAAAC,EAAAA,EAAIL,EAAMA,GAC9BC,EAAOM,KAAKE,IAAQ,QAALH,EAACF,EAAE,UAAE,IAAAE,EAAAA,EAAIL,EAAMA,GAElC,CAkCA,OAhCIZ,GACFM,EAAOY,KAAKE,IAAIlB,EAAUF,EAAW,GAAKL,EAAU,EAAGW,GACvDE,EAAOU,KAAKC,IACVjB,EAAUF,EAAW,GAAKL,EAAUK,EAAW,GAAK,EACpDQ,GAEFC,EAAOS,KAAKE,IAAIlB,EAAUF,EAAW,GAAKL,EAAU,EAAGc,GACvDC,EAAOQ,KAAKC,IACVjB,EAAUF,EAAW,GAAKL,EAAUK,EAAW,GAAK,EACpDU,GAGEG,GAA8B,IAAtBb,EAAWI,SACrBO,EAAOO,KAAKE,IAAIlB,EAAUF,EAAW,GAAKL,EAAU,EAAGgB,GACvDC,EAAOM,KAAKC,IACVjB,EAAUF,EAAW,GAAKL,EAAUK,EAAW,GAAK,EACpDY,KAGMV,IAEVI,EAAOY,KAAKE,IAAI,EAAGd,GACnBE,EAAOU,KAAKC,IAAIZ,IAAUC,GAC1BC,EAAOS,KAAKE,IAAI,EAAGX,GACnBC,EAAOQ,KAAKC,IAAIZ,IAAUG,GAEtBG,IACFF,EAAOO,KAAKE,IAAI,EAAGT,GACnBC,EAAOM,KAAKC,IAAIZ,IAAUK,KAIvBC,EACH,CACE,CAACP,EAAME,GACP,CAACC,EAAMC,GACP,CAACC,EAAMC,IAET,CAAC,CAACN,EAAME,GAAO,CAACC,EAAMC,GAAO,KACnC,CA+BSW,CAAqBvB,EAAQC,GAAY,EAClD,C,aCrEe,SAASuB,EACtBC,EACAC,EACAC,EACAC,GAEA,IAAIC,EAAMC,EAAMC,EAAMC,EAAMC,EAAMC,EAE9BC,EAIFA,EADGV,EAAiCW,cACtBX,EAAiCW,gBAEjCX,EACXY,eACAC,aACAC,UAGL,MAAMrC,EAAauB,EAAUe,gBAExBZ,IAQDC,EAAMC,IAAQC,EAAMC,IAAQC,EAAMC,IAASN,GAP7CC,EAAO,EACPC,EAAO5B,EAAW,GAClB6B,EAAO,EACPC,EAAO9B,EAAW,GAClB+B,EAAO,EACPC,EAAOhC,EAAW,IAKpB,MAAMuC,EAAQC,EAAAA,KAAAA,WAAgBb,EAAME,EAAME,GAEpCU,EAAYlB,EAAUmB,eACtBC,EAAaF,EAAUG,MAAM,EAAG,GAChCC,EAAgBJ,EAAUG,MAAM,EAAG,GACnCE,EAAiBL,EAAUG,MAAM,EAAG,GAEpCG,EAAUxB,EAAUyB,cACnBC,EAAYC,EAAeC,GAAmBJ,EAG/CK,EAAgB7B,EAAU8B,aAAad,GAEvCe,EAAUd,EAAAA,KAAAA,WACdG,EAAW,GAAKM,EAChBN,EAAW,GAAKM,EAChBN,EAAW,GAAKM,GAGZM,EAAaf,EAAAA,KAAAA,WACjBK,EAAc,GAAKK,EACnBL,EAAc,GAAKK,EACnBL,EAAc,GAAKK,GAGfM,EAAehB,EAAAA,KAAAA,WACnBM,EAAe,GAAKK,EACpBL,EAAe,GAAKK,EACpBL,EAAe,GAAKK,GAGhBM,EACJxB,EAAW7B,OAASJ,EAAW,GAAKA,EAAW,GAAKA,EAAW,GAC3D0D,EAAY1D,EAAW,GAAKyD,EAC5BE,EAAY3D,EAAW,GAAK0D,EAE5BE,EAAqC,GAErCC,EAAarB,EAAAA,KAAAA,MAAWY,GAE9B,IAAK,IAAIU,EAAI/B,EAAM+B,GAAK9B,EAAM8B,IAAK,CACjC,MAAMC,EAAYvB,EAAAA,KAAAA,MAAWqB,GAE7B,IAAK,IAAIG,EAAInC,EAAMmC,GAAKlC,EAAMkC,IAAK,CACjC,MAAMC,EAAYzB,EAAAA,KAAAA,MAAWqB,GAE7B,IAAK,IAAI/C,EAAIa,EAAMb,GAAKc,EAAMd,IAAK,CACjC,MAAMoD,EAAyB,CAACpD,EAAGkD,EAAGF,GAGtC,GAAItC,EAAeqC,EAA4BK,GAAW,CACxD,MAAMC,EAAQL,EAAIH,EAAYK,EAAIN,EAAY5C,EAAI2C,EAClD,IAAIW,EAEFA,EADEX,EAAY,EACN,CACNxB,EAAWkC,GACXlC,EAAWkC,EAAQ,GACnBlC,EAAWkC,EAAQ,IAGblC,EAAWkC,GAGrBP,EAAcS,KAAK,CAAED,QAAOD,QAAOD,WAAUI,SAAUT,IACnDpC,GACFA,EAAS,CAAE2C,QAAOD,QAAOD,WAAUI,SAAUT,GAEjD,CAGArB,EAAAA,KAAAA,IAASqB,EAAYA,EAAYP,EACnC,CAGAd,EAAAA,KAAAA,KAAUqB,EAAYI,GACtBzB,EAAAA,KAAAA,IAASqB,EAAYA,EAAYN,EACnC,CAGAf,EAAAA,KAAAA,KAAUqB,EAAYE,GACtBvB,EAAAA,KAAAA,IAASqB,EAAYA,EAAYL,EACnC,CAEA,OAAOI,CACT,CC/IO,SAASW,EACdC,EACAC,GAOA,IAAIC,EAEJ,MAAMC,EAAaF,EAAS7B,MAAM,EAAG,GACrC,IAAK,IAAI9B,EAAI,EAAGA,EAAI,EAAGA,IACrB,GAAI6D,EAAWC,OAAM,CAACJ,EAAOL,EAAOU,IAAUL,EAAM1D,KAAO+D,EAAM,GAAG/D,KAAK,CACvE4D,EAAuB5D,EACvB,KACF,CAGF,QAA6BT,IAAzBqE,EACF,MAAM,IAAII,MACR,6EAKJ,MAAMC,EAAW,GAEjB,IAAK,IAAIjE,EAAI,EAAGA,EAAI2D,EAASrE,OAAQU,IACnCiE,EAASV,KAAK,CACZI,EAAS3D,IAAI4D,EAAuB,GAAK,GACzCD,EAAS3D,IAAI4D,EAAuB,GAAK,KAS7C,OCtCa,SACbD,EACAD,EACAQ,GAEA,GAAIP,EAASrE,OAAS,EACpB,OAAO,EAGT,MAAM6E,EAAoBR,EAASrE,OACnC,IAAI8E,EAAmB,EAGvB,MAAMC,GCnBO,SAAkBV,GAC/B,GAAIA,EAASrE,OAAS,EACpB,OAAO,EAGT,MAAM6E,EAAoBR,EAASrE,OAI7BgF,ECRO,SAAgCC,EAAWC,GACxD,GAAID,EAAGjF,SAAWkF,EAAGlF,OACnB,MAAM0E,MAAM,mDAGd,MAAOS,EAAIC,EAAIC,EAAK,GAAKJ,GAClBK,EAAIC,EAAIC,EAAK,GAAKN,EACnBO,EAAKH,EAAKH,EACVO,EAAKH,EAAKH,EACVO,EAAKH,EAAKH,EAIhB,OAAOI,EAAKA,EAAKC,EAAKA,EAAKC,EAAKA,CAClC,CDNgCC,CAFXvB,EAAS,GACVA,EAASQ,EAAoB,IAM/C,OAAOgB,EAAAA,SAAAA,OAAgB,EAAGb,EAC5B,CDI+Cc,CAASzB,GAChD0B,EAAkB1B,EAASrE,QAAU+E,EAAc,EAAI,GAE7D,IAAK,IAAIrE,EAAI,EAAGA,GAAKqF,EAAiBrF,IAAK,CACzC,MAAMuE,EAAKZ,EAAS3D,GAKdwE,EAAKb,EADK3D,IAAMmE,EAAoB,EAAI,EAAInE,EAAI,GAIhDsF,EAAOf,EAAG,IAAMC,EAAG,GAAKD,EAAG,GAAKC,EAAG,GACnCe,EAAOhB,EAAG,IAAMC,EAAG,GAAKD,EAAG,GAAKC,EAAG,GACnCgB,EAAOjB,EAAG,IAAMC,EAAG,GAAKD,EAAG,GAAKC,EAAG,GAKzC,GAFEd,EAAM,IAAM4B,GAAQ5B,EAAM,IAAM8B,GAAQ9B,EAAM,GAAK6B,EAExB,CAE3B,IAAIE,EADmBlB,EAAG,KAAOC,EAAG,GAGpC,IAAKiB,EAAY,CACf,MAAMC,GACFhC,EAAM,GAAKa,EAAG,KAAOC,EAAG,GAAKD,EAAG,KAAQC,EAAG,GAAKD,EAAG,IAAMA,EAAG,GAEhEkB,EAAa/B,EAAM,IAAMgC,CAC3B,CAEAtB,GAAoBqB,EAAa,EAAI,CACvC,CACF,CAEA,SAAUrB,EAAmB,EAC/B,CDVSuB,CAAc1B,EALL,CACdP,GAAOE,EAAuB,GAAK,GACnCF,GAAOE,EAAuB,GAAK,IAIvC,CIpCA,MAAMgC,EAAoB,CAIxBC,QAAS,KAKTC,qBAAqB,EACrBC,2BAA4B,KAI5B,uBAAMC,CAAkBC,GAAkB,IAAAC,EACpCC,KAAKL,0BACDK,KAAKJ,2BAIG,QAAhBG,EAAIC,KAAKN,eAAO,IAAAK,GAAZA,EAAcE,WAIlBD,KAAKL,qBAAsB,EAC3BK,KAAKJ,2BAA6B,IAAIM,SAASC,IAC7CH,KAAKN,QAAU,IAAIU,EAAAA,EACnBJ,KAAKN,QACFW,WAAW,CACVC,eAAgBR,IAEjBS,MAAK,KACJP,KAAKL,qBAAsB,EAC3BQ,GAAS,GACT,UAGAH,KAAKJ,2BACb,EASA,6BAAMY,CAAwBC,GAC5B,MAAM,UAAEC,EAAS,eAAEC,GAAmBF,EAAK,QAAAG,EAAA1H,UAAAC,OADN0H,EAAS,IAAAC,MAAAF,EAAA,EAAAA,EAAA,KAAAG,EAAA,EAAAA,EAAAH,EAAAG,IAATF,EAASE,EAAA,GAAA7H,UAAA6H,GAE9C,MAAOjB,GAAoBe,EAO3B,aANMb,KAAKH,kBAAkBC,SACPE,KAAKN,QAAQO,SAASe,2BAC1CN,EACAC,EAIJ,EAaA,8BAAMM,CAAyBR,GAAoB,QAAAS,EAAAhI,UAAAC,OAAX0H,EAAS,IAAAC,MAAAI,EAAA,EAAAA,EAAA,KAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAATN,EAASM,EAAA,GAAAjI,UAAAiI,GAC/C,MAAOrB,GAAoBe,EAW3B,aAVMb,KAAKH,kBAAkBC,GAEbE,KAAKN,QAAQO,SAASgB,yBACpCR,EAAKzF,WACLyF,EAAK1H,WACL0H,EAAK3E,QACL2E,EAAKjF,UACLiF,EAAKW,OACL,CAACX,EAAKY,cAGV,EAeA,oCAAMC,CAA+Bb,GAAoB,QAAAc,EAAArI,UAAAC,OAAX0H,EAAS,IAAAC,MAAAS,EAAA,EAAAA,EAAA,KAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAATX,EAASW,EAAA,GAAAtI,UAAAsI,GACrD,MAAO1B,GAAoBe,EACrBnB,QAAgB,IAAIU,EAAAA,QACpBV,EAAQW,WAAW,CACvBC,eAAgBR,IAGlB,MAAM,eACJ2B,EAAc,WACdzG,EAAU,2BACV0G,EAA0B,WAC1B3I,EAAU,OACVqI,EAAM,UACN5F,EAAS,QACTM,GACE2E,EAEEkB,EACJC,EAAAA,UAAAA,aAAAA,yBAAgD7I,EAAYiC,GAExDV,EAAYuH,IAAAA,cAClBvH,EAAUwH,cAAc/I,GACxBuB,EAAUyH,UAAUX,GACpB9G,EAAU0H,aAAaxG,GACvBlB,EAAU2H,WAAWnG,GAErB,MAAMoG,EAAcC,IAAAA,YAAyB,CAC3CC,KAAM,SACNC,mBAAoB,EACpBC,OAAQtH,IAGVV,EAAUY,eAAeqH,WAAWL,GAEpC5H,EAAUkI,WAEV,IAAK,MAAMtF,KAASuE,EAAgB,CAClC,MAAMgB,EAAcf,EAA2BgB,IAAIxF,GAEnD,IAAK,MAAMyF,KAAcF,EAAa,CACpC,MAAMG,EAAShK,EACb+J,EAAWE,KAAKC,QAAQtF,WAGnB9C,EAAME,EAAME,GAAQ8G,EAAAA,UAAAA,sBAAgCtH,EAAW,CACpEsI,EAAO,GAAG,GACVA,EAAO,GAAG,GACVA,EAAO,GAAG,MAGLjI,EAAME,EAAME,GAAQ6G,EAAAA,UAAAA,sBAAgCtH,EAAW,CACpEsI,EAAO,GAAG,GACVA,EAAO,GAAG,GACVA,EAAO,GAAG,KAIZvI,EACEC,GACC+C,GAEQC,EACLD,EACAsF,EAAWE,KAAKC,QAAQtF,YAG5BuF,IAAkB,IAAjB,SAAE9F,GAAU8F,EACXpB,EAAyBqB,cAAc/F,EAAUC,EAAM,GAEzD,CACE,CAACxC,EAAMC,GACP,CAACC,EAAMC,GACP,CAACC,EAAMC,IAGb,CACF,CAEA,OAAO4G,EAAyB3G,UAClC,EAOA,mCAAMiI,CAA8BxC,GAAoB,QAAAyC,EAAAhK,UAAAC,OAAX0H,EAAS,IAAAC,MAAAoC,EAAA,EAAAA,EAAA,KAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAATtC,EAASsC,EAAA,GAAAjK,UAAAiK,GACpD,MAAOrD,GAAoBe,EACrBnB,QAAgB,IAAIU,EAAAA,QACpBV,EAAQW,WAAW,CACvBC,eAAgBR,IAGlB,MAAM,kBAAEsD,EAAiB,2BAAE1B,EAA0B,eAAED,GACrDhB,EAEI4C,EAA4B,IAAIC,IAEtCF,EAAkBG,SAAQ,CAACC,EAAkBC,KAC3C,MAAM,WAAE1K,EAAU,WAAEiC,EAAU,UAAEQ,EAAS,QAAEM,EAAO,OAAEsF,GAClDoC,EACIE,EAAU9B,EAAAA,UAAAA,aAAAA,yBACd7I,EACAiC,GAGIV,EAAYuH,IAAAA,cAClBvH,EAAUwH,cAAc/I,GACxBuB,EAAUyH,UAAUX,GACpB9G,EAAU0H,aAAaxG,GACvBlB,EAAU2H,WAAWnG,GAErB,MAAMoG,EAAcC,IAAAA,YAAyB,CAC3CC,KAAM,SACNC,mBAAoB,EACpBC,OAAQtH,IAGVV,EAAUY,eAAeqH,WAAWL,GAEpC5H,EAAUkI,WAEVa,EAA0BM,IAAIF,EAAmB,CAAEC,UAASpJ,aAAY,IAG1E,IAAK,MAAM4C,KAASuE,EAAgB,CAClC,MAAMgB,EAAcf,EAA2BgB,IAAIxF,GAEnD,IAAK,MAAMyF,KAAcF,EAAa,CACpC,GAAKE,UAAAA,EAAYE,KACf,SAEF,MAAMD,EAAShK,EACb+J,EAAWE,KAAKC,QAAQtF,WAGpB,kBAAEiG,GAAsBd,EAAWiB,UAEjCF,QAAS/B,EAAwB,UAAErH,GACzC+I,EAA0BX,IAAIe,IAEzB/I,EAAME,EAAME,GAAQ8G,EAAAA,UAAAA,sBAAgCtH,EAAW,CACpEsI,EAAO,GAAG,GACVA,EAAO,GAAG,GACVA,EAAO,GAAG,MAGLjI,EAAME,EAAME,GAAQ6G,EAAAA,UAAAA,sBAAgCtH,EAAW,CACpEsI,EAAO,GAAG,GACVA,EAAO,GAAG,GACVA,EAAO,GAAG,KAIZvI,EACEC,GACC+C,GAEQC,EACLD,EACAsF,EAAWE,KAAKC,QAAQtF,YAG5BqG,IAAkB,IAAjB,SAAE5G,GAAU4G,EACXlC,EAAyBqB,cAAc/F,EAAUC,EAAM,GAEzD,CACE,CAACxC,EAAMC,GACP,CAACC,EAAMC,GACP,CAACC,EAAMC,IAGb,CACF,CAQA,OANAqI,EAAkBG,SAAQ,CAACC,EAAkBC,KAC3C,MAAQC,QAAS/B,GACf0B,EAA0BX,IAAIe,GAEhCD,EAAiBxI,WAAa2G,EAAyB3G,UAAU,IAE5DoI,CACT,EAcA,oCAAMU,CAA+BrD,GAAoB,QAAAsD,EAAA7K,UAAAC,OAAX0H,EAAS,IAAAC,MAAAiD,EAAA,EAAAA,EAAA,KAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAATnD,EAASmD,EAAA,GAAA9K,UAAA8K,GACrD,MAAOlE,GAAoBe,EAY3B,aAXMb,KAAKH,kBAAkBC,GAEbE,KAAKN,QAAQO,SAASgE,yBACpCxD,EAAK5H,OACL4H,EAAKyD,MACLzD,EAAK1H,WACL0H,EAAK3E,QACL2E,EAAKjF,UACLiF,EAAKW,OAIT,EAQA,qCAAM+C,CAAgC1D,GAAoB,QAAA2D,EAAAlL,UAAAC,OAAX0H,EAAS,IAAAC,MAAAsD,EAAA,EAAAA,EAAA,KAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAATxD,EAASwD,EAAA,GAAAnL,UAAAmL,GACtD,MAAOvE,GAAoBe,QACrBb,KAAKH,kBAAkBC,GAE7B,MAAM,aAAEwE,GAAiB7D,EAEnB8D,EAAWzD,MAAM0D,KAAKF,EAAaG,QAAQC,KAAKrD,IACpD,MAAM,OAAExI,EAAM,MAAEqL,GAAUI,EAAa5B,IAAIrB,GAU3C,MAAO,IATQrB,KAAKN,QAAQO,SAASgE,yBACnCpL,EACAqL,EACAzD,EAAK1H,WACL0H,EAAK3E,QACL2E,EAAKjF,UACLiF,EAAKW,QAKLC,eACD,IAGGsD,QAAgBzE,QAAQ0E,IAAIL,GAE5BM,EAAkBhD,IAAAA,cACxBgD,EAAgB/C,cAAcrB,EAAK1H,YACnC8L,EAAgB9C,UAAUtB,EAAKW,QAC/ByD,EAAgB5C,WAAWxB,EAAK3E,SAChC+I,EAAgB7C,aAAavB,EAAKjF,WAElC,MAAMsJ,EACJrE,EAAK1H,WAAW,GAAK0H,EAAK1H,WAAW,GAAK0H,EAAK1H,WAAW,GAEtDmJ,EAAcC,IAAAA,YAAyB,CAC3CC,KAAM,SACNC,mBAAoB,EACpBC,OAAQ,IAAIyC,WAAWD,KAGzBD,EAAgB3J,eAAeqH,WAAWL,GAC1C2C,EAAgBrC,WAOhB,MAAMb,EACJC,EAAAA,UAAAA,aAAAA,yBACEnB,EAAK1H,WACL8L,EAAgB3J,eAAeC,aAAaC,WAG1C4J,EAAoBL,EAAQD,KAAKO,IACrC,MAAM,KAAEpC,EAAI,WAAE9J,EAAU,UAAEyC,EAAS,OAAE4F,EAAM,QAAEtF,GAAYmJ,EACnDC,EAASrD,IAAAA,cACfqD,EAAOpD,cAAc/I,GACrBmM,EAAOnD,UAAUX,GACjB8D,EAAOjD,WAAWnG,GAClBoJ,EAAOlD,aAAaxG,GAEpB,MAAM0G,EAAcC,IAAAA,YAAyB,CAC3CC,KAAM,SACNC,mBAAoB,EACpBC,OAAQO,IAGVqC,EAAOhK,eAAeqH,WAAWL,GAEjCgD,EAAO1C,WAEP,MAAM2C,EAAevD,EAAAA,UAAAA,aAAAA,yBACnB7I,EACA8J,GAGIuC,EAASF,EAAOG,YAEtB,MAAO,CACLH,SACAC,eACAC,SACApK,WAAY6H,EACZxB,aAAc4D,EAAO5D,aACtB,IA0CH,OAvCAhH,EACEwK,GACA,KAAM,IACNS,IAA4B,IAA3B,SAAErI,EAAQ,SAAEI,GAAUiI,EAKrB,IACE,IAAK,MAAMC,KAAcP,EAAmB,CAC1C,MAAM,OAAEE,EAAM,OAAEE,EAAM,aAAED,EAAY,aAAE9D,GAAiBkE,EAEjDrI,EAAQgI,EAAOM,aAAanI,GAGlC,GACEH,EAAM,GAAKkI,EAAO,IAClBlI,EAAM,GAAKkI,EAAO,IAClBlI,EAAM,GAAKkI,EAAO,IAClBlI,EAAM,GAAKkI,EAAO,IAClBlI,EAAM,GAAKkI,EAAO,IAClBlI,EAAM,GAAKkI,EAAO,GAElB,SAGF,MAAMK,EAAevI,EAAMwH,IAAIzK,KAAKyL,OAEpC,GADcP,EAAaQ,YAAYF,GAC3B,EAAG,CACb9D,EAAyBqB,cAAc/F,EAAUoE,GACjD,KACF,CACF,CACF,CAAE,MAAOuE,GACP,KAKCjE,EAAyB3G,UAClC,IAGF6K,EAAAA,EAAAA,IAAOpG,E,UCldP1H,EAAOD,QAAUO,C,UCAjBN,EAAOD,QAAUM,C,UCAjBL,EAAOD,QAAUQ,C,UCAjBP,EAAOD,QAAUS,C,GCCbuN,EAA2B,CAAC,EAGhC,SAASC,EAAoBC,GAE5B,IAAIC,EAAeH,EAAyBE,GAC5C,QAAqB5M,IAAjB6M,EACH,OAAOA,EAAanO,QAGrB,IAAIC,EAAS+N,EAAyBE,GAAY,CAGjDlO,QAAS,CAAC,GAOX,OAHAoO,EAAoBF,GAAUjO,EAAQA,EAAOD,QAASiO,GAG/ChO,EAAOD,OACf,C,OAGAiO,EAAoBI,EAAID,EAGxBH,EAAoBK,EAAI,KAGvB,IAAIC,EAAsBN,EAAoBO,OAAElN,EAAW,CAAC,KAAK,IAAO2M,EAAoB,OAE5F,OADsBA,EAAoBO,EAAED,EAClB,EbjCvB7N,EAAW,GACfuN,EAAoBO,EAAI,CAACrB,EAAQsB,EAAUC,EAAIC,KAC9C,IAAGF,EAAH,CAMA,IAAIG,EAAepN,IACnB,IAASO,EAAI,EAAGA,EAAIrB,EAASW,OAAQU,IAAK,CACrC0M,EAAW/N,EAASqB,GAAG,GACvB2M,EAAKhO,EAASqB,GAAG,GACjB4M,EAAWjO,EAASqB,GAAG,GAE3B,IAJA,IAGI8M,GAAY,EACP5J,EAAI,EAAGA,EAAIwJ,EAASpN,OAAQ4D,MACpB,EAAX0J,GAAsBC,GAAgBD,IAAaG,OAAOnC,KAAKsB,EAAoBO,GAAG3I,OAAOkJ,GAASd,EAAoBO,EAAEO,GAAKN,EAASxJ,MAC9IwJ,EAASO,OAAO/J,IAAK,IAErB4J,GAAY,EACTF,EAAWC,IAAcA,EAAeD,IAG7C,GAAGE,EAAW,CACbnO,EAASsO,OAAOjN,IAAK,GACrB,IAAIkN,EAAIP,SACEpN,IAAN2N,IAAiB9B,EAAS8B,EAC/B,CACD,CACA,OAAO9B,CArBP,CAJCwB,EAAWA,GAAY,EACvB,IAAI,IAAI5M,EAAIrB,EAASW,OAAQU,EAAI,GAAKrB,EAASqB,EAAI,GAAG,GAAK4M,EAAU5M,IAAKrB,EAASqB,GAAKrB,EAASqB,EAAI,GACrGrB,EAASqB,GAAK,CAAC0M,EAAUC,EAAIC,EAuBjB,Ec3BdV,EAAoBiB,EAAKjP,IACxB,IAAIkP,EAASlP,GAAUA,EAAOmP,WAC7B,IAAOnP,EAAiB,QACxB,IAAM,EAEP,OADAgO,EAAoBoB,EAAEF,EAAQ,CAAEG,EAAGH,IAC5BA,CAAM,ECLdlB,EAAoBoB,EAAI,CAACrP,EAASuP,KACjC,IAAI,IAAIR,KAAOQ,EACXtB,EAAoBuB,EAAED,EAAYR,KAASd,EAAoBuB,EAAExP,EAAS+O,IAC5ED,OAAOW,eAAezP,EAAS+O,EAAK,CAAEW,YAAY,EAAM9E,IAAK2E,EAAWR,IAE1E,ECNDd,EAAoB0B,EAAI,CAAC,EAGzB1B,EAAoB2B,EAAKC,GACjBzH,QAAQ0E,IAAIgC,OAAOnC,KAAKsB,EAAoB0B,GAAGG,QAAO,CAACrD,EAAUsC,KACvEd,EAAoB0B,EAAEZ,GAAKc,EAASpD,GAC7BA,IACL,KCNJwB,EAAoB8B,EAAKF,GAEZA,EAAU,YCHvB5B,EAAoB+B,EAAI,WACvB,GAA0B,iBAAfC,WAAyB,OAAOA,WAC3C,IACC,OAAO/H,MAAQ,IAAIgI,SAAS,cAAb,EAChB,CAAE,MAAON,GACR,GAAsB,iBAAXO,OAAqB,OAAOA,MACxC,CACA,CAPuB,GCAxBlC,EAAoBuB,EAAI,CAACY,EAAKC,IAAUvB,OAAOwB,UAAUC,eAAeC,KAAKJ,EAAKC,G,MCAlF,IAAII,EACAxC,EAAoB+B,EAAEU,gBAAeD,EAAYxC,EAAoB+B,EAAEW,SAAW,IACtF,IAAIC,EAAW3C,EAAoB+B,EAAEY,SACrC,IAAKH,GAAaG,IACbA,EAASC,gBACZJ,EAAYG,EAASC,cAAcC,MAC/BL,GAAW,CACf,IAAIM,EAAUH,EAASI,qBAAqB,UAC5C,GAAGD,EAAQ1P,OAEV,IADA,IAAIU,EAAIgP,EAAQ1P,OAAS,EAClBU,GAAK,IAAM0O,GAAWA,EAAYM,EAAQhP,KAAK+O,GAExD,CAID,IAAKL,EAAW,MAAM,IAAI1K,MAAM,yDAChC0K,EAAYA,EAAUQ,QAAQ,OAAQ,IAAIA,QAAQ,QAAS,IAAIA,QAAQ,YAAa,KACpFhD,EAAoBjM,EAAIyO,C,WCdxB,IAAIS,EAAkB,CACrB,IAAK,GAkBNjD,EAAoB0B,EAAE5N,EAAI,CAAC8N,EAASpD,KAE/ByE,EAAgBrB,IAElBa,cAAczC,EAAoBjM,EAAIiM,EAAoB8B,EAAEF,GAE9D,EAGD,IAAIsB,EAAqB9Q,KAAqC,+BAAIA,KAAqC,gCAAK,GACxG+Q,EAA6BD,EAAmB7L,KAAK+L,KAAKF,GAC9DA,EAAmB7L,KAzBCyF,IACnB,IAAI0D,EAAW1D,EAAK,GAChBuG,EAAcvG,EAAK,GACnBwG,EAAUxG,EAAK,GACnB,IAAI,IAAImD,KAAYoD,EAChBrD,EAAoBuB,EAAE8B,EAAapD,KACrCD,EAAoBI,EAAEH,GAAYoD,EAAYpD,IAIhD,IADGqD,GAASA,EAAQtD,GACdQ,EAASpN,QACd6P,EAAgBzC,EAAS+C,OAAS,EACnCJ,EAA2BrG,EAAK,C,KpBrB7BpK,EAAOsN,EAAoBK,EAC/BL,EAAoBK,EAAI,IAChBL,EAAoB2B,EAAE,IAAInH,KAAK9H,GqBDbsN,EAAoBK,G","sources":["webpack://cornerstoneTools3D/webpack/universalModuleDefinition","webpack://cornerstoneTools3D/webpack/runtime/chunk loaded","webpack://cornerstoneTools3D/webpack/runtime/startup chunk dependencies","webpack://cornerstoneTools3D/./src/utilities/boundingBox/getBoundingBoxAroundShape.ts","webpack://cornerstoneTools3D/./src/utilities/pointInShapeCallback.ts","webpack://cornerstoneTools3D/./src/utilities/math/polyline/isPointInsidePolyline3D.ts","webpack://cornerstoneTools3D/./src/utilities/math/polyline/containsPoint.ts","webpack://cornerstoneTools3D/./src/utilities/math/polyline/isClosed.ts","webpack://cornerstoneTools3D/./src/utilities/math/point/distanceToPointSquared.ts","webpack://cornerstoneTools3D/./src/workers/polySegConverters.js","webpack://cornerstoneTools3D/external umd \"@kitware/vtk.js/Common/Core/DataArray\"","webpack://cornerstoneTools3D/external umd \"@kitware/vtk.js/Common/DataModel/ImageData\"","webpack://cornerstoneTools3D/external umd {\"root\":\"cornerstone3D\",\"commonjs\":\"@cornerstonejs/core\",\"commonjs2\":\"@cornerstonejs/core\",\"amd\":\"@cornerstonejs/core\"}","webpack://cornerstoneTools3D/external umd {\"root\":\"window\",\"commonjs\":\"gl-matrix\",\"commonjs2\":\"gl-matrix\",\"amd\":\"gl-matrix\"}","webpack://cornerstoneTools3D/webpack/bootstrap","webpack://cornerstoneTools3D/webpack/runtime/compat get default export","webpack://cornerstoneTools3D/webpack/runtime/define property getters","webpack://cornerstoneTools3D/webpack/runtime/ensure chunk","webpack://cornerstoneTools3D/webpack/runtime/get javascript chunk filename","webpack://cornerstoneTools3D/webpack/runtime/global","webpack://cornerstoneTools3D/webpack/runtime/hasOwnProperty shorthand","webpack://cornerstoneTools3D/webpack/runtime/publicPath","webpack://cornerstoneTools3D/webpack/runtime/importScripts chunk loading","webpack://cornerstoneTools3D/webpack/startup"],"sourcesContent":["(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory(require(\"@kitware/vtk.js/Common/DataModel/ImageData\"), require(\"@kitware/vtk.js/Common/Core/DataArray\"), require(\"@cornerstonejs/core\"), require(\"gl-matrix\"));\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([\"@kitware/vtk.js/Common/DataModel/ImageData\", \"@kitware/vtk.js/Common/Core/DataArray\", \"@cornerstonejs/core\", \"gl-matrix\"], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"cornerstoneTools3D\"] = factory(require(\"@kitware/vtk.js/Common/DataModel/ImageData\"), require(\"@kitware/vtk.js/Common/Core/DataArray\"), require(\"@cornerstonejs/core\"), require(\"gl-matrix\"));\n\telse\n\t\troot[\"cornerstoneTools3D\"] = factory(root[\"@kitware/vtk.js/Common/DataModel/ImageData\"], root[\"@kitware/vtk.js/Common/Core/DataArray\"], root[\"cornerstone3D\"], root[\"window\"]);\n})(self, (__WEBPACK_EXTERNAL_MODULE__283__, __WEBPACK_EXTERNAL_MODULE__785__, __WEBPACK_EXTERNAL_MODULE__953__, __WEBPACK_EXTERNAL_MODULE__976__) => {\nreturn ","var deferred = [];\n__webpack_require__.O = (result, chunkIds, fn, priority) => {\n\tif(chunkIds) {\n\t\tpriority = priority || 0;\n\t\tfor(var i = deferred.length; i > 0 && deferred[i - 1][2] > priority; i--) deferred[i] = deferred[i - 1];\n\t\tdeferred[i] = [chunkIds, fn, priority];\n\t\treturn;\n\t}\n\tvar notFulfilled = Infinity;\n\tfor (var i = 0; i < deferred.length; i++) {\n\t\tvar chunkIds = deferred[i][0];\n\t\tvar fn = deferred[i][1];\n\t\tvar priority = deferred[i][2];\n\t\tvar fulfilled = true;\n\t\tfor (var j = 0; j < chunkIds.length; j++) {\n\t\t\tif ((priority & 1 === 0 || notFulfilled >= priority) && Object.keys(__webpack_require__.O).every((key) => (__webpack_require__.O[key](chunkIds[j])))) {\n\t\t\t\tchunkIds.splice(j--, 1);\n\t\t\t} else {\n\t\t\t\tfulfilled = false;\n\t\t\t\tif(priority < notFulfilled) notFulfilled = priority;\n\t\t\t}\n\t\t}\n\t\tif(fulfilled) {\n\t\t\tdeferred.splice(i--, 1)\n\t\t\tvar r = fn();\n\t\t\tif (r !== undefined) result = r;\n\t\t}\n\t}\n\treturn result;\n};","var next = __webpack_require__.x;\n__webpack_require__.x = () => {\n\treturn __webpack_require__.e(78).then(next);\n};","import type { Types } from '@cornerstonejs/core';\nimport { CONSTANTS } from '@cornerstonejs/core';\n\nconst { EPSILON } = CONSTANTS;\n\n/** Bounding box type */\ntype BoundingBox =\n  | [Types.Point2, Types.Point2, null]\n  | [Types.Point2, Types.Point2, Types.Point2];\n\nfunction calculateBoundingBox(\n  points,\n  dimensions,\n  isWorld = false\n): BoundingBox {\n  let xMin = Infinity;\n  let xMax = isWorld ? -Infinity : 0;\n  let yMin = Infinity;\n  let yMax = isWorld ? -Infinity : 0;\n  let zMin = Infinity;\n  let zMax = isWorld ? -Infinity : 0;\n\n  const is3D = points[0]?.length === 3;\n\n  // use for loop for performance\n  for (let i = 0; i < points.length; i++) {\n    const p = points[i];\n    xMin = Math.min(p[0], xMin);\n    xMax = Math.max(p[0], xMax);\n    yMin = Math.min(p[1], yMin);\n    yMax = Math.max(p[1], yMax);\n\n    if (is3D) {\n      zMin = Math.min(p[2] ?? zMin, zMin);\n      zMax = Math.max(p[2] ?? zMax, zMax);\n    }\n  }\n\n  if (dimensions) {\n    xMin = Math.max(isWorld ? dimensions[0] + EPSILON : 0, xMin);\n    xMax = Math.min(\n      isWorld ? dimensions[0] - EPSILON : dimensions[0] - 1,\n      xMax\n    );\n    yMin = Math.max(isWorld ? dimensions[1] + EPSILON : 0, yMin);\n    yMax = Math.min(\n      isWorld ? dimensions[1] - EPSILON : dimensions[1] - 1,\n      yMax\n    );\n\n    if (is3D && dimensions.length === 3) {\n      zMin = Math.max(isWorld ? dimensions[2] + EPSILON : 0, zMin);\n      zMax = Math.min(\n        isWorld ? dimensions[2] - EPSILON : dimensions[2] - 1,\n        zMax\n      );\n    }\n  } else if (!isWorld) {\n    // still need to bound to 0 and Infinity if no dimensions are provided for ijk\n    xMin = Math.max(0, xMin);\n    xMax = Math.min(Infinity, xMax);\n    yMin = Math.max(0, yMin);\n    yMax = Math.min(Infinity, yMax);\n\n    if (is3D) {\n      zMin = Math.max(0, zMin);\n      zMax = Math.min(Infinity, zMax);\n    }\n  }\n\n  return is3D\n    ? [\n        [xMin, xMax],\n        [yMin, yMax],\n        [zMin, zMax],\n      ]\n    : [[xMin, xMax], [yMin, yMax], null];\n}\n\n/**\n * With a given vertices (points) coordinates in 2D or 3D in IJK, it calculates the minimum and maximum\n * coordinate in each axis, and returns them. If clipBounds are provided it also\n * clip the min, max to the provided width, height and depth\n *\n * @param points - shape corner points coordinates either in IJK (image coordinate)\n * @param dimensions - bounds to clip the min, max\n * @returns [[xMin,xMax],[yMin,yMax], [zMin,zMax]]\n */\nexport function getBoundingBoxAroundShapeIJK(\n  points: Types.Point2[] | Types.Point3[],\n  dimensions?: Types.Point2 | Types.Point3\n): BoundingBox {\n  return calculateBoundingBox(points, dimensions, false);\n}\n\n/**\n * With a given vertices (points) coordinates in 2D or 3D in World Coordinates, it calculates the minimum and maximum\n * coordinate in each axis, and returns them. If clipBounds are provided it also\n * clip the min, max to the provided width, height and depth\n *\n * @param points - shape corner points coordinates either in IJK (image coordinate)\n * @param clipBounds - bounds to clip the min, max\n * @returns [[xMin,xMax],[yMin,yMax], [zMin,zMax]]\n */\nexport function getBoundingBoxAroundShapeWorld(\n  points: Types.Point2[] | Types.Point3[],\n  clipBounds?: Types.Point2 | Types.Point3\n): BoundingBox {\n  return calculateBoundingBox(points, clipBounds, true);\n}\n","import { vec3 } from 'gl-matrix';\nimport type { Types } from '@cornerstonejs/core';\nimport type { vtkImageData } from '@kitware/vtk.js/Common/DataModel/ImageData';\nimport BoundsIJK from '../types/BoundsIJK';\n\nexport type PointInShape = {\n  value: number;\n  index: number;\n  pointIJK: vec3;\n  pointLPS: vec3;\n};\n\nexport type PointInShapeCallback = ({\n  value,\n  index,\n  pointIJK,\n  pointLPS,\n}: {\n  value: number;\n  index: number;\n  pointIJK: vec3;\n  pointLPS: vec3;\n}) => void;\n\nexport type ShapeFnCriteria = (pointLPS: vec3, pointIJK: vec3) => boolean;\n\n/**\n * For each point in the image (If boundsIJK is not provided, otherwise, for each\n * point in the provided bounding box), It runs the provided callback IF the point\n * passes the provided criteria to be inside the shape (which is defined by the\n * provided pointInShapeFn)\n *\n * @param imageData - The image data object.\n * @param dimensions - The dimensions of the image.\n * @param pointInShapeFn - A function that takes a point in LPS space and returns\n * true if the point is in the shape and false if it is not.\n * @param callback - A function that will be called for\n * every point in the shape.\n * @param boundsIJK - The bounds of the volume in IJK coordinates.\n */\nexport default function pointInShapeCallback(\n  imageData: vtkImageData | Types.CPUImageData,\n  pointInShapeFn: ShapeFnCriteria,\n  callback?: PointInShapeCallback,\n  boundsIJK?: BoundsIJK\n): Array<PointInShape> {\n  let iMin, iMax, jMin, jMax, kMin, kMax;\n\n  let scalarData;\n\n  // if getScalarData is a method on imageData\n  if ((imageData as Types.CPUImageData).getScalarData) {\n    scalarData = (imageData as Types.CPUImageData).getScalarData();\n  } else {\n    scalarData = (imageData as vtkImageData)\n      .getPointData()\n      .getScalars()\n      .getData();\n  }\n\n  const dimensions = imageData.getDimensions();\n\n  if (!boundsIJK) {\n    iMin = 0;\n    iMax = dimensions[0];\n    jMin = 0;\n    jMax = dimensions[1];\n    kMin = 0;\n    kMax = dimensions[2];\n  } else {\n    [[iMin, iMax], [jMin, jMax], [kMin, kMax]] = boundsIJK;\n  }\n\n  const start = vec3.fromValues(iMin, jMin, kMin);\n\n  const direction = imageData.getDirection();\n  const rowCosines = direction.slice(0, 3);\n  const columnCosines = direction.slice(3, 6);\n  const scanAxisNormal = direction.slice(6, 9);\n\n  const spacing = imageData.getSpacing();\n  const [rowSpacing, columnSpacing, scanAxisSpacing] = spacing;\n\n  // @ts-ignore will be fixed in vtk-master\n  const worldPosStart = imageData.indexToWorld(start);\n\n  const rowStep = vec3.fromValues(\n    rowCosines[0] * rowSpacing,\n    rowCosines[1] * rowSpacing,\n    rowCosines[2] * rowSpacing\n  );\n\n  const columnStep = vec3.fromValues(\n    columnCosines[0] * columnSpacing,\n    columnCosines[1] * columnSpacing,\n    columnCosines[2] * columnSpacing\n  );\n\n  const scanAxisStep = vec3.fromValues(\n    scanAxisNormal[0] * scanAxisSpacing,\n    scanAxisNormal[1] * scanAxisSpacing,\n    scanAxisNormal[2] * scanAxisSpacing\n  );\n\n  const xMultiple =\n    scalarData.length / dimensions[2] / dimensions[1] / dimensions[0];\n  const yMultiple = dimensions[0] * xMultiple;\n  const zMultiple = dimensions[1] * yMultiple;\n\n  const pointsInShape: Array<PointInShape> = [];\n\n  const currentPos = vec3.clone(worldPosStart);\n\n  for (let k = kMin; k <= kMax; k++) {\n    const startPosJ = vec3.clone(currentPos);\n\n    for (let j = jMin; j <= jMax; j++) {\n      const startPosI = vec3.clone(currentPos);\n\n      for (let i = iMin; i <= iMax; i++) {\n        const pointIJK: Types.Point3 = [i, j, k];\n\n        // The current world position (pointLPS) is now in currentPos\n        if (pointInShapeFn(currentPos as Types.Point3, pointIJK)) {\n          const index = k * zMultiple + j * yMultiple + i * xMultiple;\n          let value;\n          if (xMultiple > 2) {\n            value = [\n              scalarData[index],\n              scalarData[index + 1],\n              scalarData[index + 2],\n            ];\n          } else {\n            value = scalarData[index];\n          }\n\n          pointsInShape.push({ value, index, pointIJK, pointLPS: currentPos });\n          if (callback) {\n            callback({ value, index, pointIJK, pointLPS: currentPos });\n          }\n        }\n\n        // Increment currentPos by rowStep for the next iteration\n        vec3.add(currentPos, currentPos, rowStep);\n      }\n\n      // Reset currentPos to the start of the next J line and increment by columnStep\n      vec3.copy(currentPos, startPosI);\n      vec3.add(currentPos, currentPos, columnStep);\n    }\n\n    // Reset currentPos to the start of the next K slice and increment by scanAxisStep\n    vec3.copy(currentPos, startPosJ);\n    vec3.add(currentPos, currentPos, scanAxisStep);\n  }\n\n  return pointsInShape;\n}\n","import type { Types } from '@cornerstonejs/core';\nimport containsPoint from './containsPoint';\n\n/**\n * Determines whether a 3D point is inside a polyline in 3D space.\n *\n * The algorithm works by reducing the polyline and point to 2D space, and then\n * using the 2D algorithm to determine whether the point is inside the polyline.\n *\n * @param point - The 3D point to test.\n * @param polyline - The polyline represented as an array of 3D points.\n * @returns A boolean indicating whether the point is inside the polyline.\n * @throws An error if a shared dimension index cannot be found for the polyline points.\n */\nexport function isPointInsidePolyline3D(\n  point: Types.Point3,\n  polyline: Types.Point3[]\n) {\n  // Todo: handle oblique planes\n\n  // We need to reduce one dimension to 2D, so basically\n  // we need to find the dimension index that is shared by all points\n  // Use the first three points, two is enough but three is more robust\n  let sharedDimensionIndex;\n\n  const testPoints = polyline.slice(0, 3);\n  for (let i = 0; i < 3; i++) {\n    if (testPoints.every((point, index, array) => point[i] === array[0][i])) {\n      sharedDimensionIndex = i;\n      break;\n    }\n  }\n\n  if (sharedDimensionIndex === undefined) {\n    throw new Error(\n      'Cannot find a shared dimension index for polyline, probably oblique plane'\n    );\n  }\n\n  // convert polyline list and point to 2D\n  const points2D = [] as Types.Point2[];\n\n  for (let i = 0; i < polyline.length; i++) {\n    points2D.push([\n      polyline[i][(sharedDimensionIndex + 1) % 3],\n      polyline[i][(sharedDimensionIndex + 2) % 3],\n    ]);\n  }\n\n  const point2D = [\n    point[(sharedDimensionIndex + 1) % 3],\n    point[(sharedDimensionIndex + 2) % 3],\n  ] as Types.Point2;\n\n  return containsPoint(points2D, point2D);\n}\n","import type { Types } from '@cornerstonejs/core';\nimport isClosed from './isClosed';\n\n/**\n * Checks if a 2D point is inside the polyline.\n *\n * A point is inside a curve/polygon if the number of intersections between the horizontal\n * ray emanating from the given point and to the right and the line segments is odd.\n * https://www.eecs.umich.edu/courses/eecs380/HANDOUTS/PROJ2/InsidePoly.html\n *\n * Note that a point on the polyline is considered inside.\n *\n * @param polyline - Polyline points (2D)\n * @param point - 2D Point\n * @returns True if the point is inside the polyline or false otherwise\n */\nexport default function containsPoint(\n  polyline: Types.Point2[],\n  point: Types.Point2,\n  closed?: boolean\n): boolean {\n  if (polyline.length < 3) {\n    return false;\n  }\n\n  const numPolylinePoints = polyline.length;\n  let numIntersections = 0;\n\n  // Test intersection against [end, start] line segment if it should be closed\n  const shouldClose = !(closed === undefined ? isClosed(polyline) : closed);\n  const maxSegmentIndex = polyline.length - (shouldClose ? 1 : 2);\n\n  for (let i = 0; i <= maxSegmentIndex; i++) {\n    const p1 = polyline[i];\n\n    // Calculating the next point index without using % (mod) operator like in\n    // `(i + 1) % numPolylinePoints` to make it 20% faster\n    const p2Index = i === numPolylinePoints - 1 ? 0 : i + 1;\n    const p2 = polyline[p2Index];\n\n    // Calculating min/max without using Math.min/max to make it ~3% faster\n    const maxX = p1[0] >= p2[0] ? p1[0] : p2[0];\n    const maxY = p1[1] >= p2[1] ? p1[1] : p2[1];\n    const minY = p1[1] <= p2[1] ? p1[1] : p2[1];\n\n    const mayIntersectLineSegment =\n      point[0] <= maxX && point[1] >= minY && point[1] < maxY;\n\n    if (mayIntersectLineSegment) {\n      const isVerticalLine = p1[0] === p2[0];\n      let intersects = isVerticalLine;\n\n      if (!intersects) {\n        const xIntersection =\n          ((point[1] - p1[1]) * (p2[0] - p1[0])) / (p2[1] - p1[1]) + p1[0];\n\n        intersects = point[0] <= xIntersection;\n      }\n\n      numIntersections += intersects ? 1 : 0;\n    }\n  }\n\n  return !!(numIntersections % 2);\n}\n","import { glMatrix } from 'gl-matrix';\nimport type { Types } from '@cornerstonejs/core';\nimport * as math from '..';\n\n/**\n * A polyline is considered closed if the start and end points are at the same position\n *\n * @param polyline - Polyline points (2D)\n * @returns True if the polyline is already closed or false otherwise\n */\nexport default function isClosed(polyline: Types.Point2[]): boolean {\n  if (polyline.length < 3) {\n    return false;\n  }\n\n  const numPolylinePoints = polyline.length;\n\n  const firstPoint = polyline[0];\n  const lastPoint = polyline[numPolylinePoints - 1];\n  const distFirstToLastPoints = math.point.distanceToPointSquared(\n    firstPoint,\n    lastPoint\n  );\n\n  return glMatrix.equals(0, distFirstToLastPoints);\n}\n","import type { Types } from '@cornerstonejs/core';\n\ntype Point = Types.Point2 | Types.Point3;\n\n/**\n * Calculates the distance squared of a point to another point\n *\n * @param p1 - x,y or x,y,z of the point\n * @param p2 - x,y or x,y,z of the point\n * @returns distance\n */\nexport default function distanceToPointSquared(p1: Point, p2: Point): number {\n  if (p1.length !== p2.length) {\n    throw Error('Both points should have the same dimensionality');\n  }\n\n  const [x1, y1, z1 = 0] = p1;\n  const [x2, y2, z2 = 0] = p2;\n  const dx = x2 - x1;\n  const dy = y2 - y1;\n  const dz = z2 - z1;\n\n  // Time to square 10M numbers:\n  //   (n * n) = 161ms | (n ** 2) = 199ms | Math.pow(n, 2) = 29529ms\n  return dx * dx + dy * dy + dz * dz;\n}\n","import { expose } from 'comlink';\nimport vtkImageData from '@kitware/vtk.js/Common/DataModel/ImageData';\nimport vtkDataArray from '@kitware/vtk.js/Common/Core/DataArray';\nimport ICRPolySeg from '@icr/polyseg-wasm';\nimport { utilities } from '@cornerstonejs/core';\nimport { getBoundingBoxAroundShapeWorld } from '../utilities/boundingBox';\nimport { pointInShapeCallback } from '../utilities';\nimport { isPointInsidePolyline3D } from '../utilities/math/polyline';\n\n/**\n * Object containing methods for converting between different representations of\n * segmentations (e.g., contour, labelmap, surface, etc.) These logics\n * are used in a webworker to avoid blocking the main thread. You can\n * search for workerManager.executeTask('polySeg', ...) to see\n * how these methods are used.\n *\n * See also the webworker docs at packages/docs/docs/concepts/cornerstone-core/web-worker.md\n * to learn more about how to use webworkers in the context of Cornerstone.\n */\nconst polySegConverters = {\n  /**\n   * The polySeg instance that is used to convert between different representations\n   */\n  polySeg: null,\n  /**\n   * Utilities to keep track of the initialization state of the polySeg instance\n   * and avoid initializing it multiple times\n   */\n  polySegInitializing: false,\n  polySegInitializingPromise: null,\n  /**\n   * This method initializes the polySeg instance and sets it to this.polySeg\n   */\n  async initializePolySeg(progressCallback) {\n    if (this.polySegInitializing) {\n      await this.polySegInitializingPromise;\n      return;\n    }\n\n    if (this.polySeg?.instance) {\n      return;\n    }\n\n    this.polySegInitializing = true;\n    this.polySegInitializingPromise = new Promise((resolve) => {\n      this.polySeg = new ICRPolySeg();\n      this.polySeg\n        .initialize({\n          updateProgress: progressCallback,\n        })\n        .then(() => {\n          this.polySegInitializing = false;\n          resolve();\n        });\n    });\n\n    await this.polySegInitializingPromise;\n  },\n  /**\n   * Converts a contour to a surface using the PolySeg library.\n   * @param {Object} args - The arguments for the conversion.\n   * @param {Array} args.polylines - The polylines representing the contour.\n   * @param {Array} args.numPointsArray - The number of points in each polyline.\n   * @param {...Function} callbacks - Optional callback functions.\n   * @returns {Promise} - A promise that resolves to the converted surface.\n   */\n  async convertContourToSurface(args, ...callbacks) {\n    const { polylines, numPointsArray } = args;\n    const [progressCallback] = callbacks;\n    await this.initializePolySeg(progressCallback);\n    const results = await this.polySeg.instance.convertContourRoiToSurface(\n      polylines,\n      numPointsArray\n    );\n\n    return results;\n  },\n  /**\n   * Converts a labelmap to a surface using the specified arguments.\n   * @param {Object} args - The arguments for the conversion.\n   * @param {Array} args.scalarData - The scalar data of the labelmap.\n   * @param {Array} args.dimensions - The dimensions of the labelmap.\n   * @param {Array} args.spacing - The spacing of the labelmap.\n   * @param {Array} args.direction - The direction of the labelmap.\n   * @param {Array} args.origin - The origin of the labelmap.\n   * @param {number} args.segmentIndex - The segment index of the labelmap.\n   * @param {Function} progressCallback - The callback function for progress updates.\n   * @returns {Promise} - A promise that resolves with the converted surface results.\n   */\n  async convertLabelmapToSurface(args, ...callbacks) {\n    const [progressCallback] = callbacks;\n    await this.initializePolySeg(progressCallback);\n\n    const results = this.polySeg.instance.convertLabelmapToSurface(\n      args.scalarData,\n      args.dimensions,\n      args.spacing,\n      args.direction,\n      args.origin,\n      [args.segmentIndex]\n    );\n    return results;\n  },\n  /**\n   * Converts a contour to a volume labelmap.\n   * @param {Object} args - The arguments for the conversion.\n   * @param {Array} args.segmentIndices - The indices of the segments.\n   * @param {Array} args.scalarData - The scalar data.\n   * @param {Map} args.annotationUIDsInSegmentMap - The map of annotation UIDs in segment.\n   * @param {Array} args.dimensions - The dimensions of the image data.\n   * @param {Array} args.origin - The origin of the image data.\n   * @param {Array} args.direction - The direction of the image data.\n   * @param {Array} args.spacing - The spacing of the image data.\n   * @param {...Function} callbacks - Optional callbacks.\n   * @param {Function} callbacks[0] - The progress callback.\n   * @returns {Array} - The scalar data of the segmentation voxel manager.\n   */\n  async convertContourToVolumeLabelmap(args, ...callbacks) {\n    const [progressCallback] = callbacks;\n    const polySeg = await new ICRPolySeg();\n    await polySeg.initialize({\n      updateProgress: progressCallback,\n    });\n\n    const {\n      segmentIndices,\n      scalarData,\n      annotationUIDsInSegmentMap,\n      dimensions,\n      origin,\n      direction,\n      spacing,\n    } = args;\n\n    const segmentationVoxelManager =\n      utilities.VoxelManager.createVolumeVoxelManager(dimensions, scalarData);\n\n    const imageData = vtkImageData.newInstance();\n    imageData.setDimensions(dimensions);\n    imageData.setOrigin(origin);\n    imageData.setDirection(direction);\n    imageData.setSpacing(spacing);\n\n    const scalarArray = vtkDataArray.newInstance({\n      name: 'Pixels',\n      numberOfComponents: 1,\n      values: scalarData,\n    });\n\n    imageData.getPointData().setScalars(scalarArray);\n\n    imageData.modified();\n\n    for (const index of segmentIndices) {\n      const annotations = annotationUIDsInSegmentMap.get(index);\n\n      for (const annotation of annotations) {\n        const bounds = getBoundingBoxAroundShapeWorld(\n          annotation.data.contour.polyline\n        );\n\n        const [iMin, jMin, kMin] = utilities.transformWorldToIndex(imageData, [\n          bounds[0][0],\n          bounds[1][0],\n          bounds[2][0],\n        ]);\n\n        const [iMax, jMax, kMax] = utilities.transformWorldToIndex(imageData, [\n          bounds[0][1],\n          bounds[1][1],\n          bounds[2][1],\n        ]);\n\n        // Run the pointInShapeCallback for the combined bounding box\n        pointInShapeCallback(\n          imageData,\n          (pointLPS) => {\n            // Check if the point is inside any of the polylines for this segment\n            return isPointInsidePolyline3D(\n              pointLPS,\n              annotation.data.contour.polyline\n            );\n          },\n          ({ pointIJK }) => {\n            segmentationVoxelManager.setAtIJKPoint(pointIJK, index);\n          },\n          [\n            [iMin, iMax],\n            [jMin, jMax],\n            [kMin, kMax],\n          ]\n        );\n      }\n    }\n\n    return segmentationVoxelManager.scalarData;\n  },\n  /**\n   * Converts a contour to a stack labelmap.\n   * @param {Object} args - The arguments for the conversion.\n   * @param {Array} callbacks - Optional callbacks for progress updates.\n   * @returns {Promise<Object>} - The converted segmentations information.\n   */\n  async convertContourToStackLabelmap(args, ...callbacks) {\n    const [progressCallback] = callbacks;\n    const polySeg = await new ICRPolySeg();\n    await polySeg.initialize({\n      updateProgress: progressCallback,\n    });\n\n    const { segmentationsInfo, annotationUIDsInSegmentMap, segmentIndices } =\n      args;\n\n    const segmentationVoxelManagers = new Map();\n\n    segmentationsInfo.forEach((segmentationInfo, referencedImageId) => {\n      const { dimensions, scalarData, direction, spacing, origin } =\n        segmentationInfo;\n      const manager = utilities.VoxelManager.createVolumeVoxelManager(\n        dimensions,\n        scalarData\n      );\n\n      const imageData = vtkImageData.newInstance();\n      imageData.setDimensions(dimensions);\n      imageData.setOrigin(origin);\n      imageData.setDirection(direction);\n      imageData.setSpacing(spacing);\n\n      const scalarArray = vtkDataArray.newInstance({\n        name: 'Pixels',\n        numberOfComponents: 1,\n        values: scalarData,\n      });\n\n      imageData.getPointData().setScalars(scalarArray);\n\n      imageData.modified();\n\n      segmentationVoxelManagers.set(referencedImageId, { manager, imageData });\n    });\n\n    for (const index of segmentIndices) {\n      const annotations = annotationUIDsInSegmentMap.get(index);\n\n      for (const annotation of annotations) {\n        if (!annotation?.data) {\n          continue;\n        }\n        const bounds = getBoundingBoxAroundShapeWorld(\n          annotation.data.contour.polyline\n        );\n\n        const { referencedImageId } = annotation.metadata;\n\n        const { manager: segmentationVoxelManager, imageData } =\n          segmentationVoxelManagers.get(referencedImageId);\n\n        const [iMin, jMin, kMin] = utilities.transformWorldToIndex(imageData, [\n          bounds[0][0],\n          bounds[1][0],\n          bounds[2][0],\n        ]);\n\n        const [iMax, jMax, kMax] = utilities.transformWorldToIndex(imageData, [\n          bounds[0][1],\n          bounds[1][1],\n          bounds[2][1],\n        ]);\n\n        // Run the pointInShapeCallback for the combined bounding box\n        pointInShapeCallback(\n          imageData,\n          (pointLPS) => {\n            // Check if the point is inside any of the polylines for this segment\n            return isPointInsidePolyline3D(\n              pointLPS,\n              annotation.data.contour.polyline\n            );\n          },\n          ({ pointIJK }) => {\n            segmentationVoxelManager.setAtIJKPoint(pointIJK, index);\n          },\n          [\n            [iMin, iMax],\n            [jMin, jMax],\n            [kMin, kMax],\n          ]\n        );\n      }\n    }\n\n    segmentationsInfo.forEach((segmentationInfo, referencedImageId) => {\n      const { manager: segmentationVoxelManager } =\n        segmentationVoxelManagers.get(referencedImageId);\n\n      segmentationInfo.scalarData = segmentationVoxelManager.scalarData;\n    });\n    return segmentationsInfo;\n  },\n  /**\n   * Converts a surface to a volume labelmap.\n   *\n   * @param {Object} args - The arguments for the conversion.\n   * @param {Array} args.points - The points defining the surface.\n   * @param {Array} args.polys - The polygons defining the surface.\n   * @param {Array} args.dimensions - The dimensions of the volume.\n   * @param {Array} args.spacing - The spacing between voxels in the volume.\n   * @param {Array} args.direction - The direction of the volume.\n   * @param {Array} args.origin - The origin of the volume.\n   * @param {Function} progressCallback - The callback function for reporting progress.\n   * @returns {Promise} - A promise that resolves with the converted labelmap.\n   */\n  async convertSurfaceToVolumeLabelmap(args, ...callbacks) {\n    const [progressCallback] = callbacks;\n    await this.initializePolySeg(progressCallback);\n\n    const results = this.polySeg.instance.convertSurfaceToLabelmap(\n      args.points,\n      args.polys,\n      args.dimensions,\n      args.spacing,\n      args.direction,\n      args.origin\n    );\n\n    return results;\n  },\n  /**\n   * Converts surfaces to a volume labelmap.\n   * @param {Object} args - The arguments for the conversion.\n   * @param {Map} args.segmentsInfo - A map containing information about the segments.\n   * @param {Function} progressCallback - A callback function for reporting progress.\n   * @returns {Uint8Array} - The resulting volume labelmap.\n   */\n  async convertSurfacesToVolumeLabelmap(args, ...callbacks) {\n    const [progressCallback] = callbacks;\n    await this.initializePolySeg(progressCallback);\n\n    const { segmentsInfo } = args;\n\n    const promises = Array.from(segmentsInfo.keys()).map((segmentIndex) => {\n      const { points, polys } = segmentsInfo.get(segmentIndex);\n      const result = this.polySeg.instance.convertSurfaceToLabelmap(\n        points,\n        polys,\n        args.dimensions,\n        args.spacing,\n        args.direction,\n        args.origin\n      );\n\n      return {\n        ...result,\n        segmentIndex,\n      };\n    });\n\n    const results = await Promise.all(promises);\n\n    const targetImageData = vtkImageData.newInstance();\n    targetImageData.setDimensions(args.dimensions);\n    targetImageData.setOrigin(args.origin);\n    targetImageData.setSpacing(args.spacing);\n    targetImageData.setDirection(args.direction);\n\n    const totalSize =\n      args.dimensions[0] * args.dimensions[1] * args.dimensions[2];\n\n    const scalarArray = vtkDataArray.newInstance({\n      name: 'Pixels',\n      numberOfComponents: 1,\n      values: new Uint8Array(totalSize),\n    });\n\n    targetImageData.getPointData().setScalars(scalarArray);\n    targetImageData.modified();\n\n    // we need to then consolidate the results into a single volume\n    // by looping into each voxel with pointInShapeCallback\n    // and check if the voxel is inside any of the reconstructed\n    // labelmaps\n\n    const segmentationVoxelManager =\n      utilities.VoxelManager.createVolumeVoxelManager(\n        args.dimensions,\n        targetImageData.getPointData().getScalars().getData()\n      );\n\n    const outputVolumesInfo = results.map((result) => {\n      const { data, dimensions, direction, origin, spacing } = result;\n      const volume = vtkImageData.newInstance();\n      volume.setDimensions(dimensions);\n      volume.setOrigin(origin);\n      volume.setSpacing(spacing);\n      volume.setDirection(direction);\n\n      const scalarArray = vtkDataArray.newInstance({\n        name: 'Pixels',\n        numberOfComponents: 1,\n        values: data,\n      });\n\n      volume.getPointData().setScalars(scalarArray);\n\n      volume.modified();\n\n      const voxelManager = utilities.VoxelManager.createVolumeVoxelManager(\n        dimensions,\n        data\n      );\n\n      const extent = volume.getExtent(); // e.g., [0, 176, 0, 268, 0, 337] for dimensions of [177, 269, 338]\n\n      return {\n        volume,\n        voxelManager,\n        extent,\n        scalarData: data,\n        segmentIndex: result.segmentIndex,\n      };\n    });\n\n    pointInShapeCallback(\n      targetImageData,\n      () => true, // we want to loop into all voxels\n      ({ pointIJK, pointLPS }) => {\n        // Check if the point is inside any of the reconstructed labelmaps\n        // Todo: we can optimize this by returning early if the bounding box\n        // of the point is outside the bounding box of the labelmap\n\n        try {\n          for (const volumeInfo of outputVolumesInfo) {\n            const { volume, extent, voxelManager, segmentIndex } = volumeInfo;\n\n            const index = volume.worldToIndex(pointLPS);\n\n            // check if the ijk point is inside the volume\n            if (\n              index[0] < extent[0] ||\n              index[0] > extent[1] ||\n              index[1] < extent[2] ||\n              index[1] > extent[3] ||\n              index[2] < extent[4] ||\n              index[2] > extent[5]\n            ) {\n              continue;\n            }\n\n            const roundedIndex = index.map(Math.round);\n            const value = voxelManager.getAtIJK(...roundedIndex);\n            if (value > 0) {\n              segmentationVoxelManager.setAtIJKPoint(pointIJK, segmentIndex);\n              break;\n            }\n          }\n        } catch (error) {\n          // right now there is weird error if the point is outside the volume\n        }\n      }\n    );\n\n    return segmentationVoxelManager.scalarData;\n  },\n};\n\nexpose(polySegConverters);\n","module.exports = __WEBPACK_EXTERNAL_MODULE__785__;","module.exports = __WEBPACK_EXTERNAL_MODULE__283__;","module.exports = __WEBPACK_EXTERNAL_MODULE__953__;","module.exports = __WEBPACK_EXTERNAL_MODULE__976__;","// The module cache\nvar __webpack_module_cache__ = {};\n\n// The require function\nfunction __webpack_require__(moduleId) {\n\t// Check if module is in cache\n\tvar cachedModule = __webpack_module_cache__[moduleId];\n\tif (cachedModule !== undefined) {\n\t\treturn cachedModule.exports;\n\t}\n\t// Create a new module (and put it into the cache)\n\tvar module = __webpack_module_cache__[moduleId] = {\n\t\t// no module.id needed\n\t\t// no module.loaded needed\n\t\texports: {}\n\t};\n\n\t// Execute the module function\n\t__webpack_modules__[moduleId](module, module.exports, __webpack_require__);\n\n\t// Return the exports of the module\n\treturn module.exports;\n}\n\n// expose the modules object (__webpack_modules__)\n__webpack_require__.m = __webpack_modules__;\n\n// the startup function\n__webpack_require__.x = () => {\n\t// Load entry module and return exports\n\t// This entry module depends on other loaded chunks and execution need to be delayed\n\tvar __webpack_exports__ = __webpack_require__.O(undefined, [78], () => (__webpack_require__(248)))\n\t__webpack_exports__ = __webpack_require__.O(__webpack_exports__);\n\treturn __webpack_exports__;\n};\n\n","// getDefaultExport function for compatibility with non-harmony modules\n__webpack_require__.n = (module) => {\n\tvar getter = module && module.__esModule ?\n\t\t() => (module['default']) :\n\t\t() => (module);\n\t__webpack_require__.d(getter, { a: getter });\n\treturn getter;\n};","// define getter functions for harmony exports\n__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n\t\t}\n\t}\n};","__webpack_require__.f = {};\n// This file contains only the entry chunk.\n// The chunk loading function for additional chunks\n__webpack_require__.e = (chunkId) => {\n\treturn Promise.all(Object.keys(__webpack_require__.f).reduce((promises, key) => {\n\t\t__webpack_require__.f[key](chunkId, promises);\n\t\treturn promises;\n\t}, []));\n};","// This function allow to reference async chunks and sibling chunks for the entrypoint\n__webpack_require__.u = (chunkId) => {\n\t// return url for filenames based on template\n\treturn \"\" + chunkId + \".index.js\";\n};","__webpack_require__.g = (function() {\n\tif (typeof globalThis === 'object') return globalThis;\n\ttry {\n\t\treturn this || new Function('return this')();\n\t} catch (e) {\n\t\tif (typeof window === 'object') return window;\n\t}\n})();","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","var scriptUrl;\nif (__webpack_require__.g.importScripts) scriptUrl = __webpack_require__.g.location + \"\";\nvar document = __webpack_require__.g.document;\nif (!scriptUrl && document) {\n\tif (document.currentScript)\n\t\tscriptUrl = document.currentScript.src;\n\tif (!scriptUrl) {\n\t\tvar scripts = document.getElementsByTagName(\"script\");\n\t\tif(scripts.length) {\n\t\t\tvar i = scripts.length - 1;\n\t\t\twhile (i > -1 && !scriptUrl) scriptUrl = scripts[i--].src;\n\t\t}\n\t}\n}\n// When supporting browsers where an automatic publicPath is not supported you must specify an output.publicPath manually via configuration\n// or pass an empty string (\"\") and set the __webpack_public_path__ variable from your code to use your own logic.\nif (!scriptUrl) throw new Error(\"Automatic publicPath is not supported in this browser\");\nscriptUrl = scriptUrl.replace(/#.*$/, \"\").replace(/\\?.*$/, \"\").replace(/\\/[^\\/]+$/, \"/\");\n__webpack_require__.p = scriptUrl;","// no baseURI\n\n// object to store loaded chunks\n// \"1\" means \"already loaded\"\nvar installedChunks = {\n\t985: 1\n};\n\n// importScripts chunk loading\nvar installChunk = (data) => {\n\tvar chunkIds = data[0];\n\tvar moreModules = data[1];\n\tvar runtime = data[2];\n\tfor(var moduleId in moreModules) {\n\t\tif(__webpack_require__.o(moreModules, moduleId)) {\n\t\t\t__webpack_require__.m[moduleId] = moreModules[moduleId];\n\t\t}\n\t}\n\tif(runtime) runtime(__webpack_require__);\n\twhile(chunkIds.length)\n\t\tinstalledChunks[chunkIds.pop()] = 1;\n\tparentChunkLoadingFunction(data);\n};\n__webpack_require__.f.i = (chunkId, promises) => {\n\t// \"1\" is the signal for \"already loaded\"\n\tif(!installedChunks[chunkId]) {\n\t\tif(true) { // all chunks have JS\n\t\t\timportScripts(__webpack_require__.p + __webpack_require__.u(chunkId));\n\t\t}\n\t}\n};\n\nvar chunkLoadingGlobal = self[\"webpackChunkcornerstoneTools3D\"] = self[\"webpackChunkcornerstoneTools3D\"] || [];\nvar parentChunkLoadingFunction = chunkLoadingGlobal.push.bind(chunkLoadingGlobal);\nchunkLoadingGlobal.push = installChunk;\n\n// no HMR\n\n// no HMR manifest","// run startup\nvar __webpack_exports__ = __webpack_require__.x();\n"],"names":["root","factory","exports","module","require","define","amd","self","__WEBPACK_EXTERNAL_MODULE__283__","__WEBPACK_EXTERNAL_MODULE__785__","__WEBPACK_EXTERNAL_MODULE__953__","__WEBPACK_EXTERNAL_MODULE__976__","deferred","next","EPSILON","CONSTANTS","getBoundingBoxAroundShapeWorld","points","clipBounds","dimensions","_points$","isWorld","arguments","length","undefined","xMin","Infinity","xMax","yMin","yMax","zMin","zMax","is3D","i","p","_p$","_p$2","Math","min","max","calculateBoundingBox","pointInShapeCallback","imageData","pointInShapeFn","callback","boundsIJK","iMin","iMax","jMin","jMax","kMin","kMax","scalarData","getScalarData","getPointData","getScalars","getData","getDimensions","start","vec3","direction","getDirection","rowCosines","slice","columnCosines","scanAxisNormal","spacing","getSpacing","rowSpacing","columnSpacing","scanAxisSpacing","worldPosStart","indexToWorld","rowStep","columnStep","scanAxisStep","xMultiple","yMultiple","zMultiple","pointsInShape","currentPos","k","startPosJ","j","startPosI","pointIJK","index","value","push","pointLPS","isPointInsidePolyline3D","point","polyline","sharedDimensionIndex","testPoints","every","array","Error","points2D","closed","numPolylinePoints","numIntersections","shouldClose","distFirstToLastPoints","p1","p2","x1","y1","z1","x2","y2","z2","dx","dy","dz","math","glMatrix","isClosed","maxSegmentIndex","maxX","maxY","minY","intersects","xIntersection","containsPoint","polySegConverters","polySeg","polySegInitializing","polySegInitializingPromise","initializePolySeg","progressCallback","_this$polySeg","this","instance","Promise","resolve","ICRPolySeg","initialize","updateProgress","then","convertContourToSurface","args","polylines","numPointsArray","_len","callbacks","Array","_key","convertContourRoiToSurface","convertLabelmapToSurface","_len2","_key2","origin","segmentIndex","convertContourToVolumeLabelmap","_len3","_key3","segmentIndices","annotationUIDsInSegmentMap","segmentationVoxelManager","utilities","vtkImageData","setDimensions","setOrigin","setDirection","setSpacing","scalarArray","vtkDataArray","name","numberOfComponents","values","setScalars","modified","annotations","get","annotation","bounds","data","contour","_ref","setAtIJKPoint","convertContourToStackLabelmap","_len4","_key4","segmentationsInfo","segmentationVoxelManagers","Map","forEach","segmentationInfo","referencedImageId","manager","set","metadata","_ref2","convertSurfaceToVolumeLabelmap","_len5","_key5","convertSurfaceToLabelmap","polys","convertSurfacesToVolumeLabelmap","_len6","_key6","segmentsInfo","promises","from","keys","map","results","all","targetImageData","totalSize","Uint8Array","outputVolumesInfo","result","volume","voxelManager","extent","getExtent","_ref3","volumeInfo","worldToIndex","roundedIndex","round","getAtIJK","error","expose","__webpack_module_cache__","__webpack_require__","moduleId","cachedModule","__webpack_modules__","m","x","__webpack_exports__","O","chunkIds","fn","priority","notFulfilled","fulfilled","Object","key","splice","r","n","getter","__esModule","d","a","definition","o","defineProperty","enumerable","f","e","chunkId","reduce","u","g","globalThis","Function","window","obj","prop","prototype","hasOwnProperty","call","scriptUrl","importScripts","location","document","currentScript","src","scripts","getElementsByTagName","replace","installedChunks","chunkLoadingGlobal","parentChunkLoadingFunction","bind","moreModules","runtime","pop"],"sourceRoot":""}
+{"version":3,"file":"985.index.js","mappings":"CAAA,SAA2CA,EAAMC,GAC1B,iBAAZC,SAA0C,iBAAXC,OACxCA,OAAOD,QAAUD,EAAQG,QAAQ,8CAA+CA,QAAQ,yCAA0CA,QAAQ,uBAAwBA,QAAQ,cACjJ,mBAAXC,QAAyBA,OAAOC,IAC9CD,OAAO,CAAC,6CAA8C,wCAAyC,sBAAuB,aAAcJ,GAC1G,iBAAZC,QACdA,QAA4B,mBAAID,EAAQG,QAAQ,8CAA+CA,QAAQ,yCAA0CA,QAAQ,uBAAwBA,QAAQ,cAEzLJ,EAAyB,mBAAIC,EAAQD,EAAK,8CAA+CA,EAAK,yCAA0CA,EAAoB,cAAGA,EAAa,OAC7K,CATD,CASGO,MAAM,CAACC,EAAkCC,EAAkCC,EAAkCC,I,uBCT5GC,ECAAC,E,oFCGJ,MAAM,QAAEC,GAAYC,EAAAA,UAqGb,SAASC,EACdC,EACAC,GAEA,OAlGF,SACED,EACAE,GAEa,IAAAC,EAAA,IADbC,EAAOC,UAAAC,OAAA,QAAAC,IAAAF,UAAA,IAAAA,UAAA,GAEHG,EAAOC,IACPC,EAAON,GAAU,IAAY,EAC7BO,EAAOF,IACPG,EAAOR,GAAU,IAAY,EAC7BS,EAAOJ,IACPK,EAAOV,GAAU,IAAY,EAEjC,MAAMW,EAA6B,KAAb,QAATZ,EAAAH,EAAO,UAAE,IAAAG,OAAA,EAATA,EAAWG,QAGxB,IAAK,IAAIU,EAAI,EAAGA,EAAIhB,EAAOM,OAAQU,IAAK,CACtC,MAAMC,EAAIjB,EAAOgB,GAMP,IAAAE,EAAAC,EALVX,EAAOY,KAAKC,IAAIJ,EAAE,GAAIT,GACtBE,EAAOU,KAAKE,IAAIL,EAAE,GAAIP,GACtBC,EAAOS,KAAKC,IAAIJ,EAAE,GAAIN,GACtBC,EAAOQ,KAAKE,IAAIL,EAAE,GAAIL,GAElBG,IACFF,EAAOO,KAAKC,IAAQ,QAALH,EAACD,EAAE,UAAE,IAAAC,EAAAA,EAAIL,EAAMA,GAC9BC,EAAOM,KAAKE,IAAQ,QAALH,EAACF,EAAE,UAAE,IAAAE,EAAAA,EAAIL,EAAMA,GAElC,CAkCA,OAhCIZ,GACFM,EAAOY,KAAKE,IAAIlB,EAAUF,EAAW,GAAKL,EAAU,EAAGW,GACvDE,EAAOU,KAAKC,IACVjB,EAAUF,EAAW,GAAKL,EAAUK,EAAW,GAAK,EACpDQ,GAEFC,EAAOS,KAAKE,IAAIlB,EAAUF,EAAW,GAAKL,EAAU,EAAGc,GACvDC,EAAOQ,KAAKC,IACVjB,EAAUF,EAAW,GAAKL,EAAUK,EAAW,GAAK,EACpDU,GAGEG,GAA8B,IAAtBb,EAAWI,SACrBO,EAAOO,KAAKE,IAAIlB,EAAUF,EAAW,GAAKL,EAAU,EAAGgB,GACvDC,EAAOM,KAAKC,IACVjB,EAAUF,EAAW,GAAKL,EAAUK,EAAW,GAAK,EACpDY,KAGMV,IAEVI,EAAOY,KAAKE,IAAI,EAAGd,GACnBE,EAAOU,KAAKC,IAAIZ,IAAUC,GAC1BC,EAAOS,KAAKE,IAAI,EAAGX,GACnBC,EAAOQ,KAAKC,IAAIZ,IAAUG,GAEtBG,IACFF,EAAOO,KAAKE,IAAI,EAAGT,GACnBC,EAAOM,KAAKC,IAAIZ,IAAUK,KAIvBC,EACH,CACE,CAACP,EAAME,GACP,CAACC,EAAMC,GACP,CAACC,EAAMC,IAET,CAAC,CAACN,EAAME,GAAO,CAACC,EAAMC,GAAO,KACnC,CA+BSW,CAAqBvB,EAAQC,GAAY,EAClD,C,aCrEe,SAASuB,EACtBC,EACAC,EACAC,EACAC,GAEA,IAAIC,EAAMC,EAAMC,EAAMC,EAAMC,EAAMC,EAE9BC,EACJ,MAAM,SAAEC,GAAaX,EAInBU,EADGV,EAAiCY,cACtBZ,EAAiCY,gBAEjCZ,EACXa,eACAC,aACAC,UAGL,MAAMtC,EAAauB,EAAUgB,gBAExBb,IAQDC,EAAMC,IAAQC,EAAMC,IAAQC,EAAMC,IAASN,GAP7CC,EAAO,EACPC,EAAO5B,EAAW,GAClB6B,EAAO,EACPC,EAAO9B,EAAW,GAClB+B,EAAO,EACPC,EAAOhC,EAAW,IAKpB,MAAMwC,EAAQC,EAAAA,KAAAA,WAAgBd,EAAME,EAAME,GAEpCW,EAAYnB,EAAUoB,eACtBC,EAAaF,EAAUG,MAAM,EAAG,GAChCC,EAAgBJ,EAAUG,MAAM,EAAG,GACnCE,EAAiBL,EAAUG,MAAM,EAAG,GAEpCG,EAAUzB,EAAU0B,cACnBC,EAAYC,EAAeC,GAAmBJ,EAG/CK,EAAgB9B,EAAU+B,aAAad,GAEvCe,EAAUd,EAAAA,KAAAA,WACdG,EAAW,GAAKM,EAChBN,EAAW,GAAKM,EAChBN,EAAW,GAAKM,GAGZM,EAAaf,EAAAA,KAAAA,WACjBK,EAAc,GAAKK,EACnBL,EAAc,GAAKK,EACnBL,EAAc,GAAKK,GAGfM,EAAehB,EAAAA,KAAAA,WACnBM,EAAe,GAAKK,EACpBL,EAAe,GAAKK,EACpBL,EAAe,GAAKK,GAGhBM,EACJxB,GACAD,EAAW7B,OAASJ,EAAW,GAAKA,EAAW,GAAKA,EAAW,GAC3D2D,EAAY3D,EAAW,GAAK0D,EAC5BE,EAAY5D,EAAW,GAAK2D,EAE5BE,EAAqC,GAErCC,EAAarB,EAAAA,KAAAA,MAAWY,GAE9B,IAAK,IAAIU,EAAIhC,EAAMgC,GAAK/B,EAAM+B,IAAK,CACjC,MAAMC,EAAYvB,EAAAA,KAAAA,MAAWqB,GAE7B,IAAK,IAAIG,EAAIpC,EAAMoC,GAAKnC,EAAMmC,IAAK,CACjC,MAAMC,EAAYzB,EAAAA,KAAAA,MAAWqB,GAE7B,IAAK,IAAIhD,EAAIa,EAAMb,GAAKc,EAAMd,IAAK,CACjC,MAAMqD,EAAyB,CAACrD,EAAGmD,EAAGF,GAGtC,GAAIvC,EAAesC,EAA4BK,GAAW,CACxD,MAAMC,EAAQL,EAAIH,EAAYK,EAAIN,EAAY7C,EAAI4C,EAClD,IAAIW,EAEFA,EADEX,EAAY,EACN,CACNzB,EAAWmC,GACXnC,EAAWmC,EAAQ,GACnBnC,EAAWmC,EAAQ,IAGbnC,EAAWmC,GAGrBP,EAAcS,KAAK,CAAED,QAAOD,QAAOD,WAAUI,SAAUT,IACnDrC,GACFA,EAAS,CAAE4C,QAAOD,QAAOD,WAAUI,SAAUT,GAEjD,CAGArB,EAAAA,KAAAA,IAASqB,EAAYA,EAAYP,EACnC,CAGAd,EAAAA,KAAAA,KAAUqB,EAAYI,GACtBzB,EAAAA,KAAAA,IAASqB,EAAYA,EAAYN,EACnC,CAGAf,EAAAA,KAAAA,KAAUqB,EAAYE,GACtBvB,EAAAA,KAAAA,IAASqB,EAAYA,EAAYL,EACnC,CAEA,OAAOI,CACT,CCjJO,SAASW,EACdC,EACAC,GAOA,IAAIC,EAEJ,MAAMC,EAAaF,EAAS7B,MAAM,EAAG,GACrC,IAAK,IAAI/B,EAAI,EAAGA,EAAI,EAAGA,IACrB,GAAI8D,EAAWC,OAAM,CAACJ,EAAOL,EAAOU,IAAUL,EAAM3D,KAAOgE,EAAM,GAAGhE,KAAK,CACvE6D,EAAuB7D,EACvB,KACF,CAGF,QAA6BT,IAAzBsE,EACF,MAAM,IAAII,MACR,6EAKJ,MAAMC,EAAW,GAEjB,IAAK,IAAIlE,EAAI,EAAGA,EAAI4D,EAAStE,OAAQU,IACnCkE,EAASV,KAAK,CACZI,EAAS5D,IAAI6D,EAAuB,GAAK,GACzCD,EAAS5D,IAAI6D,EAAuB,GAAK,KAS7C,OCtCa,SACbD,EACAD,EACAQ,GAEA,GAAIP,EAAStE,OAAS,EACpB,OAAO,EAGT,MAAM8E,EAAoBR,EAAStE,OACnC,IAAI+E,EAAmB,EAGvB,MAAMC,GCnBO,SAAkBV,GAC/B,GAAIA,EAAStE,OAAS,EACpB,OAAO,EAGT,MAAM8E,EAAoBR,EAAStE,OAI7BiF,ECRO,SAAgCC,EAAWC,GACxD,GAAID,EAAGlF,SAAWmF,EAAGnF,OACnB,MAAM2E,MAAM,mDAGd,MAAOS,EAAIC,EAAIC,EAAK,GAAKJ,GAClBK,EAAIC,EAAIC,EAAK,GAAKN,EACnBO,EAAKH,EAAKH,EACVO,EAAKH,EAAKH,EACVO,EAAKH,EAAKH,EAIhB,OAAOI,EAAKA,EAAKC,EAAKA,EAAKC,EAAKA,CAClC,CDNgCC,CAFXvB,EAAS,GACVA,EAASQ,EAAoB,IAM/C,OAAOgB,EAAAA,SAAAA,OAAgB,EAAGb,EAC5B,CDI+Cc,CAASzB,GAChD0B,EAAkB1B,EAAStE,QAAUgF,EAAc,EAAI,GAE7D,IAAK,IAAItE,EAAI,EAAGA,GAAKsF,EAAiBtF,IAAK,CACzC,MAAMwE,EAAKZ,EAAS5D,GAKdyE,EAAKb,EADK5D,IAAMoE,EAAoB,EAAI,EAAIpE,EAAI,GAIhDuF,EAAOf,EAAG,IAAMC,EAAG,GAAKD,EAAG,GAAKC,EAAG,GACnCe,EAAOhB,EAAG,IAAMC,EAAG,GAAKD,EAAG,GAAKC,EAAG,GACnCgB,EAAOjB,EAAG,IAAMC,EAAG,GAAKD,EAAG,GAAKC,EAAG,GAKzC,GAFEd,EAAM,IAAM4B,GAAQ5B,EAAM,IAAM8B,GAAQ9B,EAAM,GAAK6B,EAExB,CAE3B,IAAIE,EADmBlB,EAAG,KAAOC,EAAG,GAGpC,IAAKiB,EAAY,CACf,MAAMC,GACFhC,EAAM,GAAKa,EAAG,KAAOC,EAAG,GAAKD,EAAG,KAAQC,EAAG,GAAKD,EAAG,IAAMA,EAAG,GAEhEkB,EAAa/B,EAAM,IAAMgC,CAC3B,CAEAtB,GAAoBqB,EAAa,EAAI,CACvC,CACF,CAEA,SAAUrB,EAAmB,EAC/B,CDVSuB,CAAc1B,EALL,CACdP,GAAOE,EAAuB,GAAK,GACnCF,GAAOE,EAAuB,GAAK,IAIvC,CIpCA,MAAMgC,EAAoB,CAIxBC,QAAS,KAKTC,qBAAqB,EACrBC,2BAA4B,KAI5B,uBAAMC,CAAkBC,GAAkB,IAAAC,EACpCC,KAAKL,0BACDK,KAAKJ,2BAIG,QAAhBG,EAAIC,KAAKN,eAAO,IAAAK,GAAZA,EAAcE,WAIlBD,KAAKL,qBAAsB,EAC3BK,KAAKJ,2BAA6B,IAAIM,SAASC,IAC7CH,KAAKN,QAAU,IAAIU,EAAAA,EACnBJ,KAAKN,QACFW,WAAW,CACVC,eAAgBR,IAEjBS,MAAK,KACJP,KAAKL,qBAAsB,EAC3BQ,GAAS,GACT,UAGAH,KAAKJ,2BACb,EASA,6BAAMY,CAAwBC,GAC5B,MAAM,UAAEC,EAAS,eAAEC,GAAmBF,EAAK,QAAAG,EAAA3H,UAAAC,OADN2H,EAAS,IAAAC,MAAAF,EAAA,EAAAA,EAAA,KAAAG,EAAA,EAAAA,EAAAH,EAAAG,IAATF,EAASE,EAAA,GAAA9H,UAAA8H,GAE9C,MAAOjB,GAAoBe,EAO3B,aANMb,KAAKH,kBAAkBC,SACPE,KAAKN,QAAQO,SAASe,2BAC1CN,EACAC,EAIJ,EAaA,8BAAMM,CAAyBR,GAAoB,QAAAS,EAAAjI,UAAAC,OAAX2H,EAAS,IAAAC,MAAAI,EAAA,EAAAA,EAAA,KAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAATN,EAASM,EAAA,GAAAlI,UAAAkI,GAC/C,MAAOrB,GAAoBe,EAW3B,aAVMb,KAAKH,kBAAkBC,GAEbE,KAAKN,QAAQO,SAASgB,yBACpCR,EAAK1F,WACL0F,EAAK3H,WACL2H,EAAK3E,QACL2E,EAAKjF,UACLiF,EAAKW,OACL,CAACX,EAAKY,cAGV,EAeA,oCAAMC,CAA+Bb,GAAoB,QAAAc,EAAAtI,UAAAC,OAAX2H,EAAS,IAAAC,MAAAS,EAAA,EAAAA,EAAA,KAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAATX,EAASW,EAAA,GAAAvI,UAAAuI,GACrD,MAAO1B,GAAoBe,EACrBnB,QAAgB,IAAIU,EAAAA,QACpBV,EAAQW,WAAW,CACvBC,eAAgBR,IAGlB,MAAM,eACJ2B,EAAc,WACd1G,EAAU,2BACV2G,EAA0B,WAC1B5I,EAAU,OACVsI,EAAM,UACN5F,EAAS,QACTM,GACE2E,EAEEkB,EACJC,EAAAA,UAAAA,aAAAA,yBAAgD9I,EAAYiC,GAExDV,EAAYwH,IAAAA,cAClBxH,EAAUyH,cAAchJ,GACxBuB,EAAU0H,UAAUX,GACpB/G,EAAU2H,aAAaxG,GACvBnB,EAAU4H,WAAWnG,GAErB,MAAMoG,EAAcC,IAAAA,YAAyB,CAC3CC,KAAM,SACNC,mBAAoB,EACpBC,OAAQvH,IAGVV,EAAUa,eAAeqH,WAAWL,GAEpC7H,EAAUmI,WAEV,IAAK,MAAMtF,KAASuE,EAAgB,CAClC,MAAMgB,EAAcf,EAA2BgB,IAAIxF,GAEnD,IAAK,MAAMyF,KAAcF,EAAa,CACpC,MAAMG,EAASjK,EACbgK,EAAWE,KAAKC,QAAQtF,WAGnB/C,EAAME,EAAME,GAAQ+G,EAAAA,UAAAA,sBAAgCvH,EAAW,CACpEuI,EAAO,GAAG,GACVA,EAAO,GAAG,GACVA,EAAO,GAAG,MAGLlI,EAAME,EAAME,GAAQ8G,EAAAA,UAAAA,sBAAgCvH,EAAW,CACpEuI,EAAO,GAAG,GACVA,EAAO,GAAG,GACVA,EAAO,GAAG,KAIZxI,EACEC,GACCgD,GAEQC,EACLD,EACAsF,EAAWE,KAAKC,QAAQtF,YAG5BuF,IAAkB,IAAjB,SAAE9F,GAAU8F,EACXpB,EAAyBqB,cAAc/F,EAAUC,EAAM,GAEzD,CACE,CAACzC,EAAMC,GACP,CAACC,EAAMC,GACP,CAACC,EAAMC,IAGb,CACF,CAEA,OAAO6G,EAAyB5G,UAClC,EAOA,mCAAMkI,CAA8BxC,GAAoB,QAAAyC,EAAAjK,UAAAC,OAAX2H,EAAS,IAAAC,MAAAoC,EAAA,EAAAA,EAAA,KAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAATtC,EAASsC,EAAA,GAAAlK,UAAAkK,GACpD,MAAOrD,GAAoBe,EACrBnB,QAAgB,IAAIU,EAAAA,QACpBV,EAAQW,WAAW,CACvBC,eAAgBR,IAGlB,MAAM,kBAAEsD,EAAiB,2BAAE1B,EAA0B,eAAED,GACrDhB,EAEI4C,EAA4B,IAAIC,IAEtCF,EAAkBG,SAAQ,CAACC,EAAkBC,KAC3C,MAAM,WAAE3K,EAAU,WAAEiC,EAAU,UAAES,EAAS,QAAEM,EAAO,OAAEsF,GAClDoC,EACIE,EAAU9B,EAAAA,UAAAA,aAAAA,yBACd9I,EACAiC,GAGIV,EAAYwH,IAAAA,cAClBxH,EAAUyH,cAAchJ,GACxBuB,EAAU0H,UAAUX,GACpB/G,EAAU2H,aAAaxG,GACvBnB,EAAU4H,WAAWnG,GAErB,MAAMoG,EAAcC,IAAAA,YAAyB,CAC3CC,KAAM,SACNC,mBAAoB,EACpBC,OAAQvH,IAGVV,EAAUa,eAAeqH,WAAWL,GAEpC7H,EAAUmI,WAEVa,EAA0BM,IAAIF,EAAmB,CAAEC,UAASrJ,aAAY,IAG1E,IAAK,MAAM6C,KAASuE,EAAgB,CAClC,MAAMgB,EAAcf,EAA2BgB,IAAIxF,GAEnD,IAAK,MAAMyF,KAAcF,EAAa,CACpC,GAAKE,UAAAA,EAAYE,KACf,SAEF,MAAMD,EAASjK,EACbgK,EAAWE,KAAKC,QAAQtF,WAGpB,kBAAEiG,GAAsBd,EAAWiB,UAEjCF,QAAS/B,EAAwB,UAAEtH,GACzCgJ,EAA0BX,IAAIe,IAEzBhJ,EAAME,EAAME,GAAQ+G,EAAAA,UAAAA,sBAAgCvH,EAAW,CACpEuI,EAAO,GAAG,GACVA,EAAO,GAAG,GACVA,EAAO,GAAG,MAGLlI,EAAME,EAAME,GAAQ8G,EAAAA,UAAAA,sBAAgCvH,EAAW,CACpEuI,EAAO,GAAG,GACVA,EAAO,GAAG,GACVA,EAAO,GAAG,KAIZxI,EACEC,GACCgD,GAEQC,EACLD,EACAsF,EAAWE,KAAKC,QAAQtF,YAG5BqG,IAAkB,IAAjB,SAAE5G,GAAU4G,EACXlC,EAAyBqB,cAAc/F,EAAUC,EAAM,GAEzD,CACE,CAACzC,EAAMC,GACP,CAACC,EAAMC,GACP,CAACC,EAAMC,IAGb,CACF,CAQA,OANAsI,EAAkBG,SAAQ,CAACC,EAAkBC,KAC3C,MAAQC,QAAS/B,GACf0B,EAA0BX,IAAIe,GAEhCD,EAAiBzI,WAAa4G,EAAyB5G,UAAU,IAE5DqI,CACT,EAcA,oCAAMU,CAA+BrD,GAAoB,QAAAsD,EAAA9K,UAAAC,OAAX2H,EAAS,IAAAC,MAAAiD,EAAA,EAAAA,EAAA,KAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAATnD,EAASmD,EAAA,GAAA/K,UAAA+K,GACrD,MAAOlE,GAAoBe,EAY3B,aAXMb,KAAKH,kBAAkBC,GAEbE,KAAKN,QAAQO,SAASgE,yBACpCxD,EAAK7H,OACL6H,EAAKyD,MACLzD,EAAK3H,WACL2H,EAAK3E,QACL2E,EAAKjF,UACLiF,EAAKW,OAIT,EAQA,qCAAM+C,CAAgC1D,GAAoB,QAAA2D,EAAAnL,UAAAC,OAAX2H,EAAS,IAAAC,MAAAsD,EAAA,EAAAA,EAAA,KAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAATxD,EAASwD,EAAA,GAAApL,UAAAoL,GACtD,MAAOvE,GAAoBe,QACrBb,KAAKH,kBAAkBC,GAE7B,MAAM,aAAEwE,GAAiB7D,EAEnB8D,EAAWzD,MAAM0D,KAAKF,EAAaG,QAAQC,KAAKrD,IACpD,MAAM,OAAEzI,EAAM,MAAEsL,GAAUI,EAAa5B,IAAIrB,GAU3C,MAAO,IATQrB,KAAKN,QAAQO,SAASgE,yBACnCrL,EACAsL,EACAzD,EAAK3H,WACL2H,EAAK3E,QACL2E,EAAKjF,UACLiF,EAAKW,QAKLC,eACD,IAGGsD,QAAgBzE,QAAQ0E,IAAIL,GAE5BM,EAAkBhD,IAAAA,cACxBgD,EAAgB/C,cAAcrB,EAAK3H,YACnC+L,EAAgB9C,UAAUtB,EAAKW,QAC/ByD,EAAgB5C,WAAWxB,EAAK3E,SAChC+I,EAAgB7C,aAAavB,EAAKjF,WAElC,MAAMsJ,EACJrE,EAAK3H,WAAW,GAAK2H,EAAK3H,WAAW,GAAK2H,EAAK3H,WAAW,GAEtDoJ,EAAcC,IAAAA,YAAyB,CAC3CC,KAAM,SACNC,mBAAoB,EACpBC,OAAQ,IAAIyC,WAAWD,KAGzBD,EAAgB3J,eAAeqH,WAAWL,GAC1C2C,EAAgBrC,WAOhB,MAAMb,EACJC,EAAAA,UAAAA,aAAAA,yBACEnB,EAAK3H,WACL+L,EAAgB3J,eAAeC,aAAaC,WAG1C4J,EAAoBL,EAAQD,KAAKO,IACrC,MAAM,KAAEpC,EAAI,WAAE/J,EAAU,UAAE0C,EAAS,OAAE4F,EAAM,QAAEtF,GAAYmJ,EACnDC,EAASrD,IAAAA,cACfqD,EAAOpD,cAAchJ,GACrBoM,EAAOnD,UAAUX,GACjB8D,EAAOjD,WAAWnG,GAClBoJ,EAAOlD,aAAaxG,GAEpB,MAAM0G,EAAcC,IAAAA,YAAyB,CAC3CC,KAAM,SACNC,mBAAoB,EACpBC,OAAQO,IAGVqC,EAAOhK,eAAeqH,WAAWL,GAEjCgD,EAAO1C,WAEP,MAAM2C,EAAevD,EAAAA,UAAAA,aAAAA,yBACnB9I,EACA+J,GAGIuC,EAASF,EAAOG,YAEtB,MAAO,CACLH,SACAC,eACAC,SACArK,WAAY8H,EACZxB,aAAc4D,EAAO5D,aACtB,IA0CH,OAvCAjH,EACEyK,GACA,KAAM,IACNS,IAA4B,IAA3B,SAAErI,EAAQ,SAAEI,GAAUiI,EAKrB,IACE,IAAK,MAAMC,KAAcP,EAAmB,CAC1C,MAAM,OAAEE,EAAM,OAAEE,EAAM,aAAED,EAAY,aAAE9D,GAAiBkE,EAEjDrI,EAAQgI,EAAOM,aAAanI,GAGlC,GACEH,EAAM,GAAKkI,EAAO,IAClBlI,EAAM,GAAKkI,EAAO,IAClBlI,EAAM,GAAKkI,EAAO,IAClBlI,EAAM,GAAKkI,EAAO,IAClBlI,EAAM,GAAKkI,EAAO,IAClBlI,EAAM,GAAKkI,EAAO,GAElB,SAGF,MAAMK,EAAevI,EAAMwH,IAAI1K,KAAK0L,OAEpC,GADcP,EAAaQ,YAAYF,GAC3B,EAAG,CACb9D,EAAyBqB,cAAc/F,EAAUoE,GACjD,KACF,CACF,CACF,CAAE,MAAOuE,GACP,KAKCjE,EAAyB5G,UAClC,IAGF8K,EAAAA,EAAAA,IAAOpG,E,UCldP3H,EAAOD,QAAUO,C,UCAjBN,EAAOD,QAAUM,C,UCAjBL,EAAOD,QAAUQ,C,UCAjBP,EAAOD,QAAUS,C,GCCbwN,EAA2B,CAAC,EAGhC,SAASC,EAAoBC,GAE5B,IAAIC,EAAeH,EAAyBE,GAC5C,QAAqB7M,IAAjB8M,EACH,OAAOA,EAAapO,QAGrB,IAAIC,EAASgO,EAAyBE,GAAY,CAGjDnO,QAAS,CAAC,GAOX,OAHAqO,EAAoBF,GAAUlO,EAAQA,EAAOD,QAASkO,GAG/CjO,EAAOD,OACf,C,OAGAkO,EAAoBI,EAAID,EAGxBH,EAAoBK,EAAI,KAGvB,IAAIC,EAAsBN,EAAoBO,OAAEnN,EAAW,CAAC,KAAK,IAAO4M,EAAoB,OAE5F,OADsBA,EAAoBO,EAAED,EAClB,EbjCvB9N,EAAW,GACfwN,EAAoBO,EAAI,CAACrB,EAAQsB,EAAUC,EAAIC,KAC9C,IAAGF,EAAH,CAMA,IAAIG,EAAerN,IACnB,IAASO,EAAI,EAAGA,EAAIrB,EAASW,OAAQU,IAAK,CACrC2M,EAAWhO,EAASqB,GAAG,GACvB4M,EAAKjO,EAASqB,GAAG,GACjB6M,EAAWlO,EAASqB,GAAG,GAE3B,IAJA,IAGI+M,GAAY,EACP5J,EAAI,EAAGA,EAAIwJ,EAASrN,OAAQ6D,MACpB,EAAX0J,GAAsBC,GAAgBD,IAAaG,OAAOnC,KAAKsB,EAAoBO,GAAG3I,OAAOkJ,GAASd,EAAoBO,EAAEO,GAAKN,EAASxJ,MAC9IwJ,EAASO,OAAO/J,IAAK,IAErB4J,GAAY,EACTF,EAAWC,IAAcA,EAAeD,IAG7C,GAAGE,EAAW,CACbpO,EAASuO,OAAOlN,IAAK,GACrB,IAAImN,EAAIP,SACErN,IAAN4N,IAAiB9B,EAAS8B,EAC/B,CACD,CACA,OAAO9B,CArBP,CAJCwB,EAAWA,GAAY,EACvB,IAAI,IAAI7M,EAAIrB,EAASW,OAAQU,EAAI,GAAKrB,EAASqB,EAAI,GAAG,GAAK6M,EAAU7M,IAAKrB,EAASqB,GAAKrB,EAASqB,EAAI,GACrGrB,EAASqB,GAAK,CAAC2M,EAAUC,EAAIC,EAuBjB,Ec3BdV,EAAoBiB,EAAKlP,IACxB,IAAImP,EAASnP,GAAUA,EAAOoP,WAC7B,IAAOpP,EAAiB,QACxB,IAAM,EAEP,OADAiO,EAAoBoB,EAAEF,EAAQ,CAAEG,EAAGH,IAC5BA,CAAM,ECLdlB,EAAoBoB,EAAI,CAACtP,EAASwP,KACjC,IAAI,IAAIR,KAAOQ,EACXtB,EAAoBuB,EAAED,EAAYR,KAASd,EAAoBuB,EAAEzP,EAASgP,IAC5ED,OAAOW,eAAe1P,EAASgP,EAAK,CAAEW,YAAY,EAAM9E,IAAK2E,EAAWR,IAE1E,ECNDd,EAAoB0B,EAAI,CAAC,EAGzB1B,EAAoB2B,EAAKC,GACjBzH,QAAQ0E,IAAIgC,OAAOnC,KAAKsB,EAAoB0B,GAAGG,QAAO,CAACrD,EAAUsC,KACvEd,EAAoB0B,EAAEZ,GAAKc,EAASpD,GAC7BA,IACL,KCNJwB,EAAoB8B,EAAKF,GAEZA,EAAU,YCHvB5B,EAAoB+B,EAAI,WACvB,GAA0B,iBAAfC,WAAyB,OAAOA,WAC3C,IACC,OAAO/H,MAAQ,IAAIgI,SAAS,cAAb,EAChB,CAAE,MAAON,GACR,GAAsB,iBAAXO,OAAqB,OAAOA,MACxC,CACA,CAPuB,GCAxBlC,EAAoBuB,EAAI,CAACY,EAAKC,IAAUvB,OAAOwB,UAAUC,eAAeC,KAAKJ,EAAKC,G,MCAlF,IAAII,EACAxC,EAAoB+B,EAAEU,gBAAeD,EAAYxC,EAAoB+B,EAAEW,SAAW,IACtF,IAAIC,EAAW3C,EAAoB+B,EAAEY,SACrC,IAAKH,GAAaG,IACbA,EAASC,gBACZJ,EAAYG,EAASC,cAAcC,MAC/BL,GAAW,CACf,IAAIM,EAAUH,EAASI,qBAAqB,UAC5C,GAAGD,EAAQ3P,OAEV,IADA,IAAIU,EAAIiP,EAAQ3P,OAAS,EAClBU,GAAK,IAAM2O,GAAWA,EAAYM,EAAQjP,KAAKgP,GAExD,CAID,IAAKL,EAAW,MAAM,IAAI1K,MAAM,yDAChC0K,EAAYA,EAAUQ,QAAQ,OAAQ,IAAIA,QAAQ,QAAS,IAAIA,QAAQ,YAAa,KACpFhD,EAAoBlM,EAAI0O,C,WCdxB,IAAIS,EAAkB,CACrB,IAAK,GAkBNjD,EAAoB0B,EAAE7N,EAAI,CAAC+N,EAASpD,KAE/ByE,EAAgBrB,IAElBa,cAAczC,EAAoBlM,EAAIkM,EAAoB8B,EAAEF,GAE9D,EAGD,IAAIsB,EAAqB/Q,KAAqC,+BAAIA,KAAqC,gCAAK,GACxGgR,EAA6BD,EAAmB7L,KAAK+L,KAAKF,GAC9DA,EAAmB7L,KAzBCyF,IACnB,IAAI0D,EAAW1D,EAAK,GAChBuG,EAAcvG,EAAK,GACnBwG,EAAUxG,EAAK,GACnB,IAAI,IAAImD,KAAYoD,EAChBrD,EAAoBuB,EAAE8B,EAAapD,KACrCD,EAAoBI,EAAEH,GAAYoD,EAAYpD,IAIhD,IADGqD,GAASA,EAAQtD,GACdQ,EAASrN,QACd8P,EAAgBzC,EAAS+C,OAAS,EACnCJ,EAA2BrG,EAAK,C,KpBrB7BrK,EAAOuN,EAAoBK,EAC/BL,EAAoBK,EAAI,IAChBL,EAAoB2B,EAAE,IAAInH,KAAK/H,GqBDbuN,EAAoBK,G","sources":["webpack://cornerstoneTools3D/webpack/universalModuleDefinition","webpack://cornerstoneTools3D/webpack/runtime/chunk loaded","webpack://cornerstoneTools3D/webpack/runtime/startup chunk dependencies","webpack://cornerstoneTools3D/./src/utilities/boundingBox/getBoundingBoxAroundShape.ts","webpack://cornerstoneTools3D/./src/utilities/pointInShapeCallback.ts","webpack://cornerstoneTools3D/./src/utilities/math/polyline/isPointInsidePolyline3D.ts","webpack://cornerstoneTools3D/./src/utilities/math/polyline/containsPoint.ts","webpack://cornerstoneTools3D/./src/utilities/math/polyline/isClosed.ts","webpack://cornerstoneTools3D/./src/utilities/math/point/distanceToPointSquared.ts","webpack://cornerstoneTools3D/./src/workers/polySegConverters.js","webpack://cornerstoneTools3D/external umd \"@kitware/vtk.js/Common/Core/DataArray\"","webpack://cornerstoneTools3D/external umd \"@kitware/vtk.js/Common/DataModel/ImageData\"","webpack://cornerstoneTools3D/external umd {\"root\":\"cornerstone3D\",\"commonjs\":\"@cornerstonejs/core\",\"commonjs2\":\"@cornerstonejs/core\",\"amd\":\"@cornerstonejs/core\"}","webpack://cornerstoneTools3D/external umd {\"root\":\"window\",\"commonjs\":\"gl-matrix\",\"commonjs2\":\"gl-matrix\",\"amd\":\"gl-matrix\"}","webpack://cornerstoneTools3D/webpack/bootstrap","webpack://cornerstoneTools3D/webpack/runtime/compat get default export","webpack://cornerstoneTools3D/webpack/runtime/define property getters","webpack://cornerstoneTools3D/webpack/runtime/ensure chunk","webpack://cornerstoneTools3D/webpack/runtime/get javascript chunk filename","webpack://cornerstoneTools3D/webpack/runtime/global","webpack://cornerstoneTools3D/webpack/runtime/hasOwnProperty shorthand","webpack://cornerstoneTools3D/webpack/runtime/publicPath","webpack://cornerstoneTools3D/webpack/runtime/importScripts chunk loading","webpack://cornerstoneTools3D/webpack/startup"],"sourcesContent":["(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory(require(\"@kitware/vtk.js/Common/DataModel/ImageData\"), require(\"@kitware/vtk.js/Common/Core/DataArray\"), require(\"@cornerstonejs/core\"), require(\"gl-matrix\"));\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([\"@kitware/vtk.js/Common/DataModel/ImageData\", \"@kitware/vtk.js/Common/Core/DataArray\", \"@cornerstonejs/core\", \"gl-matrix\"], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"cornerstoneTools3D\"] = factory(require(\"@kitware/vtk.js/Common/DataModel/ImageData\"), require(\"@kitware/vtk.js/Common/Core/DataArray\"), require(\"@cornerstonejs/core\"), require(\"gl-matrix\"));\n\telse\n\t\troot[\"cornerstoneTools3D\"] = factory(root[\"@kitware/vtk.js/Common/DataModel/ImageData\"], root[\"@kitware/vtk.js/Common/Core/DataArray\"], root[\"cornerstone3D\"], root[\"window\"]);\n})(self, (__WEBPACK_EXTERNAL_MODULE__283__, __WEBPACK_EXTERNAL_MODULE__785__, __WEBPACK_EXTERNAL_MODULE__953__, __WEBPACK_EXTERNAL_MODULE__976__) => {\nreturn ","var deferred = [];\n__webpack_require__.O = (result, chunkIds, fn, priority) => {\n\tif(chunkIds) {\n\t\tpriority = priority || 0;\n\t\tfor(var i = deferred.length; i > 0 && deferred[i - 1][2] > priority; i--) deferred[i] = deferred[i - 1];\n\t\tdeferred[i] = [chunkIds, fn, priority];\n\t\treturn;\n\t}\n\tvar notFulfilled = Infinity;\n\tfor (var i = 0; i < deferred.length; i++) {\n\t\tvar chunkIds = deferred[i][0];\n\t\tvar fn = deferred[i][1];\n\t\tvar priority = deferred[i][2];\n\t\tvar fulfilled = true;\n\t\tfor (var j = 0; j < chunkIds.length; j++) {\n\t\t\tif ((priority & 1 === 0 || notFulfilled >= priority) && Object.keys(__webpack_require__.O).every((key) => (__webpack_require__.O[key](chunkIds[j])))) {\n\t\t\t\tchunkIds.splice(j--, 1);\n\t\t\t} else {\n\t\t\t\tfulfilled = false;\n\t\t\t\tif(priority < notFulfilled) notFulfilled = priority;\n\t\t\t}\n\t\t}\n\t\tif(fulfilled) {\n\t\t\tdeferred.splice(i--, 1)\n\t\t\tvar r = fn();\n\t\t\tif (r !== undefined) result = r;\n\t\t}\n\t}\n\treturn result;\n};","var next = __webpack_require__.x;\n__webpack_require__.x = () => {\n\treturn __webpack_require__.e(78).then(next);\n};","import type { Types } from '@cornerstonejs/core';\nimport { CONSTANTS } from '@cornerstonejs/core';\n\nconst { EPSILON } = CONSTANTS;\n\n/** Bounding box type */\ntype BoundingBox =\n  | [Types.Point2, Types.Point2, null]\n  | [Types.Point2, Types.Point2, Types.Point2];\n\nfunction calculateBoundingBox(\n  points,\n  dimensions,\n  isWorld = false\n): BoundingBox {\n  let xMin = Infinity;\n  let xMax = isWorld ? -Infinity : 0;\n  let yMin = Infinity;\n  let yMax = isWorld ? -Infinity : 0;\n  let zMin = Infinity;\n  let zMax = isWorld ? -Infinity : 0;\n\n  const is3D = points[0]?.length === 3;\n\n  // use for loop for performance\n  for (let i = 0; i < points.length; i++) {\n    const p = points[i];\n    xMin = Math.min(p[0], xMin);\n    xMax = Math.max(p[0], xMax);\n    yMin = Math.min(p[1], yMin);\n    yMax = Math.max(p[1], yMax);\n\n    if (is3D) {\n      zMin = Math.min(p[2] ?? zMin, zMin);\n      zMax = Math.max(p[2] ?? zMax, zMax);\n    }\n  }\n\n  if (dimensions) {\n    xMin = Math.max(isWorld ? dimensions[0] + EPSILON : 0, xMin);\n    xMax = Math.min(\n      isWorld ? dimensions[0] - EPSILON : dimensions[0] - 1,\n      xMax\n    );\n    yMin = Math.max(isWorld ? dimensions[1] + EPSILON : 0, yMin);\n    yMax = Math.min(\n      isWorld ? dimensions[1] - EPSILON : dimensions[1] - 1,\n      yMax\n    );\n\n    if (is3D && dimensions.length === 3) {\n      zMin = Math.max(isWorld ? dimensions[2] + EPSILON : 0, zMin);\n      zMax = Math.min(\n        isWorld ? dimensions[2] - EPSILON : dimensions[2] - 1,\n        zMax\n      );\n    }\n  } else if (!isWorld) {\n    // still need to bound to 0 and Infinity if no dimensions are provided for ijk\n    xMin = Math.max(0, xMin);\n    xMax = Math.min(Infinity, xMax);\n    yMin = Math.max(0, yMin);\n    yMax = Math.min(Infinity, yMax);\n\n    if (is3D) {\n      zMin = Math.max(0, zMin);\n      zMax = Math.min(Infinity, zMax);\n    }\n  }\n\n  return is3D\n    ? [\n        [xMin, xMax],\n        [yMin, yMax],\n        [zMin, zMax],\n      ]\n    : [[xMin, xMax], [yMin, yMax], null];\n}\n\n/**\n * With a given vertices (points) coordinates in 2D or 3D in IJK, it calculates the minimum and maximum\n * coordinate in each axis, and returns them. If clipBounds are provided it also\n * clip the min, max to the provided width, height and depth\n *\n * @param points - shape corner points coordinates either in IJK (image coordinate)\n * @param dimensions - bounds to clip the min, max\n * @returns [[xMin,xMax],[yMin,yMax], [zMin,zMax]]\n */\nexport function getBoundingBoxAroundShapeIJK(\n  points: Types.Point2[] | Types.Point3[],\n  dimensions?: Types.Point2 | Types.Point3\n): BoundingBox {\n  return calculateBoundingBox(points, dimensions, false);\n}\n\n/**\n * With a given vertices (points) coordinates in 2D or 3D in World Coordinates, it calculates the minimum and maximum\n * coordinate in each axis, and returns them. If clipBounds are provided it also\n * clip the min, max to the provided width, height and depth\n *\n * @param points - shape corner points coordinates either in IJK (image coordinate)\n * @param clipBounds - bounds to clip the min, max\n * @returns [[xMin,xMax],[yMin,yMax], [zMin,zMax]]\n */\nexport function getBoundingBoxAroundShapeWorld(\n  points: Types.Point2[] | Types.Point3[],\n  clipBounds?: Types.Point2 | Types.Point3\n): BoundingBox {\n  return calculateBoundingBox(points, clipBounds, true);\n}\n","import { vec3 } from 'gl-matrix';\nimport type { Types } from '@cornerstonejs/core';\nimport type { vtkImageData } from '@kitware/vtk.js/Common/DataModel/ImageData';\nimport BoundsIJK from '../types/BoundsIJK';\n\nexport type PointInShape = {\n  value: number;\n  index: number;\n  pointIJK: vec3;\n  pointLPS: vec3;\n};\n\nexport type PointInShapeCallback = ({\n  value,\n  index,\n  pointIJK,\n  pointLPS,\n}: {\n  value: number;\n  index: number;\n  pointIJK: vec3;\n  pointLPS: vec3;\n}) => void;\n\nexport type ShapeFnCriteria = (pointLPS: vec3, pointIJK: vec3) => boolean;\n\n/**\n * For each point in the image (If boundsIJK is not provided, otherwise, for each\n * point in the provided bounding box), It runs the provided callback IF the point\n * passes the provided criteria to be inside the shape (which is defined by the\n * provided pointInShapeFn)\n *\n * @param imageData - The image data object.\n * @param dimensions - The dimensions of the image.\n * @param pointInShapeFn - A function that takes a point in LPS space and returns\n * true if the point is in the shape and false if it is not.\n * @param callback - A function that will be called for\n * every point in the shape.\n * @param boundsIJK - The bounds of the volume in IJK coordinates.\n */\nexport default function pointInShapeCallback(\n  imageData: vtkImageData | Types.CPUImageData,\n  pointInShapeFn: ShapeFnCriteria,\n  callback?: PointInShapeCallback,\n  boundsIJK?: BoundsIJK\n): Array<PointInShape> {\n  let iMin, iMax, jMin, jMax, kMin, kMax;\n\n  let scalarData;\n  const { numComps } = imageData as any;\n\n  // if getScalarData is a method on imageData\n  if ((imageData as Types.CPUImageData).getScalarData) {\n    scalarData = (imageData as Types.CPUImageData).getScalarData();\n  } else {\n    scalarData = (imageData as vtkImageData)\n      .getPointData()\n      .getScalars()\n      .getData();\n  }\n\n  const dimensions = imageData.getDimensions();\n\n  if (!boundsIJK) {\n    iMin = 0;\n    iMax = dimensions[0];\n    jMin = 0;\n    jMax = dimensions[1];\n    kMin = 0;\n    kMax = dimensions[2];\n  } else {\n    [[iMin, iMax], [jMin, jMax], [kMin, kMax]] = boundsIJK;\n  }\n\n  const start = vec3.fromValues(iMin, jMin, kMin);\n\n  const direction = imageData.getDirection();\n  const rowCosines = direction.slice(0, 3);\n  const columnCosines = direction.slice(3, 6);\n  const scanAxisNormal = direction.slice(6, 9);\n\n  const spacing = imageData.getSpacing();\n  const [rowSpacing, columnSpacing, scanAxisSpacing] = spacing;\n\n  // @ts-ignore will be fixed in vtk-master\n  const worldPosStart = imageData.indexToWorld(start);\n\n  const rowStep = vec3.fromValues(\n    rowCosines[0] * rowSpacing,\n    rowCosines[1] * rowSpacing,\n    rowCosines[2] * rowSpacing\n  );\n\n  const columnStep = vec3.fromValues(\n    columnCosines[0] * columnSpacing,\n    columnCosines[1] * columnSpacing,\n    columnCosines[2] * columnSpacing\n  );\n\n  const scanAxisStep = vec3.fromValues(\n    scanAxisNormal[0] * scanAxisSpacing,\n    scanAxisNormal[1] * scanAxisSpacing,\n    scanAxisNormal[2] * scanAxisSpacing\n  );\n\n  const xMultiple =\n    numComps ||\n    scalarData.length / dimensions[2] / dimensions[1] / dimensions[0];\n  const yMultiple = dimensions[0] * xMultiple;\n  const zMultiple = dimensions[1] * yMultiple;\n\n  const pointsInShape: Array<PointInShape> = [];\n\n  const currentPos = vec3.clone(worldPosStart);\n\n  for (let k = kMin; k <= kMax; k++) {\n    const startPosJ = vec3.clone(currentPos);\n\n    for (let j = jMin; j <= jMax; j++) {\n      const startPosI = vec3.clone(currentPos);\n\n      for (let i = iMin; i <= iMax; i++) {\n        const pointIJK: Types.Point3 = [i, j, k];\n\n        // The current world position (pointLPS) is now in currentPos\n        if (pointInShapeFn(currentPos as Types.Point3, pointIJK)) {\n          const index = k * zMultiple + j * yMultiple + i * xMultiple;\n          let value;\n          if (xMultiple > 2) {\n            value = [\n              scalarData[index],\n              scalarData[index + 1],\n              scalarData[index + 2],\n            ];\n          } else {\n            value = scalarData[index];\n          }\n\n          pointsInShape.push({ value, index, pointIJK, pointLPS: currentPos });\n          if (callback) {\n            callback({ value, index, pointIJK, pointLPS: currentPos });\n          }\n        }\n\n        // Increment currentPos by rowStep for the next iteration\n        vec3.add(currentPos, currentPos, rowStep);\n      }\n\n      // Reset currentPos to the start of the next J line and increment by columnStep\n      vec3.copy(currentPos, startPosI);\n      vec3.add(currentPos, currentPos, columnStep);\n    }\n\n    // Reset currentPos to the start of the next K slice and increment by scanAxisStep\n    vec3.copy(currentPos, startPosJ);\n    vec3.add(currentPos, currentPos, scanAxisStep);\n  }\n\n  return pointsInShape;\n}\n","import type { Types } from '@cornerstonejs/core';\nimport containsPoint from './containsPoint';\n\n/**\n * Determines whether a 3D point is inside a polyline in 3D space.\n *\n * The algorithm works by reducing the polyline and point to 2D space, and then\n * using the 2D algorithm to determine whether the point is inside the polyline.\n *\n * @param point - The 3D point to test.\n * @param polyline - The polyline represented as an array of 3D points.\n * @returns A boolean indicating whether the point is inside the polyline.\n * @throws An error if a shared dimension index cannot be found for the polyline points.\n */\nexport function isPointInsidePolyline3D(\n  point: Types.Point3,\n  polyline: Types.Point3[]\n) {\n  // Todo: handle oblique planes\n\n  // We need to reduce one dimension to 2D, so basically\n  // we need to find the dimension index that is shared by all points\n  // Use the first three points, two is enough but three is more robust\n  let sharedDimensionIndex;\n\n  const testPoints = polyline.slice(0, 3);\n  for (let i = 0; i < 3; i++) {\n    if (testPoints.every((point, index, array) => point[i] === array[0][i])) {\n      sharedDimensionIndex = i;\n      break;\n    }\n  }\n\n  if (sharedDimensionIndex === undefined) {\n    throw new Error(\n      'Cannot find a shared dimension index for polyline, probably oblique plane'\n    );\n  }\n\n  // convert polyline list and point to 2D\n  const points2D = [] as Types.Point2[];\n\n  for (let i = 0; i < polyline.length; i++) {\n    points2D.push([\n      polyline[i][(sharedDimensionIndex + 1) % 3],\n      polyline[i][(sharedDimensionIndex + 2) % 3],\n    ]);\n  }\n\n  const point2D = [\n    point[(sharedDimensionIndex + 1) % 3],\n    point[(sharedDimensionIndex + 2) % 3],\n  ] as Types.Point2;\n\n  return containsPoint(points2D, point2D);\n}\n","import type { Types } from '@cornerstonejs/core';\nimport isClosed from './isClosed';\n\n/**\n * Checks if a 2D point is inside the polyline.\n *\n * A point is inside a curve/polygon if the number of intersections between the horizontal\n * ray emanating from the given point and to the right and the line segments is odd.\n * https://www.eecs.umich.edu/courses/eecs380/HANDOUTS/PROJ2/InsidePoly.html\n *\n * Note that a point on the polyline is considered inside.\n *\n * @param polyline - Polyline points (2D)\n * @param point - 2D Point\n * @returns True if the point is inside the polyline or false otherwise\n */\nexport default function containsPoint(\n  polyline: Types.Point2[],\n  point: Types.Point2,\n  closed?: boolean\n): boolean {\n  if (polyline.length < 3) {\n    return false;\n  }\n\n  const numPolylinePoints = polyline.length;\n  let numIntersections = 0;\n\n  // Test intersection against [end, start] line segment if it should be closed\n  const shouldClose = !(closed === undefined ? isClosed(polyline) : closed);\n  const maxSegmentIndex = polyline.length - (shouldClose ? 1 : 2);\n\n  for (let i = 0; i <= maxSegmentIndex; i++) {\n    const p1 = polyline[i];\n\n    // Calculating the next point index without using % (mod) operator like in\n    // `(i + 1) % numPolylinePoints` to make it 20% faster\n    const p2Index = i === numPolylinePoints - 1 ? 0 : i + 1;\n    const p2 = polyline[p2Index];\n\n    // Calculating min/max without using Math.min/max to make it ~3% faster\n    const maxX = p1[0] >= p2[0] ? p1[0] : p2[0];\n    const maxY = p1[1] >= p2[1] ? p1[1] : p2[1];\n    const minY = p1[1] <= p2[1] ? p1[1] : p2[1];\n\n    const mayIntersectLineSegment =\n      point[0] <= maxX && point[1] >= minY && point[1] < maxY;\n\n    if (mayIntersectLineSegment) {\n      const isVerticalLine = p1[0] === p2[0];\n      let intersects = isVerticalLine;\n\n      if (!intersects) {\n        const xIntersection =\n          ((point[1] - p1[1]) * (p2[0] - p1[0])) / (p2[1] - p1[1]) + p1[0];\n\n        intersects = point[0] <= xIntersection;\n      }\n\n      numIntersections += intersects ? 1 : 0;\n    }\n  }\n\n  return !!(numIntersections % 2);\n}\n","import { glMatrix } from 'gl-matrix';\nimport type { Types } from '@cornerstonejs/core';\nimport * as math from '..';\n\n/**\n * A polyline is considered closed if the start and end points are at the same position\n *\n * @param polyline - Polyline points (2D)\n * @returns True if the polyline is already closed or false otherwise\n */\nexport default function isClosed(polyline: Types.Point2[]): boolean {\n  if (polyline.length < 3) {\n    return false;\n  }\n\n  const numPolylinePoints = polyline.length;\n\n  const firstPoint = polyline[0];\n  const lastPoint = polyline[numPolylinePoints - 1];\n  const distFirstToLastPoints = math.point.distanceToPointSquared(\n    firstPoint,\n    lastPoint\n  );\n\n  return glMatrix.equals(0, distFirstToLastPoints);\n}\n","import type { Types } from '@cornerstonejs/core';\n\ntype Point = Types.Point2 | Types.Point3;\n\n/**\n * Calculates the distance squared of a point to another point\n *\n * @param p1 - x,y or x,y,z of the point\n * @param p2 - x,y or x,y,z of the point\n * @returns distance\n */\nexport default function distanceToPointSquared(p1: Point, p2: Point): number {\n  if (p1.length !== p2.length) {\n    throw Error('Both points should have the same dimensionality');\n  }\n\n  const [x1, y1, z1 = 0] = p1;\n  const [x2, y2, z2 = 0] = p2;\n  const dx = x2 - x1;\n  const dy = y2 - y1;\n  const dz = z2 - z1;\n\n  // Time to square 10M numbers:\n  //   (n * n) = 161ms | (n ** 2) = 199ms | Math.pow(n, 2) = 29529ms\n  return dx * dx + dy * dy + dz * dz;\n}\n","import { expose } from 'comlink';\nimport vtkImageData from '@kitware/vtk.js/Common/DataModel/ImageData';\nimport vtkDataArray from '@kitware/vtk.js/Common/Core/DataArray';\nimport ICRPolySeg from '@icr/polyseg-wasm';\nimport { utilities } from '@cornerstonejs/core';\nimport { getBoundingBoxAroundShapeWorld } from '../utilities/boundingBox';\nimport { pointInShapeCallback } from '../utilities';\nimport { isPointInsidePolyline3D } from '../utilities/math/polyline';\n\n/**\n * Object containing methods for converting between different representations of\n * segmentations (e.g., contour, labelmap, surface, etc.) These logics\n * are used in a webworker to avoid blocking the main thread. You can\n * search for workerManager.executeTask('polySeg', ...) to see\n * how these methods are used.\n *\n * See also the webworker docs at packages/docs/docs/concepts/cornerstone-core/web-worker.md\n * to learn more about how to use webworkers in the context of Cornerstone.\n */\nconst polySegConverters = {\n  /**\n   * The polySeg instance that is used to convert between different representations\n   */\n  polySeg: null,\n  /**\n   * Utilities to keep track of the initialization state of the polySeg instance\n   * and avoid initializing it multiple times\n   */\n  polySegInitializing: false,\n  polySegInitializingPromise: null,\n  /**\n   * This method initializes the polySeg instance and sets it to this.polySeg\n   */\n  async initializePolySeg(progressCallback) {\n    if (this.polySegInitializing) {\n      await this.polySegInitializingPromise;\n      return;\n    }\n\n    if (this.polySeg?.instance) {\n      return;\n    }\n\n    this.polySegInitializing = true;\n    this.polySegInitializingPromise = new Promise((resolve) => {\n      this.polySeg = new ICRPolySeg();\n      this.polySeg\n        .initialize({\n          updateProgress: progressCallback,\n        })\n        .then(() => {\n          this.polySegInitializing = false;\n          resolve();\n        });\n    });\n\n    await this.polySegInitializingPromise;\n  },\n  /**\n   * Converts a contour to a surface using the PolySeg library.\n   * @param {Object} args - The arguments for the conversion.\n   * @param {Array} args.polylines - The polylines representing the contour.\n   * @param {Array} args.numPointsArray - The number of points in each polyline.\n   * @param {...Function} callbacks - Optional callback functions.\n   * @returns {Promise} - A promise that resolves to the converted surface.\n   */\n  async convertContourToSurface(args, ...callbacks) {\n    const { polylines, numPointsArray } = args;\n    const [progressCallback] = callbacks;\n    await this.initializePolySeg(progressCallback);\n    const results = await this.polySeg.instance.convertContourRoiToSurface(\n      polylines,\n      numPointsArray\n    );\n\n    return results;\n  },\n  /**\n   * Converts a labelmap to a surface using the specified arguments.\n   * @param {Object} args - The arguments for the conversion.\n   * @param {Array} args.scalarData - The scalar data of the labelmap.\n   * @param {Array} args.dimensions - The dimensions of the labelmap.\n   * @param {Array} args.spacing - The spacing of the labelmap.\n   * @param {Array} args.direction - The direction of the labelmap.\n   * @param {Array} args.origin - The origin of the labelmap.\n   * @param {number} args.segmentIndex - The segment index of the labelmap.\n   * @param {Function} progressCallback - The callback function for progress updates.\n   * @returns {Promise} - A promise that resolves with the converted surface results.\n   */\n  async convertLabelmapToSurface(args, ...callbacks) {\n    const [progressCallback] = callbacks;\n    await this.initializePolySeg(progressCallback);\n\n    const results = this.polySeg.instance.convertLabelmapToSurface(\n      args.scalarData,\n      args.dimensions,\n      args.spacing,\n      args.direction,\n      args.origin,\n      [args.segmentIndex]\n    );\n    return results;\n  },\n  /**\n   * Converts a contour to a volume labelmap.\n   * @param {Object} args - The arguments for the conversion.\n   * @param {Array} args.segmentIndices - The indices of the segments.\n   * @param {Array} args.scalarData - The scalar data.\n   * @param {Map} args.annotationUIDsInSegmentMap - The map of annotation UIDs in segment.\n   * @param {Array} args.dimensions - The dimensions of the image data.\n   * @param {Array} args.origin - The origin of the image data.\n   * @param {Array} args.direction - The direction of the image data.\n   * @param {Array} args.spacing - The spacing of the image data.\n   * @param {...Function} callbacks - Optional callbacks.\n   * @param {Function} callbacks[0] - The progress callback.\n   * @returns {Array} - The scalar data of the segmentation voxel manager.\n   */\n  async convertContourToVolumeLabelmap(args, ...callbacks) {\n    const [progressCallback] = callbacks;\n    const polySeg = await new ICRPolySeg();\n    await polySeg.initialize({\n      updateProgress: progressCallback,\n    });\n\n    const {\n      segmentIndices,\n      scalarData,\n      annotationUIDsInSegmentMap,\n      dimensions,\n      origin,\n      direction,\n      spacing,\n    } = args;\n\n    const segmentationVoxelManager =\n      utilities.VoxelManager.createVolumeVoxelManager(dimensions, scalarData);\n\n    const imageData = vtkImageData.newInstance();\n    imageData.setDimensions(dimensions);\n    imageData.setOrigin(origin);\n    imageData.setDirection(direction);\n    imageData.setSpacing(spacing);\n\n    const scalarArray = vtkDataArray.newInstance({\n      name: 'Pixels',\n      numberOfComponents: 1,\n      values: scalarData,\n    });\n\n    imageData.getPointData().setScalars(scalarArray);\n\n    imageData.modified();\n\n    for (const index of segmentIndices) {\n      const annotations = annotationUIDsInSegmentMap.get(index);\n\n      for (const annotation of annotations) {\n        const bounds = getBoundingBoxAroundShapeWorld(\n          annotation.data.contour.polyline\n        );\n\n        const [iMin, jMin, kMin] = utilities.transformWorldToIndex(imageData, [\n          bounds[0][0],\n          bounds[1][0],\n          bounds[2][0],\n        ]);\n\n        const [iMax, jMax, kMax] = utilities.transformWorldToIndex(imageData, [\n          bounds[0][1],\n          bounds[1][1],\n          bounds[2][1],\n        ]);\n\n        // Run the pointInShapeCallback for the combined bounding box\n        pointInShapeCallback(\n          imageData,\n          (pointLPS) => {\n            // Check if the point is inside any of the polylines for this segment\n            return isPointInsidePolyline3D(\n              pointLPS,\n              annotation.data.contour.polyline\n            );\n          },\n          ({ pointIJK }) => {\n            segmentationVoxelManager.setAtIJKPoint(pointIJK, index);\n          },\n          [\n            [iMin, iMax],\n            [jMin, jMax],\n            [kMin, kMax],\n          ]\n        );\n      }\n    }\n\n    return segmentationVoxelManager.scalarData;\n  },\n  /**\n   * Converts a contour to a stack labelmap.\n   * @param {Object} args - The arguments for the conversion.\n   * @param {Array} callbacks - Optional callbacks for progress updates.\n   * @returns {Promise<Object>} - The converted segmentations information.\n   */\n  async convertContourToStackLabelmap(args, ...callbacks) {\n    const [progressCallback] = callbacks;\n    const polySeg = await new ICRPolySeg();\n    await polySeg.initialize({\n      updateProgress: progressCallback,\n    });\n\n    const { segmentationsInfo, annotationUIDsInSegmentMap, segmentIndices } =\n      args;\n\n    const segmentationVoxelManagers = new Map();\n\n    segmentationsInfo.forEach((segmentationInfo, referencedImageId) => {\n      const { dimensions, scalarData, direction, spacing, origin } =\n        segmentationInfo;\n      const manager = utilities.VoxelManager.createVolumeVoxelManager(\n        dimensions,\n        scalarData\n      );\n\n      const imageData = vtkImageData.newInstance();\n      imageData.setDimensions(dimensions);\n      imageData.setOrigin(origin);\n      imageData.setDirection(direction);\n      imageData.setSpacing(spacing);\n\n      const scalarArray = vtkDataArray.newInstance({\n        name: 'Pixels',\n        numberOfComponents: 1,\n        values: scalarData,\n      });\n\n      imageData.getPointData().setScalars(scalarArray);\n\n      imageData.modified();\n\n      segmentationVoxelManagers.set(referencedImageId, { manager, imageData });\n    });\n\n    for (const index of segmentIndices) {\n      const annotations = annotationUIDsInSegmentMap.get(index);\n\n      for (const annotation of annotations) {\n        if (!annotation?.data) {\n          continue;\n        }\n        const bounds = getBoundingBoxAroundShapeWorld(\n          annotation.data.contour.polyline\n        );\n\n        const { referencedImageId } = annotation.metadata;\n\n        const { manager: segmentationVoxelManager, imageData } =\n          segmentationVoxelManagers.get(referencedImageId);\n\n        const [iMin, jMin, kMin] = utilities.transformWorldToIndex(imageData, [\n          bounds[0][0],\n          bounds[1][0],\n          bounds[2][0],\n        ]);\n\n        const [iMax, jMax, kMax] = utilities.transformWorldToIndex(imageData, [\n          bounds[0][1],\n          bounds[1][1],\n          bounds[2][1],\n        ]);\n\n        // Run the pointInShapeCallback for the combined bounding box\n        pointInShapeCallback(\n          imageData,\n          (pointLPS) => {\n            // Check if the point is inside any of the polylines for this segment\n            return isPointInsidePolyline3D(\n              pointLPS,\n              annotation.data.contour.polyline\n            );\n          },\n          ({ pointIJK }) => {\n            segmentationVoxelManager.setAtIJKPoint(pointIJK, index);\n          },\n          [\n            [iMin, iMax],\n            [jMin, jMax],\n            [kMin, kMax],\n          ]\n        );\n      }\n    }\n\n    segmentationsInfo.forEach((segmentationInfo, referencedImageId) => {\n      const { manager: segmentationVoxelManager } =\n        segmentationVoxelManagers.get(referencedImageId);\n\n      segmentationInfo.scalarData = segmentationVoxelManager.scalarData;\n    });\n    return segmentationsInfo;\n  },\n  /**\n   * Converts a surface to a volume labelmap.\n   *\n   * @param {Object} args - The arguments for the conversion.\n   * @param {Array} args.points - The points defining the surface.\n   * @param {Array} args.polys - The polygons defining the surface.\n   * @param {Array} args.dimensions - The dimensions of the volume.\n   * @param {Array} args.spacing - The spacing between voxels in the volume.\n   * @param {Array} args.direction - The direction of the volume.\n   * @param {Array} args.origin - The origin of the volume.\n   * @param {Function} progressCallback - The callback function for reporting progress.\n   * @returns {Promise} - A promise that resolves with the converted labelmap.\n   */\n  async convertSurfaceToVolumeLabelmap(args, ...callbacks) {\n    const [progressCallback] = callbacks;\n    await this.initializePolySeg(progressCallback);\n\n    const results = this.polySeg.instance.convertSurfaceToLabelmap(\n      args.points,\n      args.polys,\n      args.dimensions,\n      args.spacing,\n      args.direction,\n      args.origin\n    );\n\n    return results;\n  },\n  /**\n   * Converts surfaces to a volume labelmap.\n   * @param {Object} args - The arguments for the conversion.\n   * @param {Map} args.segmentsInfo - A map containing information about the segments.\n   * @param {Function} progressCallback - A callback function for reporting progress.\n   * @returns {Uint8Array} - The resulting volume labelmap.\n   */\n  async convertSurfacesToVolumeLabelmap(args, ...callbacks) {\n    const [progressCallback] = callbacks;\n    await this.initializePolySeg(progressCallback);\n\n    const { segmentsInfo } = args;\n\n    const promises = Array.from(segmentsInfo.keys()).map((segmentIndex) => {\n      const { points, polys } = segmentsInfo.get(segmentIndex);\n      const result = this.polySeg.instance.convertSurfaceToLabelmap(\n        points,\n        polys,\n        args.dimensions,\n        args.spacing,\n        args.direction,\n        args.origin\n      );\n\n      return {\n        ...result,\n        segmentIndex,\n      };\n    });\n\n    const results = await Promise.all(promises);\n\n    const targetImageData = vtkImageData.newInstance();\n    targetImageData.setDimensions(args.dimensions);\n    targetImageData.setOrigin(args.origin);\n    targetImageData.setSpacing(args.spacing);\n    targetImageData.setDirection(args.direction);\n\n    const totalSize =\n      args.dimensions[0] * args.dimensions[1] * args.dimensions[2];\n\n    const scalarArray = vtkDataArray.newInstance({\n      name: 'Pixels',\n      numberOfComponents: 1,\n      values: new Uint8Array(totalSize),\n    });\n\n    targetImageData.getPointData().setScalars(scalarArray);\n    targetImageData.modified();\n\n    // we need to then consolidate the results into a single volume\n    // by looping into each voxel with pointInShapeCallback\n    // and check if the voxel is inside any of the reconstructed\n    // labelmaps\n\n    const segmentationVoxelManager =\n      utilities.VoxelManager.createVolumeVoxelManager(\n        args.dimensions,\n        targetImageData.getPointData().getScalars().getData()\n      );\n\n    const outputVolumesInfo = results.map((result) => {\n      const { data, dimensions, direction, origin, spacing } = result;\n      const volume = vtkImageData.newInstance();\n      volume.setDimensions(dimensions);\n      volume.setOrigin(origin);\n      volume.setSpacing(spacing);\n      volume.setDirection(direction);\n\n      const scalarArray = vtkDataArray.newInstance({\n        name: 'Pixels',\n        numberOfComponents: 1,\n        values: data,\n      });\n\n      volume.getPointData().setScalars(scalarArray);\n\n      volume.modified();\n\n      const voxelManager = utilities.VoxelManager.createVolumeVoxelManager(\n        dimensions,\n        data\n      );\n\n      const extent = volume.getExtent(); // e.g., [0, 176, 0, 268, 0, 337] for dimensions of [177, 269, 338]\n\n      return {\n        volume,\n        voxelManager,\n        extent,\n        scalarData: data,\n        segmentIndex: result.segmentIndex,\n      };\n    });\n\n    pointInShapeCallback(\n      targetImageData,\n      () => true, // we want to loop into all voxels\n      ({ pointIJK, pointLPS }) => {\n        // Check if the point is inside any of the reconstructed labelmaps\n        // Todo: we can optimize this by returning early if the bounding box\n        // of the point is outside the bounding box of the labelmap\n\n        try {\n          for (const volumeInfo of outputVolumesInfo) {\n            const { volume, extent, voxelManager, segmentIndex } = volumeInfo;\n\n            const index = volume.worldToIndex(pointLPS);\n\n            // check if the ijk point is inside the volume\n            if (\n              index[0] < extent[0] ||\n              index[0] > extent[1] ||\n              index[1] < extent[2] ||\n              index[1] > extent[3] ||\n              index[2] < extent[4] ||\n              index[2] > extent[5]\n            ) {\n              continue;\n            }\n\n            const roundedIndex = index.map(Math.round);\n            const value = voxelManager.getAtIJK(...roundedIndex);\n            if (value > 0) {\n              segmentationVoxelManager.setAtIJKPoint(pointIJK, segmentIndex);\n              break;\n            }\n          }\n        } catch (error) {\n          // right now there is weird error if the point is outside the volume\n        }\n      }\n    );\n\n    return segmentationVoxelManager.scalarData;\n  },\n};\n\nexpose(polySegConverters);\n","module.exports = __WEBPACK_EXTERNAL_MODULE__785__;","module.exports = __WEBPACK_EXTERNAL_MODULE__283__;","module.exports = __WEBPACK_EXTERNAL_MODULE__953__;","module.exports = __WEBPACK_EXTERNAL_MODULE__976__;","// The module cache\nvar __webpack_module_cache__ = {};\n\n// The require function\nfunction __webpack_require__(moduleId) {\n\t// Check if module is in cache\n\tvar cachedModule = __webpack_module_cache__[moduleId];\n\tif (cachedModule !== undefined) {\n\t\treturn cachedModule.exports;\n\t}\n\t// Create a new module (and put it into the cache)\n\tvar module = __webpack_module_cache__[moduleId] = {\n\t\t// no module.id needed\n\t\t// no module.loaded needed\n\t\texports: {}\n\t};\n\n\t// Execute the module function\n\t__webpack_modules__[moduleId](module, module.exports, __webpack_require__);\n\n\t// Return the exports of the module\n\treturn module.exports;\n}\n\n// expose the modules object (__webpack_modules__)\n__webpack_require__.m = __webpack_modules__;\n\n// the startup function\n__webpack_require__.x = () => {\n\t// Load entry module and return exports\n\t// This entry module depends on other loaded chunks and execution need to be delayed\n\tvar __webpack_exports__ = __webpack_require__.O(undefined, [78], () => (__webpack_require__(248)))\n\t__webpack_exports__ = __webpack_require__.O(__webpack_exports__);\n\treturn __webpack_exports__;\n};\n\n","// getDefaultExport function for compatibility with non-harmony modules\n__webpack_require__.n = (module) => {\n\tvar getter = module && module.__esModule ?\n\t\t() => (module['default']) :\n\t\t() => (module);\n\t__webpack_require__.d(getter, { a: getter });\n\treturn getter;\n};","// define getter functions for harmony exports\n__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n\t\t}\n\t}\n};","__webpack_require__.f = {};\n// This file contains only the entry chunk.\n// The chunk loading function for additional chunks\n__webpack_require__.e = (chunkId) => {\n\treturn Promise.all(Object.keys(__webpack_require__.f).reduce((promises, key) => {\n\t\t__webpack_require__.f[key](chunkId, promises);\n\t\treturn promises;\n\t}, []));\n};","// This function allow to reference async chunks and sibling chunks for the entrypoint\n__webpack_require__.u = (chunkId) => {\n\t// return url for filenames based on template\n\treturn \"\" + chunkId + \".index.js\";\n};","__webpack_require__.g = (function() {\n\tif (typeof globalThis === 'object') return globalThis;\n\ttry {\n\t\treturn this || new Function('return this')();\n\t} catch (e) {\n\t\tif (typeof window === 'object') return window;\n\t}\n})();","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","var scriptUrl;\nif (__webpack_require__.g.importScripts) scriptUrl = __webpack_require__.g.location + \"\";\nvar document = __webpack_require__.g.document;\nif (!scriptUrl && document) {\n\tif (document.currentScript)\n\t\tscriptUrl = document.currentScript.src;\n\tif (!scriptUrl) {\n\t\tvar scripts = document.getElementsByTagName(\"script\");\n\t\tif(scripts.length) {\n\t\t\tvar i = scripts.length - 1;\n\t\t\twhile (i > -1 && !scriptUrl) scriptUrl = scripts[i--].src;\n\t\t}\n\t}\n}\n// When supporting browsers where an automatic publicPath is not supported you must specify an output.publicPath manually via configuration\n// or pass an empty string (\"\") and set the __webpack_public_path__ variable from your code to use your own logic.\nif (!scriptUrl) throw new Error(\"Automatic publicPath is not supported in this browser\");\nscriptUrl = scriptUrl.replace(/#.*$/, \"\").replace(/\\?.*$/, \"\").replace(/\\/[^\\/]+$/, \"/\");\n__webpack_require__.p = scriptUrl;","// no baseURI\n\n// object to store loaded chunks\n// \"1\" means \"already loaded\"\nvar installedChunks = {\n\t985: 1\n};\n\n// importScripts chunk loading\nvar installChunk = (data) => {\n\tvar chunkIds = data[0];\n\tvar moreModules = data[1];\n\tvar runtime = data[2];\n\tfor(var moduleId in moreModules) {\n\t\tif(__webpack_require__.o(moreModules, moduleId)) {\n\t\t\t__webpack_require__.m[moduleId] = moreModules[moduleId];\n\t\t}\n\t}\n\tif(runtime) runtime(__webpack_require__);\n\twhile(chunkIds.length)\n\t\tinstalledChunks[chunkIds.pop()] = 1;\n\tparentChunkLoadingFunction(data);\n};\n__webpack_require__.f.i = (chunkId, promises) => {\n\t// \"1\" is the signal for \"already loaded\"\n\tif(!installedChunks[chunkId]) {\n\t\tif(true) { // all chunks have JS\n\t\t\timportScripts(__webpack_require__.p + __webpack_require__.u(chunkId));\n\t\t}\n\t}\n};\n\nvar chunkLoadingGlobal = self[\"webpackChunkcornerstoneTools3D\"] = self[\"webpackChunkcornerstoneTools3D\"] || [];\nvar parentChunkLoadingFunction = chunkLoadingGlobal.push.bind(chunkLoadingGlobal);\nchunkLoadingGlobal.push = installChunk;\n\n// no HMR\n\n// no HMR manifest","// run startup\nvar __webpack_exports__ = __webpack_require__.x();\n"],"names":["root","factory","exports","module","require","define","amd","self","__WEBPACK_EXTERNAL_MODULE__283__","__WEBPACK_EXTERNAL_MODULE__785__","__WEBPACK_EXTERNAL_MODULE__953__","__WEBPACK_EXTERNAL_MODULE__976__","deferred","next","EPSILON","CONSTANTS","getBoundingBoxAroundShapeWorld","points","clipBounds","dimensions","_points$","isWorld","arguments","length","undefined","xMin","Infinity","xMax","yMin","yMax","zMin","zMax","is3D","i","p","_p$","_p$2","Math","min","max","calculateBoundingBox","pointInShapeCallback","imageData","pointInShapeFn","callback","boundsIJK","iMin","iMax","jMin","jMax","kMin","kMax","scalarData","numComps","getScalarData","getPointData","getScalars","getData","getDimensions","start","vec3","direction","getDirection","rowCosines","slice","columnCosines","scanAxisNormal","spacing","getSpacing","rowSpacing","columnSpacing","scanAxisSpacing","worldPosStart","indexToWorld","rowStep","columnStep","scanAxisStep","xMultiple","yMultiple","zMultiple","pointsInShape","currentPos","k","startPosJ","j","startPosI","pointIJK","index","value","push","pointLPS","isPointInsidePolyline3D","point","polyline","sharedDimensionIndex","testPoints","every","array","Error","points2D","closed","numPolylinePoints","numIntersections","shouldClose","distFirstToLastPoints","p1","p2","x1","y1","z1","x2","y2","z2","dx","dy","dz","math","glMatrix","isClosed","maxSegmentIndex","maxX","maxY","minY","intersects","xIntersection","containsPoint","polySegConverters","polySeg","polySegInitializing","polySegInitializingPromise","initializePolySeg","progressCallback","_this$polySeg","this","instance","Promise","resolve","ICRPolySeg","initialize","updateProgress","then","convertContourToSurface","args","polylines","numPointsArray","_len","callbacks","Array","_key","convertContourRoiToSurface","convertLabelmapToSurface","_len2","_key2","origin","segmentIndex","convertContourToVolumeLabelmap","_len3","_key3","segmentIndices","annotationUIDsInSegmentMap","segmentationVoxelManager","utilities","vtkImageData","setDimensions","setOrigin","setDirection","setSpacing","scalarArray","vtkDataArray","name","numberOfComponents","values","setScalars","modified","annotations","get","annotation","bounds","data","contour","_ref","setAtIJKPoint","convertContourToStackLabelmap","_len4","_key4","segmentationsInfo","segmentationVoxelManagers","Map","forEach","segmentationInfo","referencedImageId","manager","set","metadata","_ref2","convertSurfaceToVolumeLabelmap","_len5","_key5","convertSurfaceToLabelmap","polys","convertSurfacesToVolumeLabelmap","_len6","_key6","segmentsInfo","promises","from","keys","map","results","all","targetImageData","totalSize","Uint8Array","outputVolumesInfo","result","volume","voxelManager","extent","getExtent","_ref3","volumeInfo","worldToIndex","roundedIndex","round","getAtIJK","error","expose","__webpack_module_cache__","__webpack_require__","moduleId","cachedModule","__webpack_modules__","m","x","__webpack_exports__","O","chunkIds","fn","priority","notFulfilled","fulfilled","Object","key","splice","r","n","getter","__esModule","d","a","definition","o","defineProperty","enumerable","f","e","chunkId","reduce","u","g","globalThis","Function","window","obj","prop","prototype","hasOwnProperty","call","scriptUrl","importScripts","location","document","currentScript","src","scripts","getElementsByTagName","replace","installedChunks","chunkLoadingGlobal","parentChunkLoadingFunction","bind","moreModules","runtime","pop"],"sourceRoot":""}