PageSourceSearch

https://www.cornerstonejs.org/assets/js/2b6c1ce5.78a4fbb5.js

js cornerstonejs.org collected 2026-09-24 09:21:35 UTC 3,925 bytes, 1 lines download raw bytes

1"use strict";(self.webpackChunkdocs=self.webpackChunkdocs||[]).push([["11873"],{80557:function(e,n,s){s.r(n),s.d(n,{metadata:()=>t,default:()=>d,frontMatter:()=>l,contentTitle:()=>c,toc:()=>r,assets:()=>a});var t=JSON.parse('{"id":"api/tools/namespaces/utilities/namespaces/math/namespaces/polyline/functions/intersectPolylines","title":"Function: intersectPolylines()","description":"intersectPolylines(mainPolyCoords, clipPolyCoordsInput): Types.Point2","source":"@site/docs/api/tools/namespaces/utilities/namespaces/math/namespaces/polyline/functions/intersectPolylines.md","sourceDirName":"api/tools/namespaces/utilities/namespaces/math/namespaces/polyline/functions","slug":"/api/tools/namespaces/utilities/namespaces/math/namespaces/polyline/functions/intersectPolylines","permalink":"/docs/api/tools/namespaces/utilities/namespaces/math/namespaces/polyline/functions/intersectPolylines","draft":false,"unlisted":false,"editUrl":"https://github.com/cornerstonejs/cornerstone3D/edit/main/packages/docs/docs/api/tools/namespaces/utilities/namespaces/math/namespaces/polyline/functions/intersectPolylines.md","tags":[],"version":"current","frontMatter":{},"sidebar":"typedocSidebar22","previous":{"title":"Function: intersectPolyline()","permalink":"/docs/api/tools/namespaces/utilities/namespaces/math/namespaces/polyline/functions/intersectPolyline"},"next":{"title":"Function: isClosed()","permalink":"/docs/api/tools/namespaces/utilities/namespaces/math/namespaces/polyline/functions/isClosed"}}'),i=s(31085),o=s(92600);let l={},c="Function: intersectPolylines()",a={},r=[{value:"Parameters",id:"parameters",level:2},{value:"Returns",id:"returns",level:2},{value:"Defined in",id:"defined-in",level:2}];function p(e){let n={a:"a",blockquote:"blockquote",code:"code",h1:"h1",h2:"h2",header:"header",p:"p",strong:"strong",...(0,o.R)(),...e.components};return(0,i.jsxs)(i.Fragment,{children:[(0,i.jsx)(n.header,{children:(0,i.jsx)(n.h1,{id:"function-intersectpolylines",children:"Function: intersectPolylines()"})}),"\n",(0,i.jsxs)(n.blockquote,{children:["\n",(0,i.jsxs)(n.p,{children:[(0,i.jsx)(n.strong,{children:"intersectPolylines"}),"(",(0,i.jsx)(n.code,{children:"mainPolyCoords"}),", ",(0,i.jsx)(n.code,{children:"clipPolyCoordsInput"}),"): ",(0,i.jsx)(n.code,{children:"Types.Point2"}),"[][]"]}),"\n"]}),"\n",(0,i.jsx)(n.p,{children:"Calculates all unique intersection points between two polylines.\nAssumes polylines are closed (last point connects to first)."}),"\n",(0,i.jsx)(n.h2,{id:"parameters",children:"Parameters"}),"\n",(0,i.jsxs)(n.p,{children:["\u2022 ",(0,i.jsx)(n.strong,{children:"mainPolyCoords"}),": ",(0,i.jsx)(n.code,{children:"Point2"}),"[]"]}),"\n",(0,i.jsxs)(n.p,{children:["\u2022 ",(0,i.jsx)(n.strong,{children:"clipPolyCoordsInput"}),": ",(0,i.jsx)(n.code,{children:"Point2"}),"[]"]}),"\n",(0,i.jsx)(n.h2,{id:"returns",children:"Returns"}),"\n",(0,i.jsxs)(n.p,{children:[(0,i.jsx)(n.code,{children:"Types.Point2"}),"[][]"]}),"\n",(0,i.jsx)(n.p,{children:"An array of unique intersection points (Types.Point2[])."}),"\n",(0,i.jsx)(n.h2,{id:"defined-in",children:"Defined in"}),"\n",(0,i.jsx)(n.p,{children:(0,i.jsx)(n.a,{href:"https://github.com/cornerstonejs/cornerstone3D/blob/38fdfaa1d44940275c40f14c989044e306cc21f6/packages/tools/src/utilities/math/polyline/intersectPolylines.ts#L28",children:"tools/src/utilities/math/polyline/intersectPolylines.ts:28"})})]})}function d(e={}){let{wrapper:n}={...(0,o.R)(),...e.components};return n?(0,i.jsx)(n,{...e,children:(0,i.jsx)(p,{...e})}):p(e)}},92600:function(e,n,s){s.d(n,{R:()=>l,x:()=>c});var t=s(14041);let i={},o=t.createContext(i);function l(e){let n=t.useContext(o);return t.useMemo(function(){return"function"==typeof e?e(n):{...n,...e}},[n,e])}function c(e){let n;return n=e.disableParentContext?"function"==typeof e.components?e.components(i):e.components||i:l(e.components),t.createElement(o.Provider,{value:n},e.children)}}}]);

Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.