@itwin/core-frontend 3.0.0-dev.98 → 3.0.0

package/lib/cjs/render/primitives/EdgeParams.js

@@ -0,0 +1,220 @@
+"use strict";
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module Rendering
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.EdgeParams = void 0;
+const core_bentley_1 = require("@itwin/core-bentley");
+const VertexTable_1 = require("./VertexTable");
+const PolylineParams_1 = require("./PolylineParams");
+const IModelApp_1 = require("../../IModelApp");
+function convertPolylinesAndEdges(polylines, edges) {
+    let numIndices = undefined !== edges ? edges.length : 0;
+    if (undefined !== polylines)
+        for (const pd of polylines)
+            numIndices += (pd.vertIndices.length - 1);
+    if (0 === numIndices)
+        return undefined;
+    numIndices *= 6;
+    const indexBytes = new Uint8Array(numIndices * 3);
+    const endPointAndQuadIndexBytes = new Uint8Array(numIndices * 4);
+    let ndx = 0;
+    let ndx2 = 0;
+    const addPoint = (p0, p1, quadIndex) => {
+        VertexTable_1.VertexIndices.encodeIndex(p0, indexBytes, ndx);
+        ndx += 3;
+        VertexTable_1.VertexIndices.encodeIndex(p1, endPointAndQuadIndexBytes, ndx2);
+        endPointAndQuadIndexBytes[ndx2 + 3] = quadIndex;
+        ndx2 += 4;
+    };
+    if (undefined !== polylines) {
+        for (const pd of polylines) {
+            const num = pd.vertIndices.length - 1;
+            for (let i = 0; i < num; ++i) {
+                let p0 = pd.vertIndices[i];
+                let p1 = pd.vertIndices[i + 1];
+                if (p1 < p0) { // swap so that lower index is first.
+                    p0 = p1;
+                    p1 = pd.vertIndices[i];
+                }
+                addPoint(p0, p1, 0);
+                addPoint(p1, p0, 2);
+                addPoint(p0, p1, 1);
+                addPoint(p0, p1, 1);
+                addPoint(p1, p0, 2);
+                addPoint(p1, p0, 3);
+            }
+        }
+    }
+    if (undefined !== edges) {
+        for (const meshEdge of edges) {
+            const p0 = meshEdge.indices[0];
+            const p1 = meshEdge.indices[1];
+            addPoint(p0, p1, 0);
+            addPoint(p1, p0, 2);
+            addPoint(p0, p1, 1);
+            addPoint(p0, p1, 1);
+            addPoint(p1, p0, 2);
+            addPoint(p1, p0, 3);
+        }
+    }
+    return {
+        indices: new VertexTable_1.VertexIndices(indexBytes),
+        endPointAndQuadIndices: endPointAndQuadIndexBytes,
+    };
+}
+function convertSilhouettes(edges, normalPairs) {
+    const base = convertPolylinesAndEdges(undefined, edges);
+    if (undefined === base)
+        return undefined;
+    const normalPairBytes = new Uint8Array(normalPairs.length * 6 * 4);
+    const normalPair16 = new Uint16Array(normalPairBytes.buffer);
+    let ndx = 0;
+    for (const pair of normalPairs) {
+        for (let i = 0; i < 6; i++) {
+            normalPair16[ndx++] = pair.first.value;
+            normalPair16[ndx++] = pair.second.value;
+        }
+    }
+    return {
+        indices: base.indices,
+        endPointAndQuadIndices: base.endPointAndQuadIndices,
+        normalPairs: normalPairBytes,
+    };
+}
+function buildIndexedEdges(args, doPolylines, maxSize) {
+    var _a, _b, _c, _d, _e;
+    const hardEdges = (_a = args.edges) === null || _a === void 0 ? void 0 : _a.edges;
+    const silhouettes = args.silhouettes;
+    const polylines = doPolylines ? (_b = args.polylines) === null || _b === void 0 ? void 0 : _b.lines : undefined;
+    const numHardEdges = (_c = hardEdges === null || hardEdges === void 0 ? void 0 : hardEdges.length) !== null && _c !== void 0 ? _c : 0;
+    const numSilhouettes = (_e = (_d = silhouettes === null || silhouettes === void 0 ? void 0 : silhouettes.edges) === null || _d === void 0 ? void 0 : _d.length) !== null && _e !== void 0 ? _e : 0;
+    const numPolylines = polylines ? polylines.reduce((count, pd) => count + Math.max(0, pd.vertIndices.length - 1), 0) : 0;
+    const numSegmentEdges = numHardEdges + numPolylines;
+    const numTotalEdges = numSegmentEdges + numSilhouettes;
+    if (numTotalEdges === 0)
+        return undefined;
+    // Each edge is a quad consisting of six vertices. Each vertex is an identical 24-bit index into the lookup table.
+    const indices = new VertexTable_1.VertexIndices(new Uint8Array(numTotalEdges * 6 * 3));
+    for (let i = 0; i < numTotalEdges; i++)
+        for (let j = 0; j < 6; j++)
+            indices.setNthIndex(i * 6 + j, i);
+    // Each segment edge requires 2 24-bit indices = 6 bytes = 1.5 RGBA values.
+    // Each silhouette requires the same as segment edge plus 2 16-bit oct-encoded normals = 10 bytes = 2.5 RGBA values.
+    let nRgbaRequired = Math.ceil(1.5 * numSegmentEdges + 2.5 * numSilhouettes);
+    let dimensions;
+    const silhouetteStartByteIndex = numSegmentEdges * 6;
+    let silhouettePadding = 0;
+    if (nRgbaRequired < maxSize) {
+        dimensions = { width: nRgbaRequired, height: 1 };
+    }
+    else {
+        // Make roughly square to reduce unused space in last row.
+        let width = Math.ceil(Math.sqrt(nRgbaRequired));
+        // Each entry's data must fit on the same row. 15 RGBA = 60 bytes = lowest common multiple of 6, 10, and 4.
+        const remainder = width % 15;
+        if (0 !== remainder)
+            width += 15 - remainder;
+        // If the table contains both segments and silhouettes, there may be one row containing a mix of the two where padding
+        // is required between them.
+        if (numSilhouettes > 0 && numSegmentEdges > 0) {
+            const silOffset = silhouetteStartByteIndex % 60; // some multiple of 6.
+            silhouettePadding = (60 - silOffset) % 10;
+            nRgbaRequired += Math.ceil(silhouettePadding / 4);
+        }
+        let height = Math.ceil(nRgbaRequired / width);
+        if (width * height < nRgbaRequired)
+            height++;
+        dimensions = { width, height };
+    }
+    const data = new Uint8Array(dimensions.width * dimensions.height * 4);
+    function setUint24(byteIndex, value) {
+        data[byteIndex + 0] = value & 0x0000ff;
+        data[byteIndex + 1] = (value & 0x00ff00) >>> 8;
+        data[byteIndex + 2] = (value & 0xff0000) >>> 16;
+    }
+    function setEdge(index, startPointIndex, endPointIndex) {
+        const byteIndex = index * 6;
+        setUint24(byteIndex, startPointIndex);
+        setUint24(byteIndex + 3, endPointIndex);
+    }
+    let curIndex = 0;
+    if (hardEdges)
+        for (const edge of hardEdges)
+            setEdge(curIndex++, edge.indices[0], edge.indices[1]);
+    if (polylines) {
+        for (const pd of polylines) {
+            const num = pd.vertIndices.length - 1;
+            for (let i = 0; i < num; i++) {
+                const p0 = pd.vertIndices[i];
+                const p1 = pd.vertIndices[i + 1];
+                // Ensure lower index is first.
+                if (p0 < p1)
+                    setEdge(curIndex++, p0, p1);
+                else
+                    setEdge(curIndex++, p1, p0);
+            }
+        }
+    }
+    if (silhouettes === null || silhouettes === void 0 ? void 0 : silhouettes.edges) {
+        (0, core_bentley_1.assert)(undefined !== silhouettes.normals);
+        (0, core_bentley_1.assert)(silhouettes.normals.length === silhouettes.edges.length);
+        function setSilhouette(index, start, end, normals) {
+            const byteIndex = silhouetteStartByteIndex + silhouettePadding + index * 10;
+            setUint24(byteIndex, start);
+            setUint24(byteIndex + 3, end);
+            data[byteIndex + 6] = normals.first.value & 0xff;
+            data[byteIndex + 7] = (normals.first.value & 0xff00) >>> 8;
+            data[byteIndex + 8] = normals.second.value & 0xff;
+            data[byteIndex + 9] = (normals.second.value & 0xff00) >>> 8;
+        }
+        curIndex = 0;
+        for (let i = 0; i < silhouettes.edges.length; i++)
+            setSilhouette(curIndex++, silhouettes.edges[i].indices[0], silhouettes.edges[i].indices[1], silhouettes.normals[i]);
+    }
+    return {
+        indices,
+        edges: {
+            data,
+            width: dimensions.width,
+            height: dimensions.height,
+            numSegments: numSegmentEdges,
+            silhouettePadding,
+        },
+    };
+}
+/** @internal */
+var EdgeParams;
+(function (EdgeParams) {
+    function fromMeshArgs(meshArgs, maxWidth) {
+        const args = meshArgs.edges;
+        const doJoints = (0, PolylineParams_1.wantJointTriangles)(args.width, meshArgs.is2d);
+        const polylines = doJoints ? PolylineParams_1.TesselatedPolyline.fromMesh(meshArgs) : undefined;
+        let segments;
+        let silhouettes;
+        let indexed;
+        if (IModelApp_1.IModelApp.tileAdmin.enableIndexedEdges) {
+            indexed = buildIndexedEdges(args, !doJoints, maxWidth !== null && maxWidth !== void 0 ? maxWidth : IModelApp_1.IModelApp.renderSystem.maxTextureSize);
+        }
+        else {
+            segments = convertPolylinesAndEdges(undefined, args.edges.edges);
+            silhouettes = args.silhouettes.edges && args.silhouettes.normals ? convertSilhouettes(args.silhouettes.edges, args.silhouettes.normals) : undefined;
+        }
+        if (!segments && !silhouettes && !polylines && !indexed)
+            return undefined;
+        return {
+            weight: args.width,
+            linePixels: args.linePixels,
+            segments,
+            silhouettes,
+            polylines,
+            indexed,
+        };
+    }
+    EdgeParams.fromMeshArgs = fromMeshArgs;
+})(EdgeParams = exports.EdgeParams || (exports.EdgeParams = {}));
+//# sourceMappingURL=EdgeParams.js.map

package/lib/cjs/render/primitives/EdgeParams.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"EdgeParams.js","sourceRoot":"","sources":["../../../../src/render/primitives/EdgeParams.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,sDAA6C;AAG7C,+CAA8C;AAC9C,qDAA0E;AAC1E,+CAA4C;AAmB5C,SAAS,wBAAwB,CAAC,SAA0B,EAAE,KAAkB;IAC9E,IAAI,UAAU,GAAG,SAAS,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACxD,IAAI,SAAS,KAAK,SAAS;QACzB,KAAK,MAAM,EAAE,IAAI,SAAS;YACxB,UAAU,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAE9C,IAAI,CAAC,KAAK,UAAU;QAClB,OAAO,SAAS,CAAC;IAEnB,UAAU,IAAI,CAAC,CAAC;IAChB,MAAM,UAAU,GAAG,IAAI,UAAU,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;IAClD,MAAM,yBAAyB,GAAG,IAAI,UAAU,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;IAEjE,IAAI,GAAG,GAAW,CAAC,CAAC;IACpB,IAAI,IAAI,GAAW,CAAC,CAAC;IAErB,MAAM,QAAQ,GAAG,CAAC,EAAU,EAAE,EAAU,EAAE,SAAiB,EAAE,EAAE;QAC7D,2BAAa,CAAC,WAAW,CAAC,EAAE,EAAE,UAAU,EAAE,GAAG,CAAC,CAAC;QAC/C,GAAG,IAAI,CAAC,CAAC;QACT,2BAAa,CAAC,WAAW,CAAC,EAAE,EAAE,yBAAyB,EAAE,IAAI,CAAC,CAAC;QAC/D,yBAAyB,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC;QAChD,IAAI,IAAI,CAAC,CAAC;IACZ,CAAC,CAAC;IAEF,IAAI,SAAS,KAAK,SAAS,EAAE;QAC3B,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE;YAC1B,MAAM,GAAG,GAAG,EAAE,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;YACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,EAAE,CAAC,EAAE;gBAC5B,IAAI,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBAC3B,IAAI,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC/B,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,qCAAqC;oBAClD,EAAE,GAAG,EAAE,CAAC;oBACR,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;iBACxB;gBACD,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;gBACpB,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;gBACpB,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;gBACpB,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;gBACpB,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;gBACpB,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;aACrB;SACF;KACF;IAED,IAAI,SAAS,KAAK,KAAK,EAAE;QACvB,KAAK,MAAM,QAAQ,IAAI,KAAK,EAAE;YAC5B,MAAM,EAAE,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,EAAE,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC/B,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;YACpB,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;YACpB,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;YACpB,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;YACpB,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;YACpB,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;SACrB;KACF;IAED,OAAO;QACL,OAAO,EAAE,IAAI,2BAAa,CAAC,UAAU,CAAC;QACtC,sBAAsB,EAAE,yBAAyB;KAClD,CAAC;AACJ,CAAC;AAaD,SAAS,kBAAkB,CAAC,KAAiB,EAAE,WAAmC;IAChF,MAAM,IAAI,GAAG,wBAAwB,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;IACxD,IAAI,SAAS,KAAK,IAAI;QACpB,OAAO,SAAS,CAAC;IAEnB,MAAM,eAAe,GAAG,IAAI,UAAU,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACnE,MAAM,YAAY,GAAG,IAAI,WAAW,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;IAE7D,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,YAAY,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC;YACvC,YAAY,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;SACzC;KACF;IAED,OAAO;QACL,OAAO,EAAE,IAAI,CAAC,OAAO;QACrB,sBAAsB,EAAE,IAAI,CAAC,sBAAsB;QACnD,WAAW,EAAE,eAAe;KAC7B,CAAC;AACJ,CAAC;AAmCD,SAAS,iBAAiB,CAAC,IAAmB,EAAE,WAAoB,EAAE,OAAe;;IACnF,MAAM,SAAS,GAAG,MAAA,IAAI,CAAC,KAAK,0CAAE,KAAK,CAAC;IACpC,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC;IACrC,MAAM,SAAS,GAAG,WAAW,CAAC,CAAC,CAAC,MAAA,IAAI,CAAC,SAAS,0CAAE,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;IAElE,MAAM,YAAY,GAAG,MAAA,SAAS,aAAT,SAAS,uBAAT,SAAS,CAAE,MAAM,mCAAI,CAAC,CAAC;IAC5C,MAAM,cAAc,GAAG,MAAA,MAAA,WAAW,aAAX,WAAW,uBAAX,WAAW,CAAE,KAAK,0CAAE,MAAM,mCAAI,CAAC,CAAC;IACvD,MAAM,YAAY,GAAG,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,KAAa,EAAE,EAAgB,EAAE,EAAE,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9I,MAAM,eAAe,GAAG,YAAY,GAAG,YAAY,CAAC;IACpD,MAAM,aAAa,GAAG,eAAe,GAAG,cAAc,CAAC;IACvD,IAAI,aAAa,KAAK,CAAC;QACrB,OAAO,SAAS,CAAC;IAEnB,kHAAkH;IAClH,MAAM,OAAO,GAAG,IAAI,2BAAa,CAAC,IAAI,UAAU,CAAC,aAAa,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACzE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,EAAE,CAAC,EAAE;QACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YACxB,OAAO,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAEtC,2EAA2E;IAC3E,oHAAoH;IACpH,IAAI,aAAa,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG,eAAe,GAAG,GAAG,GAAG,cAAc,CAAC,CAAC;IAC5E,IAAI,UAAU,CAAC;IACf,MAAM,wBAAwB,GAAG,eAAe,GAAG,CAAC,CAAC;IACrD,IAAI,iBAAiB,GAAG,CAAC,CAAC;IAC1B,IAAI,aAAa,GAAG,OAAO,EAAE;QAC3B,UAAU,GAAG,EAAE,KAAK,EAAE,aAAa,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;KAClD;SAAM;QACL,0DAA0D;QAC1D,IAAI,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;QAChD,2GAA2G;QAC3G,MAAM,SAAS,GAAG,KAAK,GAAG,EAAE,CAAC;QAC7B,IAAI,CAAC,KAAK,SAAS;YACjB,KAAK,IAAI,EAAE,GAAG,SAAS,CAAC;QAE1B,sHAAsH;QACtH,4BAA4B;QAC5B,IAAI,cAAc,GAAG,CAAC,IAAI,eAAe,GAAG,CAAC,EAAE;YAC7C,MAAM,SAAS,GAAG,wBAAwB,GAAG,EAAE,CAAC,CAAC,sBAAsB;YACvE,iBAAiB,GAAG,CAAC,EAAE,GAAG,SAAS,CAAC,GAAG,EAAE,CAAC;YAC1C,aAAa,IAAI,IAAI,CAAC,IAAI,CAAC,iBAAiB,GAAG,CAAC,CAAC,CAAC;SACnD;QAED,IAAI,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,CAAC;QAC9C,IAAI,KAAK,GAAG,MAAM,GAAG,aAAa;YAChC,MAAM,EAAE,CAAC;QAEX,UAAU,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;KAChC;IAED,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,UAAU,CAAC,KAAK,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACtE,SAAS,SAAS,CAAC,SAAiB,EAAE,KAAa;QACjD,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,KAAK,GAAG,QAAQ,CAAC;QACvC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC/C,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC;IAClD,CAAC;IAED,SAAS,OAAO,CAAC,KAAa,EAAE,eAAuB,EAAE,aAAqB;QAC5E,MAAM,SAAS,GAAG,KAAK,GAAG,CAAC,CAAC;QAC5B,SAAS,CAAC,SAAS,EAAE,eAAe,CAAC,CAAC;QACtC,SAAS,CAAC,SAAS,GAAG,CAAC,EAAE,aAAa,CAAC,CAAC;IAC1C,CAAC;IAED,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,SAAS;QACX,KAAK,MAAM,IAAI,IAAI,SAAS;YAC1B,OAAO,CAAC,QAAQ,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAE1D,IAAI,SAAS,EAAE;QACb,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE;YAC1B,MAAM,GAAG,GAAG,EAAE,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;YACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;gBAC5B,MAAM,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBAC7B,MAAM,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACjC,+BAA+B;gBAC/B,IAAI,EAAE,GAAG,EAAE;oBACT,OAAO,CAAC,QAAQ,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;;oBAE5B,OAAO,CAAC,QAAQ,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;aAC/B;SACF;KACF;IAED,IAAI,WAAW,aAAX,WAAW,uBAAX,WAAW,CAAE,KAAK,EAAE;QACtB,IAAA,qBAAM,EAAC,SAAS,KAAK,WAAW,CAAC,OAAO,CAAC,CAAC;QAC1C,IAAA,qBAAM,EAAC,WAAW,CAAC,OAAO,CAAC,MAAM,KAAK,WAAW,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAChE,SAAS,aAAa,CAAC,KAAa,EAAE,KAAa,EAAE,GAAW,EAAE,OAA6B;YAC7F,MAAM,SAAS,GAAG,wBAAwB,GAAG,iBAAiB,GAAG,KAAK,GAAG,EAAE,CAAC;YAC5E,SAAS,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;YAC5B,SAAS,CAAC,SAAS,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;YAC9B,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC;YACjD,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;YAC3D,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC;YAClD,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;QAC9D,CAAC;QAED,QAAQ,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;YAC/C,aAAa,CAAC,QAAQ,EAAE,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;KACvH;IAED,OAAO;QACL,OAAO;QACP,KAAK,EAAE;YACL,IAAI;YACJ,KAAK,EAAE,UAAU,CAAC,KAAK;YACvB,MAAM,EAAE,UAAU,CAAC,MAAM;YACzB,WAAW,EAAE,eAAe;YAC5B,iBAAiB;SAClB;KACF,CAAC;AACJ,CAAC;AAkBD,gBAAgB;AAChB,IAAiB,UAAU,CA6B1B;AA7BD,WAAiB,UAAU;IACzB,SAAgB,YAAY,CAAC,QAAkB,EAAE,QAAiB;QAChE,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC;QAC5B,MAAM,QAAQ,GAAG,IAAA,mCAAkB,EAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC/D,MAAM,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAC,mCAAkB,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAE/E,IAAI,QAAuC,CAAC;QAC5C,IAAI,WAAyC,CAAC;QAC9C,IAAI,OAAsC,CAAC;QAE3C,IAAI,qBAAS,CAAC,SAAS,CAAC,kBAAkB,EAAE;YAC1C,OAAO,GAAG,iBAAiB,CAAC,IAAI,EAAE,CAAC,QAAQ,EAAE,QAAQ,aAAR,QAAQ,cAAR,QAAQ,GAAI,qBAAS,CAAC,YAAY,CAAC,cAAc,CAAC,CAAC;SACjG;aAAM;YACL,QAAQ,GAAG,wBAAwB,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YACjE,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,IAAI,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,kBAAkB,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;SACrJ;QAED,IAAI,CAAC,QAAQ,IAAI,CAAC,WAAW,IAAI,CAAC,SAAS,IAAI,CAAC,OAAO;YACrD,OAAO,SAAS,CAAC;QAEnB,OAAO;YACL,MAAM,EAAE,IAAI,CAAC,KAAK;YAClB,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,QAAQ;YACR,WAAW;YACX,SAAS;YACT,OAAO;SACR,CAAC;IACJ,CAAC;IA3Be,uBAAY,eA2B3B,CAAA;AACH,CAAC,EA7BgB,UAAU,GAAV,kBAAU,KAAV,kBAAU,QA6B1B","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Rendering\r\n */\r\n\r\nimport { assert } from \"@itwin/core-bentley\";\r\nimport { LinePixels, MeshEdge, OctEncodedNormalPair, PolylineData } from \"@itwin/core-common\";\r\nimport { MeshArgs, MeshArgsEdges } from \"./mesh/MeshPrimitives\";\r\nimport { VertexIndices } from \"./VertexTable\";\r\nimport { TesselatedPolyline, wantJointTriangles } from \"./PolylineParams\";\r\nimport { IModelApp } from \"../../IModelApp\";\r\n\r\n/**\r\n * Describes a set of line segments representing edges of a mesh.\r\n * Each segment is expanded into a quad defined by two triangles.\r\n * The positions are adjusted in the shader to account for the edge width.\r\n * @internal\r\n */\r\nexport interface SegmentEdgeParams {\r\n  /** The 24-bit indices of the tesselated line segment */\r\n  readonly indices: VertexIndices;\r\n  /**\r\n   * For each 24-bit index, 4 bytes:\r\n   * the 24-bit index of the vertex at the other end of the segment, followed by\r\n   * an 8-bit 'quad index' in [0..3] indicating which point in the expanded quad the vertex represents.\r\n   */\r\n  readonly endPointAndQuadIndices: Uint8Array;\r\n}\r\n\r\nfunction convertPolylinesAndEdges(polylines?: PolylineData[], edges?: MeshEdge[]): SegmentEdgeParams | undefined {\r\n  let numIndices = undefined !== edges ? edges.length : 0;\r\n  if (undefined !== polylines)\r\n    for (const pd of polylines)\r\n      numIndices += (pd.vertIndices.length - 1);\r\n\r\n  if (0 === numIndices)\r\n    return undefined;\r\n\r\n  numIndices *= 6;\r\n  const indexBytes = new Uint8Array(numIndices * 3);\r\n  const endPointAndQuadIndexBytes = new Uint8Array(numIndices * 4);\r\n\r\n  let ndx: number = 0;\r\n  let ndx2: number = 0;\r\n\r\n  const addPoint = (p0: number, p1: number, quadIndex: number) => {\r\n    VertexIndices.encodeIndex(p0, indexBytes, ndx);\r\n    ndx += 3;\r\n    VertexIndices.encodeIndex(p1, endPointAndQuadIndexBytes, ndx2);\r\n    endPointAndQuadIndexBytes[ndx2 + 3] = quadIndex;\r\n    ndx2 += 4;\r\n  };\r\n\r\n  if (undefined !== polylines) {\r\n    for (const pd of polylines) {\r\n      const num = pd.vertIndices.length - 1;\r\n      for (let i = 0; i < num; ++i) {\r\n        let p0 = pd.vertIndices[i];\r\n        let p1 = pd.vertIndices[i + 1];\r\n        if (p1 < p0) { // swap so that lower index is first.\r\n          p0 = p1;\r\n          p1 = pd.vertIndices[i];\r\n        }\r\n        addPoint(p0, p1, 0);\r\n        addPoint(p1, p0, 2);\r\n        addPoint(p0, p1, 1);\r\n        addPoint(p0, p1, 1);\r\n        addPoint(p1, p0, 2);\r\n        addPoint(p1, p0, 3);\r\n      }\r\n    }\r\n  }\r\n\r\n  if (undefined !== edges) {\r\n    for (const meshEdge of edges) {\r\n      const p0 = meshEdge.indices[0];\r\n      const p1 = meshEdge.indices[1];\r\n      addPoint(p0, p1, 0);\r\n      addPoint(p1, p0, 2);\r\n      addPoint(p0, p1, 1);\r\n      addPoint(p0, p1, 1);\r\n      addPoint(p1, p0, 2);\r\n      addPoint(p1, p0, 3);\r\n    }\r\n  }\r\n\r\n  return {\r\n    indices: new VertexIndices(indexBytes),\r\n    endPointAndQuadIndices: endPointAndQuadIndexBytes,\r\n  };\r\n}\r\n\r\n/**\r\n * A set of line segments representing edges of curved portions of a mesh.\r\n * Each vertex is augmented with a pair of oct-encoded normals used in the shader\r\n * to determine whether or not the edge should be displayed.\r\n * @internal\r\n */\r\nexport interface SilhouetteParams extends SegmentEdgeParams {\r\n  /** Per index, 2 16-bit oct-encoded normals */\r\n  readonly normalPairs: Uint8Array;\r\n}\r\n\r\nfunction convertSilhouettes(edges: MeshEdge[], normalPairs: OctEncodedNormalPair[]): SilhouetteParams | undefined {\r\n  const base = convertPolylinesAndEdges(undefined, edges);\r\n  if (undefined === base)\r\n    return undefined;\r\n\r\n  const normalPairBytes = new Uint8Array(normalPairs.length * 6 * 4);\r\n  const normalPair16 = new Uint16Array(normalPairBytes.buffer);\r\n\r\n  let ndx = 0;\r\n  for (const pair of normalPairs) {\r\n    for (let i = 0; i < 6; i++) {\r\n      normalPair16[ndx++] = pair.first.value;\r\n      normalPair16[ndx++] = pair.second.value;\r\n    }\r\n  }\r\n\r\n  return {\r\n    indices: base.indices,\r\n    endPointAndQuadIndices: base.endPointAndQuadIndices,\r\n    normalPairs: normalPairBytes,\r\n  };\r\n}\r\n\r\n/** A lookup table of edges for a mesh. The table is partitioned such that the lower partition contains simple segment edges\r\n * and the upper partition contains silhouette edges. Each entry in the lower partition consists of 2 24-bit indices into\r\n * a [[VertexTable]] from which to obtain the endpoints of the edge. Each entry in the upper partition consists of 2 24-bit\r\n * vertex indices followed by two 16-bit [[OctEncodedNormal]]s.\r\n * If both partitions exist then one row may exist between them containing a mix of segments and silhouettes; in this case a handful\r\n * of padding bytes may exist between the last segment and the first silhouette.\r\n * @see [[IndexedEdgeParams.edges]].\r\n * @internal\r\n */\r\nexport interface EdgeTable {\r\n  /** The rectangular lookup table. */\r\n  readonly data: Uint8Array;\r\n  /** Width of the table. */\r\n  readonly width: number;\r\n  /** Height of the table. */\r\n  readonly height: number;\r\n  /** The number of segments in the lower partition. */\r\n  readonly numSegments: number;\r\n  /** The number of padding bytes inserted between the partitions to preserve alignment of data. */\r\n  readonly silhouettePadding: number;\r\n}\r\n\r\n/** Describes the edges of a surface as a lookup table. Each edge consists of six identical indices into the lookup table, forming a quad.\r\n * @see [[EdgeParams.indexed]].\r\n * @internal\r\n */\r\nexport interface IndexedEdgeParams {\r\n  /** The indices into [[edges]]. */\r\n  readonly indices: VertexIndices;\r\n  /** The lookup table indexed by [[indices]]. */\r\n  readonly edges: EdgeTable;\r\n}\r\n\r\nfunction buildIndexedEdges(args: MeshArgsEdges, doPolylines: boolean, maxSize: number): IndexedEdgeParams | undefined {\r\n  const hardEdges = args.edges?.edges;\r\n  const silhouettes = args.silhouettes;\r\n  const polylines = doPolylines ? args.polylines?.lines : undefined;\r\n\r\n  const numHardEdges = hardEdges?.length ?? 0;\r\n  const numSilhouettes = silhouettes?.edges?.length ?? 0;\r\n  const numPolylines = polylines ? polylines.reduce((count: number, pd: PolylineData) => count + Math.max(0, pd.vertIndices.length - 1), 0) : 0;\r\n  const numSegmentEdges = numHardEdges + numPolylines;\r\n  const numTotalEdges = numSegmentEdges + numSilhouettes;\r\n  if (numTotalEdges === 0)\r\n    return undefined;\r\n\r\n  // Each edge is a quad consisting of six vertices. Each vertex is an identical 24-bit index into the lookup table.\r\n  const indices = new VertexIndices(new Uint8Array(numTotalEdges * 6 * 3));\r\n  for (let i = 0; i < numTotalEdges; i++)\r\n    for (let j = 0; j < 6; j++)\r\n      indices.setNthIndex(i * 6 + j, i);\r\n\r\n  // Each segment edge requires 2 24-bit indices = 6 bytes = 1.5 RGBA values.\r\n  // Each silhouette requires the same as segment edge plus 2 16-bit oct-encoded normals = 10 bytes = 2.5 RGBA values.\r\n  let nRgbaRequired = Math.ceil(1.5 * numSegmentEdges + 2.5 * numSilhouettes);\r\n  let dimensions;\r\n  const silhouetteStartByteIndex = numSegmentEdges * 6;\r\n  let silhouettePadding = 0;\r\n  if (nRgbaRequired < maxSize) {\r\n    dimensions = { width: nRgbaRequired, height: 1 };\r\n  } else {\r\n    // Make roughly square to reduce unused space in last row.\r\n    let width = Math.ceil(Math.sqrt(nRgbaRequired));\r\n    // Each entry's data must fit on the same row. 15 RGBA = 60 bytes = lowest common multiple of 6, 10, and 4.\r\n    const remainder = width % 15;\r\n    if (0 !== remainder)\r\n      width += 15 - remainder;\r\n\r\n    // If the table contains both segments and silhouettes, there may be one row containing a mix of the two where padding\r\n    // is required between them.\r\n    if (numSilhouettes > 0 && numSegmentEdges > 0) {\r\n      const silOffset = silhouetteStartByteIndex % 60; // some multiple of 6.\r\n      silhouettePadding = (60 - silOffset) % 10;\r\n      nRgbaRequired += Math.ceil(silhouettePadding / 4);\r\n    }\r\n\r\n    let height = Math.ceil(nRgbaRequired / width);\r\n    if (width * height < nRgbaRequired)\r\n      height++;\r\n\r\n    dimensions = { width, height };\r\n  }\r\n\r\n  const data = new Uint8Array(dimensions.width * dimensions.height * 4);\r\n  function setUint24(byteIndex: number, value: number): void {\r\n    data[byteIndex + 0] = value & 0x0000ff;\r\n    data[byteIndex + 1] = (value & 0x00ff00) >>> 8;\r\n    data[byteIndex + 2] = (value & 0xff0000) >>> 16;\r\n  }\r\n\r\n  function setEdge(index: number, startPointIndex: number, endPointIndex: number): void {\r\n    const byteIndex = index * 6;\r\n    setUint24(byteIndex, startPointIndex);\r\n    setUint24(byteIndex + 3, endPointIndex);\r\n  }\r\n\r\n  let curIndex = 0;\r\n  if (hardEdges)\r\n    for (const edge of hardEdges)\r\n      setEdge(curIndex++, edge.indices[0], edge.indices[1]);\r\n\r\n  if (polylines) {\r\n    for (const pd of polylines) {\r\n      const num = pd.vertIndices.length - 1;\r\n      for (let i = 0; i < num; i++) {\r\n        const p0 = pd.vertIndices[i];\r\n        const p1 = pd.vertIndices[i + 1];\r\n        // Ensure lower index is first.\r\n        if (p0 < p1)\r\n          setEdge(curIndex++, p0, p1);\r\n        else\r\n          setEdge(curIndex++, p1, p0);\r\n      }\r\n    }\r\n  }\r\n\r\n  if (silhouettes?.edges) {\r\n    assert(undefined !== silhouettes.normals);\r\n    assert(silhouettes.normals.length === silhouettes.edges.length);\r\n    function setSilhouette(index: number, start: number, end: number, normals: OctEncodedNormalPair): void {\r\n      const byteIndex = silhouetteStartByteIndex + silhouettePadding + index * 10;\r\n      setUint24(byteIndex, start);\r\n      setUint24(byteIndex + 3, end);\r\n      data[byteIndex + 6] = normals.first.value & 0xff;\r\n      data[byteIndex + 7] = (normals.first.value & 0xff00) >>> 8;\r\n      data[byteIndex + 8] = normals.second.value & 0xff;\r\n      data[byteIndex + 9] = (normals.second.value & 0xff00) >>> 8;\r\n    }\r\n\r\n    curIndex = 0;\r\n    for (let i = 0; i < silhouettes.edges.length; i++)\r\n      setSilhouette(curIndex++, silhouettes.edges[i].indices[0], silhouettes.edges[i].indices[1], silhouettes.normals[i]);\r\n  }\r\n\r\n  return {\r\n    indices,\r\n    edges: {\r\n      data,\r\n      width: dimensions.width,\r\n      height: dimensions.height,\r\n      numSegments: numSegmentEdges,\r\n      silhouettePadding,\r\n    },\r\n  };\r\n}\r\n\r\n/** Describes the edges of a mesh. */\r\nexport interface EdgeParams {\r\n  /** The edge width in pixels. */\r\n  readonly weight: number;\r\n  /** The line pattern in which edges are drawn. */\r\n  readonly linePixels: LinePixels;\r\n  /** Simple single-segment edges, always displayed when edge display is enabled. */\r\n  readonly segments?: SegmentEdgeParams;\r\n  /** Single-segment edges of curved surfaces, displayed based on edge normal relative to eye. */\r\n  readonly silhouettes?: SilhouetteParams;\r\n  /** Polyline edges, always displayed when edge display is enabled. */\r\n  readonly polylines?: TesselatedPolyline;\r\n  /** Silhouettes and simple-segment edges, compactly represented as indices into a lookup table. */\r\n  readonly indexed?: IndexedEdgeParams;\r\n}\r\n\r\n/** @internal */\r\nexport namespace EdgeParams {\r\n  export function fromMeshArgs(meshArgs: MeshArgs, maxWidth?: number): EdgeParams | undefined {\r\n    const args = meshArgs.edges;\r\n    const doJoints = wantJointTriangles(args.width, meshArgs.is2d);\r\n    const polylines = doJoints ? TesselatedPolyline.fromMesh(meshArgs) : undefined;\r\n\r\n    let segments: SegmentEdgeParams | undefined;\r\n    let silhouettes: SilhouetteParams | undefined;\r\n    let indexed: IndexedEdgeParams | undefined;\r\n\r\n    if (IModelApp.tileAdmin.enableIndexedEdges) {\r\n      indexed = buildIndexedEdges(args, !doJoints, maxWidth ?? IModelApp.renderSystem.maxTextureSize);\r\n    } else {\r\n      segments = convertPolylinesAndEdges(undefined, args.edges.edges);\r\n      silhouettes = args.silhouettes.edges && args.silhouettes.normals ? convertSilhouettes(args.silhouettes.edges, args.silhouettes.normals) : undefined;\r\n    }\r\n\r\n    if (!segments && !silhouettes && !polylines && !indexed)\r\n      return undefined;\r\n\r\n    return {\r\n      weight: args.width,\r\n      linePixels: args.linePixels,\r\n      segments,\r\n      silhouettes,\r\n      polylines,\r\n      indexed,\r\n    };\r\n  }\r\n}\r\n"]}

package/lib/cjs/render/primitives/PointStringParams.d.ts

@@ -0,0 +1,16 @@
+/** @packageDocumentation
+ * @module Rendering
+ */
+import { PolylineArgs } from "./mesh/MeshPrimitives";
+import { VertexIndices, VertexTable } from "./VertexTable";
+/** Describes point string geometry to be submitted to the rendering system.
+ * @internal
+ */
+export declare class PointStringParams {
+    readonly vertices: VertexTable;
+    readonly indices: VertexIndices;
+    readonly weight: number;
+    constructor(vertices: VertexTable, indices: VertexIndices, weight: number);
+    static create(args: PolylineArgs): PointStringParams | undefined;
+}
+//# sourceMappingURL=PointStringParams.d.ts.map

package/lib/cjs/render/primitives/PointStringParams.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"PointStringParams.d.ts","sourceRoot":"","sources":["../../../../src/render/primitives/PointStringParams.ts"],"names":[],"mappings":"AAIA;;GAEG;AAGH,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAAE,aAAa,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAE3D;;GAEG;AACH,qBAAa,iBAAiB;IAC5B,SAAgB,QAAQ,EAAE,WAAW,CAAC;IACtC,SAAgB,OAAO,EAAE,aAAa,CAAC;IACvC,SAAgB,MAAM,EAAE,MAAM,CAAC;gBAEZ,QAAQ,EAAE,WAAW,EAAE,OAAO,EAAE,aAAa,EAAE,MAAM,EAAE,MAAM;WAMlE,MAAM,CAAC,IAAI,EAAE,YAAY,GAAG,iBAAiB,GAAG,SAAS;CAuBxE"}

package/lib/cjs/render/primitives/PointStringParams.js

@@ -0,0 +1,43 @@
+"use strict";
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module Rendering
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PointStringParams = void 0;
+const core_bentley_1 = require("@itwin/core-bentley");
+const VertexTable_1 = require("./VertexTable");
+/** Describes point string geometry to be submitted to the rendering system.
+ * @internal
+ */
+class PointStringParams {
+    constructor(vertices, indices, weight) {
+        this.vertices = vertices;
+        this.indices = indices;
+        this.weight = weight;
+    }
+    static create(args) {
+        if (!args.flags.isDisjoint)
+            return undefined;
+        const vertices = VertexTable_1.VertexTable.createForPolylines(args);
+        if (undefined === vertices)
+            return undefined;
+        const polylines = args.polylines;
+        let vertIndices = polylines[0].vertIndices;
+        if (1 < polylines.length) {
+            // We used to assert this wouldn't happen - apparently it does...
+            vertIndices = [];
+            for (const polyline of polylines)
+                for (const vertIndex of polyline.vertIndices)
+                    vertIndices.push(vertIndex);
+        }
+        const vertexIndices = VertexTable_1.VertexIndices.fromArray(vertIndices);
+        (0, core_bentley_1.assert)(vertexIndices.length === vertIndices.length);
+        return new PointStringParams(vertices, vertexIndices, args.width);
+    }
+}
+exports.PointStringParams = PointStringParams;
+//# sourceMappingURL=PointStringParams.js.map

package/lib/cjs/render/primitives/PointStringParams.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PointStringParams.js","sourceRoot":"","sources":["../../../../src/render/primitives/PointStringParams.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,sDAA6C;AAE7C,+CAA2D;AAE3D;;GAEG;AACH,MAAa,iBAAiB;IAK5B,YAAmB,QAAqB,EAAE,OAAsB,EAAE,MAAc;QAC9E,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;IAEM,MAAM,CAAC,MAAM,CAAC,IAAkB;QACrC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU;YACxB,OAAO,SAAS,CAAC;QAEnB,MAAM,QAAQ,GAAG,yBAAW,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC;QACtD,IAAI,SAAS,KAAK,QAAQ;YACxB,OAAO,SAAS,CAAC;QAEnB,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;QACjC,IAAI,WAAW,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC;QAC3C,IAAI,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE;YACxB,iEAAiE;YACjE,WAAW,GAAG,EAAE,CAAC;YACjB,KAAK,MAAM,QAAQ,IAAI,SAAS;gBAC9B,KAAK,MAAM,SAAS,IAAI,QAAQ,CAAC,WAAW;oBAC1C,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;SACjC;QAED,MAAM,aAAa,GAAG,2BAAa,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;QAC3D,IAAA,qBAAM,EAAC,aAAa,CAAC,MAAM,KAAK,WAAW,CAAC,MAAM,CAAC,CAAC;QAEpD,OAAO,IAAI,iBAAiB,CAAC,QAAQ,EAAE,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IACpE,CAAC;CACF;AAlCD,8CAkCC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Rendering\r\n */\r\n\r\nimport { assert } from \"@itwin/core-bentley\";\r\nimport { PolylineArgs } from \"./mesh/MeshPrimitives\";\r\nimport { VertexIndices, VertexTable } from \"./VertexTable\";\r\n\r\n/** Describes point string geometry to be submitted to the rendering system.\r\n * @internal\r\n */\r\nexport class PointStringParams {\r\n  public readonly vertices: VertexTable;\r\n  public readonly indices: VertexIndices;\r\n  public readonly weight: number;\r\n\r\n  public constructor(vertices: VertexTable, indices: VertexIndices, weight: number) {\r\n    this.vertices = vertices;\r\n    this.indices = indices;\r\n    this.weight = weight;\r\n  }\r\n\r\n  public static create(args: PolylineArgs): PointStringParams | undefined {\r\n    if (!args.flags.isDisjoint)\r\n      return undefined;\r\n\r\n    const vertices = VertexTable.createForPolylines(args);\r\n    if (undefined === vertices)\r\n      return undefined;\r\n\r\n    const polylines = args.polylines;\r\n    let vertIndices = polylines[0].vertIndices;\r\n    if (1 < polylines.length) {\r\n      // We used to assert this wouldn't happen - apparently it does...\r\n      vertIndices = [];\r\n      for (const polyline of polylines)\r\n        for (const vertIndex of polyline.vertIndices)\r\n          vertIndices.push(vertIndex);\r\n    }\r\n\r\n    const vertexIndices = VertexIndices.fromArray(vertIndices);\r\n    assert(vertexIndices.length === vertIndices.length);\r\n\r\n    return new PointStringParams(vertices, vertexIndices, args.width);\r\n  }\r\n}\r\n"]}

package/lib/cjs/render/primitives/PolylineParams.d.ts

@@ -0,0 +1,44 @@
+/** @packageDocumentation
+ * @module Rendering
+ */
+import { LinePixels, PolylineData, PolylineTypeFlags, QPoint3dList } from "@itwin/core-common";
+import { MeshArgs, PolylineArgs } from "./mesh/MeshPrimitives";
+import { VertexIndices, VertexTable } from "./VertexTable";
+/**
+ * Represents a tesselated polyline.
+ * Given a polyline as a line string, each segment of the line string is triangulated into a quad.
+ * Based on the angle between two segments, additional joint triangles may be inserted in between to enable smoothly-rounded corners.
+ * @internal
+ */
+export interface TesselatedPolyline {
+    /** 24-bit index of each vertex. */
+    readonly indices: VertexIndices;
+    /** 24-bit index of the previous vertex in the polyline. */
+    readonly prevIndices: VertexIndices;
+    /** 24-bit index of the next vertex in the polyline, plus 8-bit parameter describing the semantics of this vertex. */
+    readonly nextIndicesAndParams: Uint8Array;
+}
+export declare namespace TesselatedPolyline {
+    function fromMesh(args: MeshArgs): TesselatedPolyline | undefined;
+}
+/** Strictly for tests. @internal */
+export declare function tesselatePolyline(polylines: PolylineData[], points: QPoint3dList, doJointTriangles: boolean): TesselatedPolyline;
+/**
+ * Describes a set of tesselated polylines.
+ * Each segment of each polyline is triangulated into a quad. Additional triangles may be inserted
+ * between segments to enable rounded corners.
+ */
+export declare class PolylineParams {
+    readonly vertices: VertexTable;
+    readonly polyline: TesselatedPolyline;
+    readonly isPlanar: boolean;
+    readonly type: PolylineTypeFlags;
+    readonly weight: number;
+    readonly linePixels: LinePixels;
+    /** Directly construct a PolylineParams. The PolylineParams takes ownership of all input data. */
+    constructor(vertices: VertexTable, polyline: TesselatedPolyline, weight: number, linePixels: LinePixels, isPlanar: boolean, type?: PolylineTypeFlags);
+    /** Construct from an PolylineArgs. */
+    static create(args: PolylineArgs): PolylineParams | undefined;
+}
+export declare function wantJointTriangles(weight: number, is2d: boolean): boolean;
+//# sourceMappingURL=PolylineParams.d.ts.map

package/lib/cjs/render/primitives/PolylineParams.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"PolylineParams.d.ts","sourceRoot":"","sources":["../../../../src/render/primitives/PolylineParams.ts"],"names":[],"mappings":"AAIA;;GAEG;AAIH,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,iBAAiB,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAC/F,OAAO,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAC/D,OAAO,EAAE,aAAa,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAc3D;;;;;GAKG;AACH,MAAM,WAAW,kBAAkB;IACjC,mCAAmC;IACnC,QAAQ,CAAC,OAAO,EAAE,aAAa,CAAC;IAChC,2DAA2D;IAC3D,QAAQ,CAAC,WAAW,EAAE,aAAa,CAAC;IACpC,qHAAqH;IACrH,QAAQ,CAAC,oBAAoB,EAAE,UAAU,CAAC;CAC3C;AAED,yBAAiB,kBAAkB,CAAC;IAClC,SAAgB,QAAQ,CAAC,IAAI,EAAE,QAAQ,GAAG,kBAAkB,GAAG,SAAS,CAGvE;CACF;AA8KD,oCAAoC;AACpC,wBAAgB,iBAAiB,CAAC,SAAS,EAAE,YAAY,EAAE,EAAE,MAAM,EAAE,YAAY,EAAE,gBAAgB,EAAE,OAAO,GAAG,kBAAkB,CAGhI;AAED;;;;GAIG;AACH,qBAAa,cAAc;IACzB,SAAgB,QAAQ,EAAE,WAAW,CAAC;IACtC,SAAgB,QAAQ,EAAE,kBAAkB,CAAC;IAC7C,SAAgB,QAAQ,EAAE,OAAO,CAAC;IAClC,SAAgB,IAAI,EAAE,iBAAiB,CAAC;IACxC,SAAgB,MAAM,EAAE,MAAM,CAAC;IAC/B,SAAgB,UAAU,EAAE,UAAU,CAAC;IAEvC,iGAAiG;gBAC9E,QAAQ,EAAE,WAAW,EAAE,QAAQ,EAAE,kBAAkB,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,UAAU,EAAE,QAAQ,EAAE,OAAO,EAAE,IAAI,GAAE,iBAA4C;IASrL,sCAAsC;WACxB,MAAM,CAAC,IAAI,EAAE,YAAY,GAAG,cAAc,GAAG,SAAS;CAYrE;AAED,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,GAAG,OAAO,CAIzE"}

package/lib/cjs/render/primitives/PolylineParams.js

@@ -0,0 +1,205 @@
+"use strict";
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module Rendering
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.wantJointTriangles = exports.PolylineParams = exports.tesselatePolyline = exports.TesselatedPolyline = void 0;
+const core_bentley_1 = require("@itwin/core-bentley");
+const core_geometry_1 = require("@itwin/core-geometry");
+const core_common_1 = require("@itwin/core-common");
+const VertexTable_1 = require("./VertexTable");
+var TesselatedPolyline;
+(function (TesselatedPolyline) {
+    function fromMesh(args) {
+        const tesselator = PolylineTesselator.fromMesh(args);
+        return tesselator === null || tesselator === void 0 ? void 0 : tesselator.tesselate();
+    }
+    TesselatedPolyline.fromMesh = fromMesh;
+})(TesselatedPolyline = exports.TesselatedPolyline || (exports.TesselatedPolyline = {}));
+class PolylineVertex {
+    constructor() {
+        this.isSegmentStart = false;
+        this.isPolylineStartOrEnd = false;
+        this.vertexIndex = 0;
+        this.prevIndex = 0;
+        this.nextIndex = 0;
+    }
+    init(isSegmentStart, isPolylineStartOrEnd, vertexIndex, prevIndex, nextIndex) {
+        this.isSegmentStart = isSegmentStart;
+        this.isPolylineStartOrEnd = isPolylineStartOrEnd;
+        this.vertexIndex = vertexIndex;
+        this.prevIndex = prevIndex;
+        this.nextIndex = nextIndex;
+    }
+    computeParam(negatePerp, adjacentToJoint = false, joint = false, noDisplacement = false) {
+        if (joint)
+            return 12 /* kJointBase */;
+        let param;
+        if (noDisplacement)
+            param = 96 /* kNoneAdjustWeight */; // prevent getting tossed before width adjustment
+        else if (adjacentToJoint)
+            param = 9 /* kMiterInsideOnly */;
+        else
+            param = this.isPolylineStartOrEnd ? 3 /* kSquare */ : 6 /* kMiter */;
+        let adjust = 0;
+        if (negatePerp)
+            adjust = 24 /* kNegatePerp */;
+        if (!this.isSegmentStart)
+            adjust += 48 /* kNegateAlong */;
+        return param + adjust;
+    }
+}
+class PolylineTesselator {
+    constructor(polylines, points, doJointTriangles) {
+        this._numIndices = 0;
+        this._vertIndex = [];
+        this._prevIndex = [];
+        this._nextIndex = [];
+        this._nextParam = [];
+        this._position = [];
+        this._polylines = polylines;
+        this._points = points;
+        this._doJoints = doJointTriangles;
+    }
+    static fromPolyline(args) {
+        return new PolylineTesselator(args.polylines, args.points, wantJointTriangles(args.width, args.flags.is2d));
+    }
+    static fromMesh(args) {
+        if (undefined !== args.edges.polylines.lines && undefined !== args.points)
+            return new PolylineTesselator(args.edges.polylines.lines, args.points, wantJointTriangles(args.edges.width, args.is2d));
+        return undefined;
+    }
+    tesselate() {
+        for (const p of this._points.list)
+            this._position.push(p.unquantize(this._points.params));
+        this._tesselate();
+        const vertIndex = VertexTable_1.VertexIndices.fromArray(this._vertIndex);
+        const prevIndex = VertexTable_1.VertexIndices.fromArray(this._prevIndex);
+        const nextIndexAndParam = new Uint8Array(this._numIndices * 4);
+        for (let i = 0; i < this._numIndices; i++) {
+            const index = this._nextIndex[i];
+            const j = i * 4;
+            VertexTable_1.VertexIndices.encodeIndex(index, nextIndexAndParam, j);
+            nextIndexAndParam[j + 3] = this._nextParam[i] & 0x000000ff;
+        }
+        return {
+            indices: vertIndex,
+            prevIndices: prevIndex,
+            nextIndicesAndParams: nextIndexAndParam,
+        };
+    }
+    _tesselate() {
+        const v0 = new PolylineVertex(), v1 = new PolylineVertex();
+        const maxJointDot = -0.7;
+        for (const line of this._polylines) {
+            if (line.numIndices < 2)
+                continue;
+            const last = line.numIndices - 1;
+            const isClosed = line.vertIndices[0] === line.vertIndices[last];
+            for (let i = 0; i < last; ++i) {
+                const idx0 = line.vertIndices[i];
+                const idx1 = line.vertIndices[i + 1];
+                const isStart = (0 === i);
+                const isEnd = (last - 1 === i);
+                const prevIdx0 = isStart ? (isClosed ? line.vertIndices[last - 1] : idx0) : line.vertIndices[i - 1];
+                const nextIdx1 = isEnd ? (isClosed ? line.vertIndices[1] : idx1) : line.vertIndices[i + 2];
+                v0.init(true, isStart && !isClosed, idx0, prevIdx0, idx1);
+                v1.init(false, isEnd && !isClosed, idx1, nextIdx1, idx0);
+                const jointAt0 = this._doJoints && (isClosed || !isStart) && this._dotProduct(v0) > maxJointDot;
+                const jointAt1 = this._doJoints && (isClosed || !isEnd) && this._dotProduct(v1) > maxJointDot;
+                if (jointAt0 || jointAt1) {
+                    this._addVertex(v0, v0.computeParam(true, jointAt0, false, false));
+                    this._addVertex(v1, v1.computeParam(false, jointAt1, false, false));
+                    this._addVertex(v0, v0.computeParam(false, jointAt0, false, true));
+                    this._addVertex(v0, v0.computeParam(false, jointAt0, false, true));
+                    this._addVertex(v1, v1.computeParam(false, jointAt1, false, false));
+                    this._addVertex(v1, v1.computeParam(false, jointAt1, false, true));
+                    this._addVertex(v0, v0.computeParam(false, jointAt0, false, true));
+                    this._addVertex(v1, v1.computeParam(false, jointAt1, false, true));
+                    this._addVertex(v0, v0.computeParam(false, jointAt0, false, false));
+                    this._addVertex(v0, v0.computeParam(false, jointAt0, false, false));
+                    this._addVertex(v1, v1.computeParam(false, jointAt1, false, true));
+                    this._addVertex(v1, v1.computeParam(true, jointAt1, false, false));
+                    if (jointAt0)
+                        this.addJointTriangles(v0, v0.computeParam(false, true, false, true), v0);
+                    if (jointAt1)
+                        this.addJointTriangles(v1, v1.computeParam(false, true, false, true), v1);
+                }
+                else {
+                    this._addVertex(v0, v0.computeParam(true));
+                    this._addVertex(v1, v1.computeParam(false));
+                    this._addVertex(v0, v0.computeParam(false));
+                    this._addVertex(v0, v0.computeParam(false));
+                    this._addVertex(v1, v1.computeParam(false));
+                    this._addVertex(v1, v1.computeParam(true));
+                }
+            }
+        }
+    }
+    addJointTriangles(v0, p0, v1) {
+        const param = v1.computeParam(false, false, true);
+        for (let i = 0; i < 3; i++) {
+            this._addVertex(v0, p0);
+            this._addVertex(v1, param + i + 1);
+            this._addVertex(v1, param + i);
+        }
+    }
+    _dotProduct(v) {
+        const pos = this._position[v.vertexIndex];
+        const prevDir = core_geometry_1.Vector3d.createStartEnd(this._position[v.prevIndex], pos);
+        const nextDir = core_geometry_1.Vector3d.createStartEnd(this._position[v.nextIndex], pos);
+        return prevDir.dotProduct(nextDir);
+    }
+    _addVertex(vertex, param) {
+        this._vertIndex[this._numIndices] = vertex.vertexIndex;
+        this._prevIndex[this._numIndices] = vertex.prevIndex;
+        this._nextIndex[this._numIndices] = vertex.nextIndex;
+        this._nextParam[this._numIndices] = param;
+        this._numIndices++;
+    }
+}
+/** Strictly for tests. @internal */
+function tesselatePolyline(polylines, points, doJointTriangles) {
+    const tesselator = new PolylineTesselator(polylines, points, doJointTriangles);
+    return tesselator.tesselate();
+}
+exports.tesselatePolyline = tesselatePolyline;
+/**
+ * Describes a set of tesselated polylines.
+ * Each segment of each polyline is triangulated into a quad. Additional triangles may be inserted
+ * between segments to enable rounded corners.
+ */
+class PolylineParams {
+    /** Directly construct a PolylineParams. The PolylineParams takes ownership of all input data. */
+    constructor(vertices, polyline, weight, linePixels, isPlanar, type = core_common_1.PolylineTypeFlags.Normal) {
+        this.vertices = vertices;
+        this.polyline = polyline;
+        this.isPlanar = isPlanar;
+        this.weight = weight;
+        this.linePixels = linePixels;
+        this.type = type;
+    }
+    /** Construct from an PolylineArgs. */
+    static create(args) {
+        (0, core_bentley_1.assert)(!args.flags.isDisjoint);
+        const vertices = VertexTable_1.VertexTable.createForPolylines(args);
+        if (undefined === vertices)
+            return undefined;
+        const tesselator = PolylineTesselator.fromPolyline(args);
+        if (undefined === tesselator)
+            return undefined;
+        return new PolylineParams(vertices, tesselator.tesselate(), args.width, args.linePixels, args.flags.isPlanar, args.flags.type);
+    }
+}
+exports.PolylineParams = PolylineParams;
+function wantJointTriangles(weight, is2d) {
+    // Joints are incredibly expensive. In 3d, only generate them if the line is sufficiently wide for them to be noticeable.
+    const jointWidthThreshold = 3;
+    return is2d || weight >= jointWidthThreshold;
+}
+exports.wantJointTriangles = wantJointTriangles;
+//# sourceMappingURL=PolylineParams.js.map

package/lib/cjs/render/primitives/PolylineParams.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PolylineParams.js","sourceRoot":"","sources":["../../../../src/render/primitives/PolylineParams.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,sDAA6C;AAC7C,wDAAyD;AACzD,oDAA+F;AAE/F,+CAA2D;AA6B3D,IAAiB,kBAAkB,CAKlC;AALD,WAAiB,kBAAkB;IACjC,SAAgB,QAAQ,CAAC,IAAc;QACrC,MAAM,UAAU,GAAG,kBAAkB,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACrD,OAAO,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,SAAS,EAAE,CAAC;IACjC,CAAC;IAHe,2BAAQ,WAGvB,CAAA;AACH,CAAC,EALgB,kBAAkB,GAAlB,0BAAkB,KAAlB,0BAAkB,QAKlC;AAED,MAAM,cAAc;IAOlB;QANO,mBAAc,GAAY,KAAK,CAAC;QAChC,yBAAoB,GAAY,KAAK,CAAC;QACtC,gBAAW,GAAW,CAAC,CAAC;QACxB,cAAS,GAAW,CAAC,CAAC;QACtB,cAAS,GAAW,CAAC,CAAC;IAEN,CAAC;IAEjB,IAAI,CAAC,cAAuB,EAAE,oBAA6B,EAAE,WAAmB,EAAE,SAAiB,EAAE,SAAiB;QAC3H,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,IAAI,CAAC,oBAAoB,GAAG,oBAAoB,CAAC;QACjD,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAC7B,CAAC;IAEM,YAAY,CAAC,UAAmB,EAAE,kBAA2B,KAAK,EAAE,QAAiB,KAAK,EAAE,iBAA0B,KAAK;QAChI,IAAI,KAAK;YACP,2BAAgC;QAElC,IAAI,KAAoB,CAAC;QACzB,IAAI,cAAc;YAChB,KAAK,6BAAkC,CAAC,CAAC,iDAAiD;aACvF,IAAI,eAAe;YACtB,KAAK,2BAAiC,CAAC;;YAEvC,KAAK,GAAG,IAAI,CAAC,oBAAoB,CAAC,CAAC,iBAAuB,CAAC,eAAqB,CAAC;QAEnF,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,UAAU;YACZ,MAAM,uBAA4B,CAAC;QACrC,IAAI,CAAC,IAAI,CAAC,cAAc;YACtB,MAAM,yBAA8B,CAAC;QAEvC,OAAO,KAAK,GAAG,MAAM,CAAC;IACxB,CAAC;CACF;AAED,MAAM,kBAAkB;IAWtB,YAAmB,SAAyB,EAAE,MAAoB,EAAE,gBAAyB;QAPrF,gBAAW,GAAG,CAAC,CAAC;QAChB,eAAU,GAAa,EAAE,CAAC;QAC1B,eAAU,GAAa,EAAE,CAAC;QAC1B,eAAU,GAAa,EAAE,CAAC;QAC1B,eAAU,GAAa,EAAE,CAAC;QAC1B,cAAS,GAAc,EAAE,CAAC;QAGhC,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;QACtB,IAAI,CAAC,SAAS,GAAG,gBAAgB,CAAC;IACpC,CAAC;IAEM,MAAM,CAAC,YAAY,CAAC,IAAkB;QAC3C,OAAO,IAAI,kBAAkB,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,MAAM,EAAE,kBAAkB,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;IAC9G,CAAC;IAEM,MAAM,CAAC,QAAQ,CAAC,IAAc;QACnC,IAAI,SAAS,KAAK,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,KAAK,IAAI,SAAS,KAAK,IAAI,CAAC,MAAM;YACvE,OAAO,IAAI,kBAAkB,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,kBAAkB,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAE1H,OAAO,SAAS,CAAC;IACnB,CAAC;IAEM,SAAS;QACd,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI;YAC/B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;QAEzD,IAAI,CAAC,UAAU,EAAE,CAAC;QAElB,MAAM,SAAS,GAAG,2BAAa,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC3D,MAAM,SAAS,GAAG,2BAAa,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAE3D,MAAM,iBAAiB,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC;QAC/D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,EAAE;YACzC,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAChB,2BAAa,CAAC,WAAW,CAAC,KAAK,EAAE,iBAAiB,EAAE,CAAC,CAAC,CAAC;YACvD,iBAAiB,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;SAC5D;QAED,OAAO;YACL,OAAO,EAAE,SAAS;YAClB,WAAW,EAAE,SAAS;YACtB,oBAAoB,EAAE,iBAAiB;SACxC,CAAC;IACJ,CAAC;IAEO,UAAU;QAChB,MAAM,EAAE,GAAG,IAAI,cAAc,EAAE,EAAE,EAAE,GAAG,IAAI,cAAc,EAAE,CAAC;QAC3D,MAAM,WAAW,GAAG,CAAC,GAAG,CAAC;QAEzB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,UAAU,EAAE;YAClC,IAAI,IAAI,CAAC,UAAU,GAAG,CAAC;gBACrB,SAAS;YAEX,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;YACjC,MAAM,QAAQ,GAAY,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YAEzE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,EAAE,CAAC,EAAE;gBAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBACjC,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACrC,MAAM,OAAO,GAAY,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;gBACnC,MAAM,KAAK,GAAY,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;gBACxC,MAAM,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACpG,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAE3F,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,IAAI,CAAC,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;gBAC1D,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,IAAI,CAAC,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;gBAEzD,MAAM,QAAQ,GAAY,IAAI,CAAC,SAAS,IAAI,CAAC,QAAQ,IAAI,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC;gBACzG,MAAM,QAAQ,GAAY,IAAI,CAAC,SAAS,IAAI,CAAC,QAAQ,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC;gBAEvG,IAAI,QAAQ,IAAI,QAAQ,EAAE;oBACxB,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;oBACnE,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,YAAY,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;oBACpE,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,YAAY,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;oBACnE,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,YAAY,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;oBACnE,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,YAAY,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;oBACpE,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,YAAY,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;oBACnE,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,YAAY,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;oBACnE,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,YAAY,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;oBACnE,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,YAAY,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;oBACpE,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,YAAY,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;oBACpE,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,YAAY,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;oBACnE,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;oBAEnE,IAAI,QAAQ;wBACV,IAAI,CAAC,iBAAiB,CAAC,EAAE,EAAE,EAAE,CAAC,YAAY,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;oBAE5E,IAAI,QAAQ;wBACV,IAAI,CAAC,iBAAiB,CAAC,EAAE,EAAE,EAAE,CAAC,YAAY,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;iBAC7E;qBAAM;oBACL,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC;oBAC3C,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;oBAC5C,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;oBAC5C,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;oBAC5C,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;oBAC5C,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC;iBAC5C;aACF;SACF;IACH,CAAC;IAEO,iBAAiB,CAAC,EAAkB,EAAE,EAAU,EAAE,EAAkB;QAC1E,MAAM,KAAK,GAAG,EAAE,CAAC,YAAY,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACxB,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YACnC,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;SAChC;IACH,CAAC;IAEO,WAAW,CAAC,CAAiB;QACnC,MAAM,GAAG,GAAY,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;QACnD,MAAM,OAAO,GAAa,wBAAQ,CAAC,cAAc,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,GAAG,CAAC,CAAC;QACpF,MAAM,OAAO,GAAa,wBAAQ,CAAC,cAAc,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,GAAG,CAAC,CAAC;QACpF,OAAO,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;IACrC,CAAC;IAEO,UAAU,CAAC,MAAsB,EAAE,KAAa;QACtD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,MAAM,CAAC,WAAW,CAAC;QACvD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC;QACrD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC;QACrD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,KAAK,CAAC;QAC1C,IAAI,CAAC,WAAW,EAAE,CAAC;IACrB,CAAC;CACF;AAED,oCAAoC;AACpC,SAAgB,iBAAiB,CAAC,SAAyB,EAAE,MAAoB,EAAE,gBAAyB;IAC1G,MAAM,UAAU,GAAG,IAAI,kBAAkB,CAAC,SAAS,EAAE,MAAM,EAAE,gBAAgB,CAAC,CAAC;IAC/E,OAAO,UAAU,CAAC,SAAS,EAAE,CAAC;AAChC,CAAC;AAHD,8CAGC;AAED;;;;GAIG;AACH,MAAa,cAAc;IAQzB,iGAAiG;IACjG,YAAmB,QAAqB,EAAE,QAA4B,EAAE,MAAc,EAAE,UAAsB,EAAE,QAAiB,EAAE,OAA0B,+BAAiB,CAAC,MAAM;QACnL,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;IAED,sCAAsC;IAC/B,MAAM,CAAC,MAAM,CAAC,IAAkB;QACrC,IAAA,qBAAM,EAAC,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QAC/B,MAAM,QAAQ,GAAG,yBAAW,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC;QACtD,IAAI,SAAS,KAAK,QAAQ;YACxB,OAAO,SAAS,CAAC;QAEnB,MAAM,UAAU,GAAG,kBAAkB,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QACzD,IAAI,SAAS,KAAK,UAAU;YAC1B,OAAO,SAAS,CAAC;QAEnB,OAAO,IAAI,cAAc,CAAC,QAAQ,EAAE,UAAU,CAAC,SAAS,EAAE,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACjI,CAAC;CACF;AA/BD,wCA+BC;AAED,SAAgB,kBAAkB,CAAC,MAAc,EAAE,IAAa;IAC9D,yHAAyH;IACzH,MAAM,mBAAmB,GAAG,CAAC,CAAC;IAC9B,OAAO,IAAI,IAAI,MAAM,IAAI,mBAAmB,CAAC;AAC/C,CAAC;AAJD,gDAIC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Rendering\r\n */\r\n\r\nimport { assert } from \"@itwin/core-bentley\";\r\nimport { Point3d, Vector3d } from \"@itwin/core-geometry\";\r\nimport { LinePixels, PolylineData, PolylineTypeFlags, QPoint3dList } from \"@itwin/core-common\";\r\nimport { MeshArgs, PolylineArgs } from \"./mesh/MeshPrimitives\";\r\nimport { VertexIndices, VertexTable } from \"./VertexTable\";\r\n\r\n/** Parameter associated with each vertex index of a tesselated polyline. */\r\nconst enum PolylineParam { // eslint-disable-line no-restricted-syntax\r\n  kNone = 0,\r\n  kSquare = 1 * 3,\r\n  kMiter = 2 * 3,\r\n  kMiterInsideOnly = 3 * 3,\r\n  kJointBase = 4 * 3,\r\n  kNegatePerp = 8 * 3,\r\n  kNegateAlong = 16 * 3,\r\n  kNoneAdjustWeight = 32 * 3,\r\n}\r\n\r\n/**\r\n * Represents a tesselated polyline.\r\n * Given a polyline as a line string, each segment of the line string is triangulated into a quad.\r\n * Based on the angle between two segments, additional joint triangles may be inserted in between to enable smoothly-rounded corners.\r\n * @internal\r\n */\r\nexport interface TesselatedPolyline {\r\n  /** 24-bit index of each vertex. */\r\n  readonly indices: VertexIndices;\r\n  /** 24-bit index of the previous vertex in the polyline. */\r\n  readonly prevIndices: VertexIndices;\r\n  /** 24-bit index of the next vertex in the polyline, plus 8-bit parameter describing the semantics of this vertex. */\r\n  readonly nextIndicesAndParams: Uint8Array;\r\n}\r\n\r\nexport namespace TesselatedPolyline {\r\n  export function fromMesh(args: MeshArgs): TesselatedPolyline | undefined {\r\n    const tesselator = PolylineTesselator.fromMesh(args);\r\n    return tesselator?.tesselate();\r\n  }\r\n}\r\n\r\nclass PolylineVertex {\r\n  public isSegmentStart: boolean = false;\r\n  public isPolylineStartOrEnd: boolean = false;\r\n  public vertexIndex: number = 0;\r\n  public prevIndex: number = 0;\r\n  public nextIndex: number = 0;\r\n\r\n  public constructor() { }\r\n\r\n  public init(isSegmentStart: boolean, isPolylineStartOrEnd: boolean, vertexIndex: number, prevIndex: number, nextIndex: number) {\r\n    this.isSegmentStart = isSegmentStart;\r\n    this.isPolylineStartOrEnd = isPolylineStartOrEnd;\r\n    this.vertexIndex = vertexIndex;\r\n    this.prevIndex = prevIndex;\r\n    this.nextIndex = nextIndex;\r\n  }\r\n\r\n  public computeParam(negatePerp: boolean, adjacentToJoint: boolean = false, joint: boolean = false, noDisplacement: boolean = false): number {\r\n    if (joint)\r\n      return PolylineParam.kJointBase;\r\n\r\n    let param: PolylineParam;\r\n    if (noDisplacement)\r\n      param = PolylineParam.kNoneAdjustWeight; // prevent getting tossed before width adjustment\r\n    else if (adjacentToJoint)\r\n      param = PolylineParam.kMiterInsideOnly;\r\n    else\r\n      param = this.isPolylineStartOrEnd ? PolylineParam.kSquare : PolylineParam.kMiter;\r\n\r\n    let adjust = 0;\r\n    if (negatePerp)\r\n      adjust = PolylineParam.kNegatePerp;\r\n    if (!this.isSegmentStart)\r\n      adjust += PolylineParam.kNegateAlong;\r\n\r\n    return param + adjust;\r\n  }\r\n}\r\n\r\nclass PolylineTesselator {\r\n  private _polylines: PolylineData[];\r\n  private _points: QPoint3dList;\r\n  private _doJoints: boolean;\r\n  private _numIndices = 0;\r\n  private _vertIndex: number[] = [];\r\n  private _prevIndex: number[] = [];\r\n  private _nextIndex: number[] = [];\r\n  private _nextParam: number[] = [];\r\n  private _position: Point3d[] = [];\r\n\r\n  public constructor(polylines: PolylineData[], points: QPoint3dList, doJointTriangles: boolean) {\r\n    this._polylines = polylines;\r\n    this._points = points;\r\n    this._doJoints = doJointTriangles;\r\n  }\r\n\r\n  public static fromPolyline(args: PolylineArgs): PolylineTesselator {\r\n    return new PolylineTesselator(args.polylines, args.points, wantJointTriangles(args.width, args.flags.is2d));\r\n  }\r\n\r\n  public static fromMesh(args: MeshArgs): PolylineTesselator | undefined {\r\n    if (undefined !== args.edges.polylines.lines && undefined !== args.points)\r\n      return new PolylineTesselator(args.edges.polylines.lines, args.points, wantJointTriangles(args.edges.width, args.is2d));\r\n\r\n    return undefined;\r\n  }\r\n\r\n  public tesselate(): TesselatedPolyline {\r\n    for (const p of this._points.list)\r\n      this._position.push(p.unquantize(this._points.params));\r\n\r\n    this._tesselate();\r\n\r\n    const vertIndex = VertexIndices.fromArray(this._vertIndex);\r\n    const prevIndex = VertexIndices.fromArray(this._prevIndex);\r\n\r\n    const nextIndexAndParam = new Uint8Array(this._numIndices * 4);\r\n    for (let i = 0; i < this._numIndices; i++) {\r\n      const index = this._nextIndex[i];\r\n      const j = i * 4;\r\n      VertexIndices.encodeIndex(index, nextIndexAndParam, j);\r\n      nextIndexAndParam[j + 3] = this._nextParam[i] & 0x000000ff;\r\n    }\r\n\r\n    return {\r\n      indices: vertIndex,\r\n      prevIndices: prevIndex,\r\n      nextIndicesAndParams: nextIndexAndParam,\r\n    };\r\n  }\r\n\r\n  private _tesselate() {\r\n    const v0 = new PolylineVertex(), v1 = new PolylineVertex();\r\n    const maxJointDot = -0.7;\r\n\r\n    for (const line of this._polylines) {\r\n      if (line.numIndices < 2)\r\n        continue;\r\n\r\n      const last = line.numIndices - 1;\r\n      const isClosed: boolean = line.vertIndices[0] === line.vertIndices[last];\r\n\r\n      for (let i = 0; i < last; ++i) {\r\n        const idx0 = line.vertIndices[i];\r\n        const idx1 = line.vertIndices[i + 1];\r\n        const isStart: boolean = (0 === i);\r\n        const isEnd: boolean = (last - 1 === i);\r\n        const prevIdx0 = isStart ? (isClosed ? line.vertIndices[last - 1] : idx0) : line.vertIndices[i - 1];\r\n        const nextIdx1 = isEnd ? (isClosed ? line.vertIndices[1] : idx1) : line.vertIndices[i + 2];\r\n\r\n        v0.init(true, isStart && !isClosed, idx0, prevIdx0, idx1);\r\n        v1.init(false, isEnd && !isClosed, idx1, nextIdx1, idx0);\r\n\r\n        const jointAt0: boolean = this._doJoints && (isClosed || !isStart) && this._dotProduct(v0) > maxJointDot;\r\n        const jointAt1: boolean = this._doJoints && (isClosed || !isEnd) && this._dotProduct(v1) > maxJointDot;\r\n\r\n        if (jointAt0 || jointAt1) {\r\n          this._addVertex(v0, v0.computeParam(true, jointAt0, false, false));\r\n          this._addVertex(v1, v1.computeParam(false, jointAt1, false, false));\r\n          this._addVertex(v0, v0.computeParam(false, jointAt0, false, true));\r\n          this._addVertex(v0, v0.computeParam(false, jointAt0, false, true));\r\n          this._addVertex(v1, v1.computeParam(false, jointAt1, false, false));\r\n          this._addVertex(v1, v1.computeParam(false, jointAt1, false, true));\r\n          this._addVertex(v0, v0.computeParam(false, jointAt0, false, true));\r\n          this._addVertex(v1, v1.computeParam(false, jointAt1, false, true));\r\n          this._addVertex(v0, v0.computeParam(false, jointAt0, false, false));\r\n          this._addVertex(v0, v0.computeParam(false, jointAt0, false, false));\r\n          this._addVertex(v1, v1.computeParam(false, jointAt1, false, true));\r\n          this._addVertex(v1, v1.computeParam(true, jointAt1, false, false));\r\n\r\n          if (jointAt0)\r\n            this.addJointTriangles(v0, v0.computeParam(false, true, false, true), v0);\r\n\r\n          if (jointAt1)\r\n            this.addJointTriangles(v1, v1.computeParam(false, true, false, true), v1);\r\n        } else {\r\n          this._addVertex(v0, v0.computeParam(true));\r\n          this._addVertex(v1, v1.computeParam(false));\r\n          this._addVertex(v0, v0.computeParam(false));\r\n          this._addVertex(v0, v0.computeParam(false));\r\n          this._addVertex(v1, v1.computeParam(false));\r\n          this._addVertex(v1, v1.computeParam(true));\r\n        }\r\n      }\r\n    }\r\n  }\r\n\r\n  private addJointTriangles(v0: PolylineVertex, p0: number, v1: PolylineVertex): void {\r\n    const param = v1.computeParam(false, false, true);\r\n    for (let i = 0; i < 3; i++) {\r\n      this._addVertex(v0, p0);\r\n      this._addVertex(v1, param + i + 1);\r\n      this._addVertex(v1, param + i);\r\n    }\r\n  }\r\n\r\n  private _dotProduct(v: PolylineVertex): number {\r\n    const pos: Point3d = this._position[v.vertexIndex];\r\n    const prevDir: Vector3d = Vector3d.createStartEnd(this._position[v.prevIndex], pos);\r\n    const nextDir: Vector3d = Vector3d.createStartEnd(this._position[v.nextIndex], pos);\r\n    return prevDir.dotProduct(nextDir);\r\n  }\r\n\r\n  private _addVertex(vertex: PolylineVertex, param: number): void {\r\n    this._vertIndex[this._numIndices] = vertex.vertexIndex;\r\n    this._prevIndex[this._numIndices] = vertex.prevIndex;\r\n    this._nextIndex[this._numIndices] = vertex.nextIndex;\r\n    this._nextParam[this._numIndices] = param;\r\n    this._numIndices++;\r\n  }\r\n}\r\n\r\n/** Strictly for tests. @internal */\r\nexport function tesselatePolyline(polylines: PolylineData[], points: QPoint3dList, doJointTriangles: boolean): TesselatedPolyline {\r\n  const tesselator = new PolylineTesselator(polylines, points, doJointTriangles);\r\n  return tesselator.tesselate();\r\n}\r\n\r\n/**\r\n * Describes a set of tesselated polylines.\r\n * Each segment of each polyline is triangulated into a quad. Additional triangles may be inserted\r\n * between segments to enable rounded corners.\r\n */\r\nexport class PolylineParams {\r\n  public readonly vertices: VertexTable;\r\n  public readonly polyline: TesselatedPolyline;\r\n  public readonly isPlanar: boolean;\r\n  public readonly type: PolylineTypeFlags;\r\n  public readonly weight: number;\r\n  public readonly linePixels: LinePixels;\r\n\r\n  /** Directly construct a PolylineParams. The PolylineParams takes ownership of all input data. */\r\n  public constructor(vertices: VertexTable, polyline: TesselatedPolyline, weight: number, linePixels: LinePixels, isPlanar: boolean, type: PolylineTypeFlags = PolylineTypeFlags.Normal) {\r\n    this.vertices = vertices;\r\n    this.polyline = polyline;\r\n    this.isPlanar = isPlanar;\r\n    this.weight = weight;\r\n    this.linePixels = linePixels;\r\n    this.type = type;\r\n  }\r\n\r\n  /** Construct from an PolylineArgs. */\r\n  public static create(args: PolylineArgs): PolylineParams | undefined {\r\n    assert(!args.flags.isDisjoint);\r\n    const vertices = VertexTable.createForPolylines(args);\r\n    if (undefined === vertices)\r\n      return undefined;\r\n\r\n    const tesselator = PolylineTesselator.fromPolyline(args);\r\n    if (undefined === tesselator)\r\n      return undefined;\r\n\r\n    return new PolylineParams(vertices, tesselator.tesselate(), args.width, args.linePixels, args.flags.isPlanar, args.flags.type);\r\n  }\r\n}\r\n\r\nexport function wantJointTriangles(weight: number, is2d: boolean): boolean {\r\n  // Joints are incredibly expensive. In 3d, only generate them if the line is sufficiently wide for them to be noticeable.\r\n  const jointWidthThreshold = 3;\r\n  return is2d || weight >= jointWidthThreshold;\r\n}\r\n"]}