minidraco 0.8.0 → 0.9.0

package/dist/index.js

@@ -34,31 +34,31 @@ var Type = {
 var GeometryAttribute = class {
   c = null;
   v = 1;
-  O = 9 /* FLOAT32 */;
+  P = 9 /* FLOAT32 */;
   Pa = false;
-  P = 0;
   Q = 0;
+  R = 0;
   za = Type.INVALID;
   Aa = 0;
   init(attributeType, buffer, numComponents, dataType, normalized, byteStride, byteOffset) {
     this.c = buffer;
     this.v = numComponents;
-    this.O = dataType;
+    this.P = dataType;
     this.Pa = normalized;
-    this.P = byteStride;
-    this.Q = byteOffset;
+    this.Q = byteStride;
+    this.R = byteOffset;
     this.za = attributeType;
   }
   resetBuffer(buffer, byteStride, byteOffset) {
     this.c = buffer;
-    this.P = byteStride;
-    this.Q = byteOffset;
+    this.Q = byteStride;
+    this.R = byteOffset;
   }
   get attributeType() {
     return this.za;
   }
   get dataType() {
-    return this.O;
+    return this.P;
   }
   get numComponents() {
     return this.v;
@@ -67,10 +67,10 @@ var GeometryAttribute = class {
     return this.c;
   }
   get byteStride() {
-    return this.P;
+    return this.Q;
   }
   get byteOffset() {
-    return this.Q;
+    return this.R;
   }
   get uniqueId() {
     return this.Aa;
@@ -83,7 +83,7 @@ var GeometryAttribute = class {
 // src/decoder/point_cloud/PointCloud.ts
 var NAMED_ATTRIBUTES_COUNT = 8;
 var PointCloud = class {
-  ib = 0;
+  gb = 0;
   attributes_ = [];
   // named_attribute_index_[type] = [att_id, ...], one list per named type.
   Qa = [[], [], [], [], [], [], [], []];
@@ -144,10 +144,10 @@ var PointCloud = class {
     this.attributes_[attId] = pa;
   }
   numPoints() {
-    return this.ib;
+    return this.gb;
   }
   setNumPoints(num) {
-    this.ib = num;
+    this.gb = num;
   }
 };
 
@@ -157,7 +157,7 @@ var Mesh = class extends PointCloud {
   // a per-face allocation. faces_[3*f + c] is corner c of face f; corner index
   // ci maps directly to faces_[ci].
   faces_ = new Int32Array(0);
-  jb = 0;
+  hb = 0;
   // Sizes faces_ to hold numFaces faces. Called once per decode, before any
   // face index is written (edgebreaker: _assignPointsToCorners; sequential:
   // decodeConnectivity), so the buffer is allocated exactly here — the
@@ -169,124 +169,84 @@ var Mesh = class extends PointCloud {
       grown.set(this.faces_);
       this.faces_ = grown;
     }
-    this.jb = numFaces;
+    this.hb = numFaces;
   }
   numFaces() {
-    return this.jb;
+    return this.hb;
   }
 };
 
 // src/decoder/core/DataBuffer.ts
 var DataBuffer = class {
-  m = new Uint8Array(0);
+  f = new Uint8Array(0);
   // Resizes to `size` bytes (contents preserved); when `data` is given, grows
   // as needed and copies its first `size` bytes in.
   update(data, size) {
     if (data === null) {
-      this.kb(size);
+      this.ib(size);
       return;
     }
-    if (size > this.m.length) {
-      this.kb(size);
+    if (size > this.f.length) {
+      this.ib(size);
     }
-    this.m.set(data.length === size ? data : data.subarray(0, size));
+    this.f.set(data.length === size ? data : data.subarray(0, size));
   }
   // The caller passes a Uint8Array of exactly dataSize bytes in the common
   // case; avoid allocating a wrapper view per value (dominates storage time /
   // GC pressure).
   write(bytePos, inArray, dataSize) {
-    this.m.set(inArray.length === dataSize ? inArray : inArray.subarray(0, dataSize), bytePos);
+    this.f.set(inArray.length === dataSize ? inArray : inArray.subarray(0, dataSize), bytePos);
   }
   get data() {
-    return this.m;
+    return this.f;
   }
-  kb(newSize) {
-    if (newSize === this.m.length) return;
+  ib(newSize) {
+    if (newSize === this.f.length) return;
     const newData = new Uint8Array(newSize);
-    newData.set(this.m.subarray(0, Math.min(this.m.length, newSize)));
-    this.m = newData;
+    if (this.f.length > 0) newData.set(this.f.subarray(0, Math.min(this.f.length, newSize)));
+    this.f = newData;
   }
 };
 
 // src/decoder/core/ScratchArena.ts
-var MAX_CLASS = 28;
-var freeInt32 = [];
-var freeUint32 = [];
-var freeUint8 = [];
-for (let i = 0; i <= MAX_CLASS; ++i) {
-  freeInt32.push([]);
-  freeUint32.push([]);
-  freeUint8.push([]);
-}
-var borrowedInt32 = [];
-var borrowedUint32 = [];
-var borrowedUint8 = [];
-var sizeClass = (size) => size <= 1 ? 0 : 32 - Math.clz32(size - 1);
+var arena = new ArrayBuffer(1 << 16);
+var top = 0;
+var outgrown = 0;
+var carve = (bytes) => {
+  const size = bytes + 7 & ~7;
+  if (top + size > arena.byteLength) {
+    outgrown += top;
+    arena = new ArrayBuffer(Math.max(arena.byteLength * 2, size));
+    top = 0;
+  }
+  const offset = top;
+  top += size;
+  return offset;
+};
 var scratchInt32 = (size) => {
-  const k = sizeClass(size);
-  if (k > MAX_CLASS) return new Int32Array(size);
-  const bucket = freeInt32[k];
-  let pooled = bucket.length > 0 ? bucket.pop() : new Int32Array(size);
-  if (pooled.length < size) pooled = new Int32Array(1 << k);
-  borrowedInt32.push(pooled);
-  return pooled.length === size ? pooled : pooled.subarray(0, size);
+  const offset = carve(size * 4);
+  return new Int32Array(arena, offset, size);
 };
 var scratchUint32 = (size) => {
-  const k = sizeClass(size);
-  if (k > MAX_CLASS) return new Uint32Array(size);
-  const bucket = freeUint32[k];
-  let pooled = bucket.length > 0 ? bucket.pop() : new Uint32Array(size);
-  if (pooled.length < size) pooled = new Uint32Array(1 << k);
-  borrowedUint32.push(pooled);
-  return pooled.length === size ? pooled : pooled.subarray(0, size);
+  const offset = carve(size * 4);
+  return new Uint32Array(arena, offset, size);
 };
-var byteCapacity = (size) => size < 8 ? 8 : size + 7 & ~7;
 var scratchUint8 = (size) => {
-  const capacity = byteCapacity(size);
-  const k = sizeClass(capacity);
-  if (k > MAX_CLASS) return new Uint8Array(capacity);
-  const bucket = freeUint8[k];
-  let pooled = bucket.length > 0 ? bucket.pop() : new Uint8Array(capacity);
-  if (pooled.length < size) pooled = new Uint8Array(1 << k);
-  borrowedUint8.push(pooled);
-  return pooled.length === size ? pooled : pooled.subarray(0, size);
-};
-var scratchInt32Filled = (size, value) => {
-  const view = scratchInt32(size);
-  view.fill(value);
-  return view;
-};
-var scratchUint32Zeroed = (size) => {
-  const view = scratchUint32(size);
-  view.fill(0);
-  return view;
-};
-var scratchUint8Zeroed = (size) => {
-  const view = scratchUint8(size);
-  view.fill(0);
-  return view;
-};
-var scratchUint8Filled = (size, value) => {
-  const view = scratchUint8(size);
-  view.fill(value);
-  return view;
+  const offset = carve(size);
+  return new Uint8Array(arena, offset, size);
 };
+var scratchInt32Filled = (size, value) => scratchInt32(size).fill(value);
+var scratchUint32Zeroed = (size) => scratchUint32(size).fill(0);
+var scratchUint8Zeroed = (size) => scratchUint8(size).fill(0);
+var scratchUint8Filled = (size, value) => scratchUint8(size).fill(value);
+var EMPTY_INT32 = new Int32Array(0);
+var EMPTY_UINT8 = new Uint8Array(0);
 var releaseScratch = () => {
-  for (let i = 0; i < borrowedInt32.length; ++i) {
-    const buffer = borrowedInt32[i];
-    freeInt32[sizeClass(buffer.length)].push(buffer);
+  if (outgrown > 0) {
+    arena = new ArrayBuffer(outgrown + top);
+    outgrown = 0;
   }
-  for (let i = 0; i < borrowedUint32.length; ++i) {
-    const buffer = borrowedUint32[i];
-    freeUint32[sizeClass(buffer.length)].push(buffer);
-  }
-  for (let i = 0; i < borrowedUint8.length; ++i) {
-    const buffer = borrowedUint8[i];
-    freeUint8[sizeClass(buffer.length)].push(buffer);
-  }
-  borrowedInt32.length = 0;
-  borrowedUint32.length = 0;
-  borrowedUint8.length = 0;
+  top = 0;
 };
 
 // src/decoder/attributes/PointAttribute.ts
@@ -317,38 +277,38 @@ var LAZY_INTEGER = 1;
 var LAZY_QUANTIZED = 2;
 var LAZY_OCTAHEDRON = 3;
 var PointAttribute = class extends GeometryAttribute {
-  z = false;
-  Ra = 0;
-  A = [];
-  Z = null;
+  A = false;
+  Ba = 0;
+  B = [];
+  S = null;
   // Lazily-created cached typed-array view over the attribute buffer, keyed
   // on (constructor, underlying ArrayBuffer). An attribute only ever reads
   // through the one view type its data type dictates.
+  jb = null;
+  kb = null;
   lb = null;
-  mb = null;
-  nb = null;
   // Deferred inverse transform. The integer attribute decoders leave their
   // decoded values here as int32 -- quantized floats, octahedral normals or
   // plain integers -- with the transform's parameters, and extractTo applies
   // the transform while gathering the values into point order: one pass over
   // the points instead of an inverse-transform pass into a per-value buffer
   // followed by a gather from it, and no such buffer at all.
-  Ba = LAZY_NONE;
-  _ = null;
-  ob = [];
-  Ca = 0;
+  Ca = LAZY_NONE;
+  $ = null;
+  mb = [];
+  Da = 0;
   // Set when the decoder knows every lazy value is below 2^24 in magnitude
   // (see _lazyFloatValues); the extraction then skips its scan.
-  Sa = false;
+  Ra = false;
   constructor(geometryAttribute) {
     super();
     if (geometryAttribute instanceof GeometryAttribute) {
       this.c = geometryAttribute.c;
       this.v = geometryAttribute.v;
-      this.O = geometryAttribute.O;
-      this.Pa = geometryAttribute.Pa;
       this.P = geometryAttribute.P;
+      this.Pa = geometryAttribute.Pa;
       this.Q = geometryAttribute.Q;
+      this.R = geometryAttribute.R;
       this.za = geometryAttribute.za;
       this.Aa = geometryAttribute.Aa;
     }
@@ -356,78 +316,87 @@ var PointAttribute = class extends GeometryAttribute {
   // Intentionally shadows GeometryAttribute.init with a different signature (matches draco.js / C++ source).
   // @ts-expect-error -- signature intentionally differs from the base class, as in the source.
   init(attributeType, numComponents, dataType, normalized, numAttributeValues) {
-    this.Z = new DataBuffer();
+    this.S = new DataBuffer();
     const byteStride = dataTypeLength(dataType) * numComponents;
-    super.init(attributeType, this.Z, numComponents, dataType, normalized, byteStride, 0);
+    super.init(attributeType, this.S, numComponents, dataType, normalized, byteStride, 0);
     this.reset(numAttributeValues);
     this.setIdentityMapping();
   }
   reset(numAttributeValues) {
-    if (this.Z === null) {
-      this.Z = new DataBuffer();
+    if (this.S === null) {
+      this.S = new DataBuffer();
     }
     const entrySize = dataTypeLength(this.dataType) * this.numComponents;
-    this.Z.update(null, numAttributeValues * entrySize);
-    this.resetBuffer(this.Z, entrySize, 0);
-    this.Ra = numAttributeValues;
+    this.S.update(null, numAttributeValues * entrySize);
+    this.resetBuffer(this.S, entrySize, 0);
+    this.Ba = numAttributeValues;
     return true;
   }
+  // Takes `data` (numAttributeValues values in the attribute's layout) as its
+  // storage, without a copy.
+  resetWithData(data, numAttributeValues) {
+    const buffer = new DataBuffer();
+    buffer.f = data;
+    this.S = buffer;
+    this.resetBuffer(buffer, dataTypeLength(this.dataType) * this.numComponents, 0);
+    this.Ba = numAttributeValues;
+  }
   // Sizes the attribute without allocating storage, for the deferred
   // transforms below (the values live in the decoder's portable attribute).
   resetLazy(numAttributeValues) {
-    this.Ra = numAttributeValues;
+    this.Ba = numAttributeValues;
   }
   // numValues decoded integers of the attribute's own integer type, stored as
   // int32; extractTo converts them to the requested output type.
   setLazyInteger(values) {
-    this.Ba = LAZY_INTEGER;
-    this._ = values;
+    this.Ca = LAZY_INTEGER;
+    this.$ = values;
   }
   // Quantized float values: value * delta + min per component (float32
   // arithmetic, see _extractQuantized), as the C++ Dequantizer computes them.
   setLazyQuantized(values, minValues, delta, bounded) {
-    this.Ba = LAZY_QUANTIZED;
-    this._ = values;
-    this.ob = minValues;
-    this.Ca = delta;
-    this.Sa = bounded;
+    this.Ca = LAZY_QUANTIZED;
+    this.$ = values;
+    this.mb = minValues;
+    this.Da = delta;
+    this.Ra = bounded;
   }
   // Octahedral normals: two quantized coordinates per value, dequantized by
   // `scale` and turned into unit vectors (see _extractOctahedron).
   setLazyOctahedron(values, scale, bounded) {
-    this.Ba = LAZY_OCTAHEDRON;
-    this._ = values;
-    this.Ca = scale;
-    this.Sa = bounded;
+    this.Ca = LAZY_OCTAHEDRON;
+    this.$ = values;
+    this.Da = scale;
+    this.Ra = bounded;
   }
   get size() {
-    return this.Ra;
+    return this.Ba;
   }
   mappedIndex(pointIndex) {
-    if (this.z) {
+    if (this.A) {
       return pointIndex;
     }
-    return this.A[pointIndex];
+    return this.B[pointIndex];
   }
   get isMappingIdentity() {
-    return this.z;
+    return this.A;
   }
   get indicesMapSize() {
-    if (this.z) {
+    if (this.A) {
       return 0;
     }
-    return this.A.length;
+    return this.B.length;
   }
   // Direct access to the explicit point->value index map (a Uint32Array after
   // any of the setExplicitMapping* calls). Lets hot mapping loops write
   // entries without a per-entry dispatch.
   get indicesMap() {
-    return this.A;
+    return this.B;
   }
   // Implicit mapping: point index equals attribute entry index.
   setIdentityMapping() {
-    this.z = true;
-    this.A = [];
+    this.A = true;
+    this.B = [];
   }
   // Explicit mapping without an invalid-index fill. Only for callers that
   // provably write every entry right away (the fill was ~4% of decode time on
@@ -437,31 +406,31 @@ var PointAttribute = class extends GeometryAttribute {
   // and avoids boxed-number storage; it is read once per point per attribute.
   // Must be UNSIGNED so the 0xFFFFFFFF invalid sentinel round-trips intact.
   setExplicitMappingUnfilled(numPoints) {
-    this.z = false;
-    this.A = new Uint32Array(numPoints);
+    this.A = false;
+    this.B = new Uint32Array(numPoints);
   }
   // Adopts an already-computed map, shared with other attributes of the same
   // mesh. The map must be treated as read-only from here on (reads go through
   // mappedIndex/extractTo).
   setExplicitMappingShared(map) {
-    this.z = false;
-    this.A = map;
+    this.A = false;
+    this.B = map;
   }
   // Like setExplicitMappingUnfilled, but from decode-scoped scratch. Only for
   // attributes that never escape the decode (see ScratchArena) -- the portable
   // attributes the sequential decoders build and discard.
   setExplicitMappingScratch(numPoints) {
-    this.z = false;
-    this.A = scratchUint32(numPoints);
+    this.A = false;
+    this.B = scratchUint32(numPoints);
   }
   // Cached typed-array view of the given type over the attribute buffer.
-  pb(Ctor, bufData) {
-    if (this.lb !== Ctor || this.mb !== bufData.buffer) {
-      this.lb = Ctor;
-      this.mb = bufData.buffer;
-      this.nb = new Ctor(bufData.buffer);
+  nb(Ctor, bufData) {
+    if (this.jb !== Ctor || this.kb !== bufData.buffer) {
+      this.jb = Ctor;
+      this.kb = bufData.buffer;
+      this.lb = new Ctor(bufData.buffer);
     }
-    return this.nb;
+    return this.lb;
   }
   // Mirrors C++ PointAttribute::ConvertValue<T>() for buffer-backed
   // attributes. Attribute buffers start at byteOffset 0 and entries are
@@ -470,13 +439,13 @@ var PointAttribute = class extends GeometryAttribute {
   convertValue(attIndex, outVal) {
     const bufData = this.c.data;
     const nc = this.v;
-    const Ctor = viewCtorFor(this.O);
+    const Ctor = viewCtorFor(this.P);
     if (Ctor === null) {
       for (let i = 0; i < nc; ++i) outVal[i] = 0;
       return;
     }
-    const view = this.pb(Ctor, bufData);
-    const baseIndex = (bufData.byteOffset + this.Q + this.P * attIndex) / Ctor.BYTES_PER_ELEMENT;
+    const view = this.nb(Ctor, bufData);
+    const baseIndex = (bufData.byteOffset + this.R + this.Q * attIndex) / Ctor.BYTES_PER_ELEMENT;
     for (let i = 0; i < nc; ++i) outVal[i] = view[baseIndex + i];
   }
   // Flat-array extraction of all values into one output typed array, in point
@@ -487,26 +456,31 @@ var PointAttribute = class extends GeometryAttribute {
     if (numPoints === 0) {
       return array;
     }
-    const kind = this.Ba;
+    const kind = this.Ca;
     if (kind !== LAZY_NONE) {
-      if (this._ !== null) {
-        if (kind === LAZY_QUANTIZED) this.Qb(array, numPoints);
-        else if (kind === LAZY_OCTAHEDRON) this.Rb(array, numPoints);
-        else this.Sb(array, numPoints);
+      if (this.$ !== null) {
+        if (kind === LAZY_INTEGER) {
+          this.Qb(array, numPoints);
+        } else {
+          const floats = array instanceof Float32Array ? array : new Float32Array(array.length);
+          if (kind === LAZY_QUANTIZED) this.Rb(floats, numPoints);
+          else this.Sb(floats, numPoints);
+          if (floats !== array) array.set(floats);
+        }
       }
       return array;
     }
-    const Ctor = viewCtorFor(this.O);
+    const Ctor = viewCtorFor(this.P);
     if (this.c === null || Ctor === null) {
       return array;
     }
     const bufData = this.c.data;
-    const isIdentity = this.z;
-    const indicesMap = this.A;
-    const srcView = this.pb(Ctor, bufData);
+    const isIdentity = this.A;
+    const indicesMap = this.B;
+    const srcView = this.nb(Ctor, bufData);
     const shift = 31 - Math.clz32(Ctor.BYTES_PER_ELEMENT);
-    const srcStart = bufData.byteOffset + this.Q >> shift;
-    const strideElements = this.P >> shift;
+    const srcStart = bufData.byteOffset + this.R >> shift;
+    const strideElements = this.Q >> shift;
     if (isIdentity && strideElements === numComponents) {
       const srcEnd = srcStart + numPoints * numComponents;
       if (srcView.constructor === OutputTypedArray) {
@@ -533,8 +507,8 @@ var PointAttribute = class extends GeometryAttribute {
   // are bit-identical to the reference decoder whatever the output array type.
   // Point -> value index; the identity mapping (sequential meshes) gets a
   // plain iota so the loops carry no per-point branch.
-  Ta(numPoints) {
-    if (!this.z) return this.A;
+  Sa(numPoints) {
+    if (!this.A) return this.B;
     const map = new Uint32Array(numPoints);
     for (let p = 0; p < numPoints; ++p) map[p] = p;
     return map;
@@ -547,9 +521,9 @@ var PointAttribute = class extends GeometryAttribute {
   // practice) are rounded in place once here, after which the same holds.
   // The decoder marks the attribute bounded when its prediction transform
   // already confines the values to that range, and the scan is skipped.
-  qb() {
-    const values = this._;
-    if (this.Sa) return values;
+  ob() {
+    const values = this.$;
+    if (this.Ra) return values;
     for (let i = 0; i < values.length; ++i) {
       if (values[i] >= 16777216 || values[i] <= -16777216) {
         for (let j = 0; j < values.length; ++j) values[j] = Math.fround(values[j]);
@@ -558,23 +532,24 @@ var PointAttribute = class extends GeometryAttribute {
     }
     return values;
   }
-  // C++ Dequantizer: float(value) * delta + min, all in float32.
-  Qb(out, numPoints) {
-    const values = this.qb();
-    const map = this.Ta(numPoints);
+  // C++ Dequantizer: float(value) * delta + min, all in float32 (the final
+  // rounding is the Float32Array store's).
+  Rb(out, numPoints) {
+    const values = this.ob();
+    const map = this.Sa(numPoints);
     const numComponents = this.v;
     const fround = Math.fround;
-    const delta = this.Ca;
-    const min = this.ob;
+    const delta = this.Da;
+    const min = this.mb;
     if (numComponents === 3) {
       const m0 = min[0];
       const m1 = min[1];
       const m2 = min[2];
       for (let p = 0, d = 0; p < numPoints; ++p, d += 3) {
         const s = map[p] * 3;
-        out[d] = fround(fround(values[s] * delta) + m0);
-        out[d + 1] = fround(fround(values[s + 1] * delta) + m1);
-        out[d + 2] = fround(fround(values[s + 2] * delta) + m2);
+        out[d] = fround(values[s] * delta) + m0;
+        out[d + 1] = fround(values[s + 1] * delta) + m1;
+        out[d + 2] = fround(values[s + 2] * delta) + m2;
       }
       return;
     }
@@ -583,54 +558,51 @@ var PointAttribute = class extends GeometryAttribute {
       const m1 = min[1];
       for (let p = 0, d = 0; p < numPoints; ++p, d += 2) {
         const s = map[p] * 2;
-        out[d] = fround(fround(values[s] * delta) + m0);
-        out[d + 1] = fround(fround(values[s + 1] * delta) + m1);
+        out[d] = fround(values[s] * delta) + m0;
+        out[d + 1] = fround(values[s + 1] * delta) + m1;
       }
       return;
     }
     for (let p = 0, d = 0; p < numPoints; ++p) {
       const s = map[p] * numComponents;
       for (let c = 0; c < numComponents; ++c) {
-        out[d++] = fround(fround(values[s + c] * delta) + min[c]);
+        out[d++] = fround(values[s + c] * delta) + min[c];
       }
     }
   }
   // OctahedronToolBox.QuantizedOctahedralCoordsToUnitVector, two quantized
-  // coordinates per value to one unit vector per point.
-  Rb(out, numPoints) {
-    const values = this.qb();
-    const map = this.Ta(numPoints);
+  // coordinates per value to one unit vector per point, branch-free: the
+  // signs of the normals' components are unpredictable, so the fold picks
+  // its direction arithmetically (multiplying by +-1 is exact, zero signs
+  // included). The C++ zero-vector guard (squared norm below 1e-6) is left
+  // out because no input reaches it: |x| + |y| + |z| >= 1 before the fold,
+  // which moves y and z by at most |x|, so some component stays above 1/6.
+  Sb(out, numPoints) {
+    const values = this.ob();
+    const map = this.Sa(numPoints);
     const fround = Math.fround;
-    const scale = this.Ca;
+    const scale = this.Da;
     for (let p = 0, d = 0; p < numPoints; ++p, d += 3) {
       const s = map[p] * 2;
       let y = fround(fround(values[s] * scale) - 1);
       let z = fround(fround(values[s + 1] * scale) - 1);
       const x = fround(fround(1 - Math.abs(y)) - Math.abs(z));
-      let xOffset = -x;
-      if (xOffset < 0) xOffset = 0;
-      y = fround(y + (y < 0 ? xOffset : -xOffset));
-      z = fround(z + (z < 0 ? xOffset : -xOffset));
-      const normSquared = fround(fround(fround(x * x) + fround(y * y)) + fround(z * z));
-      if (normSquared < 1e-6) {
-        out[d] = 0;
-        out[d + 1] = 0;
-        out[d + 2] = 0;
-      } else {
-        const k = fround(1 / fround(Math.sqrt(normSquared)));
-        out[d] = fround(x * k);
-        out[d + 1] = fround(y * k);
-        out[d + 2] = fround(z * k);
-      }
+      const xOffset = Math.max(-x, 0);
+      y = fround(y + xOffset * (2 * +(y < 0) - 1));
+      z = fround(z + xOffset * (2 * +(z < 0) - 1));
+      const k = fround(1 / fround(Math.sqrt(fround(fround(fround(x * x) + fround(y * y)) + fround(z * z)))));
+      out[d] = x * k;
+      out[d + 1] = y * k;
+      out[d + 2] = z * k;
     }
   }
   // The int32 values wrap to the attribute's own integer type (as storing
   // them into it would) before the output store converts them.
-  Sb(out, numPoints) {
-    const values = this._;
-    const map = this.Ta(numPoints);
+  Qb(out, numPoints) {
+    const values = this.$;
+    const map = this.Sa(numPoints);
     const numComponents = this.v;
-    const dt = this.O;
+    const dt = this.P;
     const shift = 32 - 8 * dataTypeLength(dt);
     const signed = dt === 1 /* INT8 */ || dt === 3 /* INT16 */ || dt === 5 /* INT32 */;
     for (let p = 0, d = 0; p < numPoints; ++p) {
@@ -662,18 +634,18 @@ function decodeVarint(buffer) {
 
 // src/decoder/core/DecoderBuffer.ts
 var BitDecoder = class {
-  Da = null;
-  p = 0;
+  Ea = null;
+  o = 0;
   ja = 0;
-  reset(uint8Array, byteLength) {
-    this.Da = uint8Array;
-    this.ja = byteLength;
-    this.p = 0;
+  reset(uint8Array, start, end) {
+    this.Ea = uint8Array;
+    this.ja = end;
+    this.o = start * 8;
   }
   getBits(nbits) {
     if (nbits > 32) return void 0;
-    const buf = this.Da;
-    let off = this.p;
+    const buf = this.Ea;
+    let off = this.o;
     const byteOffset = off >> 3;
     const bitShift = off & 7;
     if (byteOffset + 4 < this.ja) {
@@ -687,7 +659,7 @@ var BitDecoder = class {
       } else {
         result = val >>> bitShift;
       }
-      this.p = off + nbits;
+      this.o = off + nbits;
       return nbits === 32 ? result : result & (1 << nbits) - 1;
     }
     let value = 0;
@@ -705,54 +677,68 @@ var BitDecoder = class {
       bitsRead += bitsToRead;
       currOff += bitsToRead;
     }
-    this.p = currOff;
+    this.o = currOff;
     return value;
   }
 };
+var floatBytes = new Uint8Array(4);
+var floatView = new DataView(floatBytes.buffer);
 var DecoderBuffer = class {
-  m = null;
-  Ea = null;
-  K = 0;
-  d = 0;
+  f = null;
+  y = 0;
+  g = 0;
   ka = new BitDecoder();
   Fa = false;
   init(data, dataSize = data.length) {
-    this.m = data;
-    this.Ea = new DataView(data.buffer, data.byteOffset, data.byteLength);
-    this.K = dataSize;
-    this.d = 0;
+    this.f = data;
+    this.y = dataSize;
+    this.g = 0;
+  }
+  // Continues where `other` stands: same bytes, same position (offsets stay
+  // absolute, so no view of the remaining bytes is made).
+  initFrom(other) {
+    this.f = other.f;
+    this.y = other.y;
+    this.g = other.g;
   }
   // Typed little-endian reads.
   decodeUint8() {
-    if (this.d + 1 > this.K) return void 0;
-    const val = this.m[this.d];
-    this.d += 1;
+    if (this.g + 1 > this.y) return void 0;
+    const val = this.f[this.g];
+    this.g += 1;
     return val;
   }
   decodeUint16() {
-    if (this.d + 2 > this.K) return void 0;
-    const val = this.Ea.getUint16(this.d, true);
-    this.d += 2;
-    return val;
+    const pos = this.g;
+    if (pos + 2 > this.y) return void 0;
+    const data = this.f;
+    this.g = pos + 2;
+    return data[pos] | data[pos + 1] << 8;
   }
   decodeInt32() {
-    if (this.d + 4 > this.K) return void 0;
-    const val = this.Ea.getInt32(this.d, true);
-    this.d += 4;
-    return val;
+    const pos = this.g;
+    if (pos + 4 > this.y) return void 0;
+    const data = this.f;
+    this.g = pos + 4;
+    return data[pos] | data[pos + 1] << 8 | data[pos + 2] << 16 | data[pos + 3] << 24;
   }
   decodeFloat32() {
-    if (this.d + 4 > this.K) return void 0;
-    const val = this.Ea.getFloat32(this.d, true);
-    this.d += 4;
-    return val;
+    const pos = this.g;
+    if (pos + 4 > this.y) return void 0;
+    const data = this.f;
+    this.g = pos + 4;
+    floatBytes[0] = data[pos];
+    floatBytes[1] = data[pos + 1];
+    floatBytes[2] = data[pos + 2];
+    floatBytes[3] = data[pos + 3];
+    return floatView.getFloat32(0, true);
   }
   // A view into the stream (no copy), only valid until the caller's next
   // chance to mutate the buffer — copy out before keeping it.
   decodeBytesView(size) {
-    if (this.d + size > this.K) return void 0;
-    const result = this.m.subarray(this.d, this.d + size);
-    this.d += size;
+    if (this.g + size > this.y) return void 0;
+    const result = this.f.subarray(this.g, this.g + size);
+    this.g += size;
     return result;
   }
   // Only the 2.2+ layout (varint size prefix): older bitstreams are rejected
@@ -765,31 +751,28 @@ var DecoderBuffer = class {
       outSize = size;
     }
     this.Fa = true;
-    this.ka.reset(this.m.subarray(this.d), this.K - this.d);
+    this.ka.reset(this.f, this.g, this.y);
     return outSize;
   }
   endBitDecoding() {
     this.Fa = false;
-    this.d += Math.ceil(this.ka.p / 8);
+    this.g = Math.ceil(this.ka.o / 8);
   }
   decodeLeastSignificantBits32(nbits) {
     if (!this.Fa) return void 0;
     return this.ka.getBits(nbits);
   }
   advance(bytes) {
-    this.d += bytes;
+    this.g += bytes;
   }
   get data() {
-    return this.m;
-  }
-  get dataHead() {
-    return this.m.subarray(this.d);
+    return this.f;
   }
   get remainingSize() {
-    return this.K - this.d;
+    return this.y - this.g;
   }
   get decodedSize() {
-    return this.d;
+    return this.g;
   }
   get bitDecoderActive() {
     return this.Fa;
@@ -810,66 +793,66 @@ var METADATA_FLAG_MASK = 32768;
 var kMaxSubmetadataLevel = 1e3;
 var MetadataDecoder = class {
   constructor(buffer_) {
-    this.B = buffer_;
+    this.C = buffer_;
   }
   buffer_;
   // Skips per-attribute metadata followed by the geometry-level metadata.
   skipGeometryMetadata() {
-    const numAttMetadata = decodeVarint(this.B);
+    const numAttMetadata = decodeVarint(this.C);
     if (numAttMetadata === void 0) {
       return false;
     }
     for (let i = 0; i < numAttMetadata; ++i) {
-      if (decodeVarint(this.B) === void 0) {
+      if (decodeVarint(this.C) === void 0) {
         return false;
       }
-      if (!this.Ua(0)) {
+      if (!this.Ta(0)) {
         return false;
       }
     }
-    return this.Ua(0);
+    return this.Ta(0);
   }
   // Discards one metadata block (key-value entries plus nested sub-metadata).
   // Sub-blocks read depth-first in stream order, matching the C++ stack traversal.
-  Ua(level) {
+  Ta(level) {
     if (level > kMaxSubmetadataLevel) {
       return false;
     }
-    const numEntries = decodeVarint(this.B);
+    const numEntries = decodeVarint(this.C);
     if (numEntries === void 0) {
       return false;
     }
     for (let i = 0; i < numEntries; ++i) {
-      const nameSkipped = this.rb();
-      const dataSize = nameSkipped ? decodeVarint(this.B) : void 0;
-      if (dataSize === void 0 || dataSize === 0 || !this.sb(dataSize)) {
+      const nameSkipped = this.pb();
+      const dataSize = nameSkipped ? decodeVarint(this.C) : void 0;
+      if (dataSize === void 0 || dataSize === 0 || !this.qb(dataSize)) {
         return false;
       }
     }
-    const numSubMetadata = decodeVarint(this.B);
-    if (numSubMetadata === void 0 || numSubMetadata > this.B.remainingSize) {
+    const numSubMetadata = decodeVarint(this.C);
+    if (numSubMetadata === void 0 || numSubMetadata > this.C.remainingSize) {
       return false;
     }
     for (let i = 0; i < numSubMetadata; ++i) {
-      if (!this.rb() || !this.Ua(level + 1)) {
+      if (!this.pb() || !this.Ta(level + 1)) {
         return false;
       }
     }
     return true;
   }
   // Skips a name (uint8 length prefix followed by that many bytes).
-  rb() {
-    const nameLen = this.B.decodeUint8();
+  pb() {
+    const nameLen = this.C.decodeUint8();
     if (nameLen === void 0) {
       return false;
     }
-    return this.sb(nameLen);
+    return this.qb(nameLen);
   }
-  sb(size) {
-    if (size > this.B.remainingSize) {
+  qb(size) {
+    if (size > this.C.remainingSize) {
       return false;
     }
-    this.B.advance(size);
+    this.C.advance(size);
     return true;
   }
 };
@@ -947,8 +930,8 @@ var RAnsDecoder = class {
   bucketShift = 0;
   // Uint16 unless the alphabet needs wider ids, so real streams keep one table type.
   bucketTable = null;
-  // Stream state inlined (not a nested AnsDecoder) so the ransRead() hot loop
-  // touches own props; initialized by ansReadInit.
+  // Stream state inlined (not a nested AnsDecoder) so the decode loops touch
+  // own props; initialized by ansReadInit.
   buf = null;
   bufOffset = 0;
   // First valid byte of this decoder's slice within buf (absolute offsets,
@@ -980,31 +963,8 @@ var RAnsDecoder = class {
     }
     return this.state === this.lRansBase;
   }
-  ransRead() {
-    const buf = this.buf;
-    const lRansBase = this.lRansBase;
-    let state = this.state;
-    let bufOffset = this.bufOffset;
-    const bufStart = this.bufStart;
-    while (state < lRansBase && bufOffset > bufStart) {
-      state = state << 8 | buf[--bufOffset];
-    }
-    const quo = state >>> this.ransPrecisionBits;
-    const rem = state & this.ransPrecisionMask;
-    let symbol;
-    if (this.coarse) {
-      const cumProbTable = this.cumProbTable;
-      symbol = this.bucketTable[rem >> this.bucketShift];
-      while (cumProbTable[symbol + 1] <= rem) symbol++;
-    } else {
-      symbol = this.lutTable[rem];
-    }
-    this.state = quo * this.probTable[symbol] + rem - this.cumProbTable[symbol];
-    this.bufOffset = bufOffset;
-    return symbol;
-  }
-  // Batch ransRead() into out[0..count): all fields hoisted to locals, state
-  // written back once. Removes per-symbol property reads and call indirection.
+  // Decodes count symbols into out[0..count): all fields hoisted to locals,
+  // state written back once.
   decodeSymbols(out, count) {
     if (this.coarse) {
       this.Tb(out, count);
@@ -1301,9 +1261,9 @@ function ransDecodeSymbolsTrioU16(a, outA, countA, b, outB, countB, c, outC, cou
 
 // src/decoder/compression/point_cloud/PointCloudDecoder.ts
 var PointCloudDecoder = class {
-  R = null;
+  T = null;
   c = null;
-  t = [];
+  s = [];
   Ga = [];
   // Returns an error message, or '' on success (outHeader is then populated).
   static decodeHeader(buffer, outHeader) {
@@ -1334,7 +1294,7 @@ var PointCloudDecoder = class {
   // Main entry point, given the already-parsed header (see Decode.ts).
   decode(header, inBuffer, outPointCloud) {
     this.c = inBuffer;
-    this.R = outPointCloud;
+    this.T = outPointCloud;
     if (header.versionMajor !== 2 || header.versionMinor !== 2) {
       return "Unsupported bitstream version (Draco 2.2 meshes only).";
     }
@@ -1356,27 +1316,27 @@ var PointCloudDecoder = class {
     if (attDecoderId < 0) {
       return false;
     }
-    while (this.t.length <= attDecoderId) {
-      this.t.push(null);
+    while (this.s.length <= attDecoderId) {
+      this.s.push(null);
     }
-    this.t[attDecoderId] = decoder;
+    this.s[attDecoderId] = decoder;
     return true;
   }
   getPortableAttribute(parentAttId) {
-    if (parentAttId < 0 || parentAttId >= this.R.numAttributes()) {
+    if (parentAttId < 0 || parentAttId >= this.T.numAttributes()) {
       return null;
     }
     const parentAttDecoderId = this.Ga[parentAttId];
-    return this.t[parentAttDecoderId].getPortableAttribute(parentAttId);
+    return this.s[parentAttDecoderId].getPortableAttribute(parentAttId);
   }
   attributesDecoder(decId) {
-    return this.t[decId];
+    return this.s[decId];
   }
   numAttributesDecoders() {
-    return this.t.length;
+    return this.s.length;
   }
   pointCloud() {
-    return this.R;
+    return this.T;
   }
   buffer() {
     return this.c;
@@ -1402,20 +1362,20 @@ var PointCloudDecoder = class {
         return false;
       }
     }
-    for (let i = 0; i < this.t.length; ++i) {
-      if (!this.t[i].init(this, this.R)) {
+    for (let i = 0; i < this.s.length; ++i) {
+      if (!this.s[i].init(this, this.T)) {
         return false;
       }
     }
     for (let i = 0; i < numAttributesDecoders; ++i) {
-      if (!this.t[i].decodeAttributesDecoderData(this.c)) {
+      if (!this.s[i].decodeAttributesDecoderData(this.c)) {
         return false;
       }
     }
     for (let i = 0; i < numAttributesDecoders; ++i) {
-      const numAttributes = this.t[i].getNumAttributes();
+      const numAttributes = this.s[i].getNumAttributes();
       for (let j = 0; j < numAttributes; ++j) {
-        const attId = this.t[i].getAttributeId(j);
+        const attId = this.s[i].getAttributeId(j);
         while (this.Ga.length <= attId) {
           this.Ga.push(0);
         }
@@ -1425,7 +1385,7 @@ var PointCloudDecoder = class {
     return this.decodeAllAttributes();
   }
   decodeAllAttributes() {
-    const decoders = this.t;
+    const decoders = this.s;
     for (let i = 0; i < decoders.length; i++) {
       if (!decoders[i].decodeAttributesParse(this.c)) {
         return false;
@@ -1447,10 +1407,10 @@ var PointCloudDecoder = class {
 
 // src/decoder/compression/mesh/MeshDecoder.ts
 var MeshDecoder = class extends PointCloudDecoder {
-  C = null;
+  D = null;
   // Returns an error message, or '' on success.
   decodeMesh(header, inBuffer, outMesh) {
-    this.C = outMesh;
+    this.D = outMesh;
     return this.decode(header, inBuffer, outMesh);
   }
   // Connectivity accessors used by the mesh prediction schemes; the sequential
@@ -1465,7 +1425,7 @@ var MeshDecoder = class extends PointCloudDecoder {
     return null;
   }
   mesh() {
-    return this.C;
+    return this.D;
   }
   decodeGeometryData() {
     return this.decodeConnectivity() && super.decodeGeometryData();
@@ -1476,21 +1436,21 @@ var MeshDecoder = class extends PointCloudDecoder {
 var kInvalidCornerIndex = -1;
 var MeshAttributeCornerTable = class {
   // Base vertices touched by a seam edge of this table.
-  la = new Uint8Array(0);
-  S = new Int32Array(0);
+  la = EMPTY_UINT8;
+  U = EMPTY_INT32;
   // Attribute vertex -> 1 when its fan is open in this table (see
   // CornerTable._vertexOnBoundary). The C++ also keeps each attribute
   // vertex's left-most corner, but the decoder only ever asked it whether
   // that corner sits on a boundary, which this answers directly.
-  y = new Uint8Array(0);
+  z = EMPTY_UINT8;
   // Attribute-vertex count. C++ keeps a vertex -> attribute-entry map here, but
   // the decoder only ever reads its size, so track the count directly instead
   // of allocating an Int32Array per attribute corner table.
   ma = 0;
-  D = null;
+  E = null;
   // The base table's opposite corners with both corners of every seam edge
   // set to -1: what opposite() answers, and what the traversals read.
-  E = new Int32Array(0);
+  F = EMPTY_INT32;
   // Starts the table as a copy of the base connectivity; addSeamEdge then
   // cuts the seams and the ring pass numbers the vertices. Decode-scoped
   // scratch throughout: the table lives only until the decode finishes (the
@@ -1498,30 +1458,28 @@ var MeshAttributeCornerTable = class {
   // file from allocating a fresh set per attribute per prim.
   initEmpty(table) {
     const numCorners = table.numCorners();
-    this.D = table;
+    this.E = table;
     this.la = scratchUint8Zeroed(table.numVertices());
-    this.E = scratchInt32(numCorners);
-    this.E.set(table.oppositeCornerArray());
-    this.S = scratchInt32(numCorners);
-    this.S.set(table.cornerToVertexArray());
+    this.F = scratchInt32(numCorners);
+    this.F.set(table.oppositeCornerArray());
+    this.U = scratchInt32(numCorners);
+    this.U.set(table.cornerToVertexArray());
     this.ma = 0;
   }
-  // Cuts the edge opposite corner c (and its twin) and flags its two vertices.
+  // Cuts the interior edge opposite corner c (and its twin) and flags its two
+  // vertices. (Boundary edges are open in the base table already, and flagging
+  // their vertices would only send them through the ring walk to come out
+  // unsplit.)
   addSeamEdge(c) {
-    const cornerToVertex = this.D.cornerToVertexArray();
-    const opposite = this.E;
+    const cornerToVertex = this.E.cornerToVertexArray();
+    const opposite = this.F;
     const isVert = this.la;
     const oppCorner = opposite[c];
     opposite[c] = kInvalidCornerIndex;
-    let rem = c - (c / 3 | 0) * 3;
+    opposite[oppCorner] = kInvalidCornerIndex;
+    const rem = c - (c / 3 | 0) * 3;
     isVert[cornerToVertex[rem === 2 ? c - 2 : c + 1]] = 1;
     isVert[cornerToVertex[rem === 0 ? c + 2 : c - 1]] = 1;
-    if (oppCorner !== kInvalidCornerIndex) {
-      opposite[oppCorner] = kInvalidCornerIndex;
-      rem = oppCorner - (oppCorner / 3 | 0) * 3;
-      isVert[cornerToVertex[rem === 2 ? oppCorner - 2 : oppCorner + 1]] = 1;
-      isVert[cornerToVertex[rem === 0 ? oppCorner + 2 : oppCorner - 1]] = 1;
-    }
   }
   // Installs the vertex numbering computed by the edgebreaker decoder's ring
   // pass, which fills corner_to_vertex_map_ directly and hands over the
@@ -1529,29 +1487,29 @@ var MeshAttributeCornerTable = class {
   // least numVertices entries).
   setRecomputedVertices(onBoundary, numVertices) {
     this.ma = numVertices;
-    this.y = onBoundary;
+    this.z = onBoundary;
   }
   // A table without interior seams is the base connectivity itself: every
   // vertex ring is one attribute vertex, and the boundary edges are already
   // open in the base opposite table. Shares the base arrays (read-only from
   // here on), so its traversal also resolves to the base table's cached one.
   initAsBase(table) {
-    this.D = table;
-    this.E = table.oppositeCornerArray();
-    this.S = table.cornerToVertexArray();
+    this.E = table;
+    this.F = table.oppositeCornerArray();
+    this.U = table.cornerToVertexArray();
     this.setRecomputedVertices(table.vertexOnBoundaryArray(), table.numVertices());
   }
   opposite(corner) {
     if (corner === kInvalidCornerIndex) {
       return kInvalidCornerIndex;
     }
-    return this.E[corner];
+    return this.F[corner];
   }
   next(corner) {
-    return this.D.next(corner);
+    return this.E.next(corner);
   }
   previous(corner) {
-    return this.D.previous(corner);
+    return this.E.previous(corner);
   }
   swingRight(corner) {
     return this.previous(this.opposite(this.previous(corner)));
@@ -1563,32 +1521,32 @@ var MeshAttributeCornerTable = class {
     return this.ma;
   }
   numFaces() {
-    return this.D.numFaces();
+    return this.E.numFaces();
   }
   numCorners() {
-    return this.D.numCorners();
+    return this.E.numCorners();
   }
   // --- Flat-array accessors: let DepthFirstTraverser avoid per-corner dispatch. ---
   cornerToVertexArray() {
-    return this.S;
+    return this.U;
   }
   // Seam-aware opposite corners (seam edges -> -1), matching opposite().
   oppositeCornerArray() {
-    return this.E;
+    return this.F;
   }
   vertexOnBoundaryArray() {
-    return this.y;
+    return this.z;
   }
   // Takes over another table's state wholesale. Only valid when both tables
   // were built from the same corner table and the same seam edges, in which
   // case every one of these is identical and read-only from here on.
   adoptFrom(other) {
-    this.D = other.D;
+    this.E = other.E;
     this.la = other.la;
-    this.S = other.S;
+    this.U = other.U;
     this.ma = other.ma;
-    this.y = other.y;
-    this.E = other.E;
+    this.z = other.z;
+    this.F = other.F;
   }
 };
 
@@ -1597,11 +1555,11 @@ var AttributesDecoder = class {
   Ha = [];
   // Inverse of _pointAttributeIds: point attribute id -> local id.
   na = [];
-  tb = null;
-  R = null;
+  rb = null;
+  T = null;
   init(decoder, pointCloud) {
-    this.tb = decoder;
-    this.R = pointCloud;
+    this.rb = decoder;
+    this.T = pointCloud;
     return true;
   }
   decodeAttributesDecoderData(buffer) {
@@ -1610,7 +1568,7 @@ var AttributesDecoder = class {
       return false;
     }
     this.Ha.length = numAttributes;
-    const pc = this.R;
+    const pc = this.T;
     for (let i = 0; i < numAttributes; i++) {
       const attType = buffer.decodeUint8();
       if (attType === void 0) return false;
@@ -1651,7 +1609,7 @@ var AttributesDecoder = class {
     return this.Ha.length;
   }
   getDecoder() {
-    return this.tb;
+    return this.rb;
   }
   getLocalIdForPointAttribute(pointAttributeId) {
     if (pointAttributeId >= this.na.length) {
@@ -1663,15 +1621,15 @@ var AttributesDecoder = class {
 
 // src/decoder/compression/attributes/SequentialAttributeDecoder.ts
 var SequentialAttributeDecoder = class {
-  l = null;
-  F = null;
-  ub = -1;
+  m = null;
+  G = null;
+  sb = -1;
   // Decoded portable attribute (after lossless decoding).
-  $ = null;
+  V = null;
   init(decoder, attributeId) {
-    this.l = decoder;
-    this.F = decoder.pointCloud().attribute(attributeId);
-    this.ub = attributeId;
+    this.m = decoder;
+    this.G = decoder.pointCloud().attribute(attributeId);
+    this.sb = attributeId;
     return true;
   }
   // --- Two-phase decode ---
@@ -1682,10 +1640,10 @@ var SequentialAttributeDecoder = class {
   // stream simply do the whole decode in Parse (decodeValues); the defaults
   // below are theirs.
   decodePortableAttributeParse(pointIds, buffer) {
-    if (this.F.numComponents <= 0) {
+    if (this.G.numComponents <= 0) {
       return false;
     }
-    if (!this.vb(pointIds.length)) {
+    if (!this.tb(pointIds.length)) {
       return false;
     }
     return this.decodeValues(pointIds, buffer);
@@ -1693,8 +1651,8 @@ var SequentialAttributeDecoder = class {
   // Sizes (and here allocates) the attribute's storage for numValues values;
   // the integer decoders override it to skip the allocation, their values
   // staying in the portable attribute (see PointAttribute.setLazyInteger).
-  vb(numValues) {
-    return this.F.reset(numValues);
+  tb(numValues) {
+    return this.G.reset(numValues);
   }
   pendingSymbolStream() {
     return null;
@@ -1711,35 +1669,35 @@ var SequentialAttributeDecoder = class {
     return true;
   }
   getPortableAttribute() {
-    if (!this.F.isMappingIdentity && this.$ && this.$.isMappingIdentity) {
-      const size = this.F.indicesMapSize;
-      this.$.setExplicitMappingScratch(size);
-      const src = this.F.indicesMap;
-      const dst = this.$.indicesMap;
+    if (!this.G.isMappingIdentity && this.V && this.V.isMappingIdentity) {
+      const size = this.G.indicesMapSize;
+      this.V.setExplicitMappingScratch(size);
+      const src = this.G.indicesMap;
+      const dst = this.V.indicesMap;
       if (src.length === size) {
         dst.set(src);
       } else {
         dst.set(src.subarray(0, size));
       }
     }
-    return this.$;
+    return this.V;
   }
   get attribute() {
-    return this.F;
+    return this.G;
   }
   get attributeId() {
-    return this.ub;
+    return this.sb;
   }
   get decoder() {
-    return this.l;
+    return this.m;
   }
   initPredictionScheme(ps) {
     for (let i = 0; i < ps.getNumParentAttributes(); i++) {
-      const attId = this.l.pointCloud().getNamedAttributeId(ps.getParentAttributeType(i));
+      const attId = this.m.pointCloud().getNamedAttributeId(ps.getParentAttributeType(i));
       if (attId === -1) {
         return false;
       }
-      const pa = this.l.getPortableAttribute(attId);
+      const pa = this.m.getPortableAttribute(attId);
       if (pa === null || !ps.setParentAttribute(pa)) {
         return false;
       }
@@ -1749,13 +1707,13 @@ var SequentialAttributeDecoder = class {
   // Decodes raw attribute values in their original format.
   decodeValues(pointIds, buffer) {
     const numValues = pointIds.length;
-    const entrySize = this.F.byteStride;
+    const entrySize = this.G.byteStride;
     const totalSize = numValues * entrySize;
     const valueData = buffer.decodeBytesView(totalSize);
     if (valueData === void 0) {
       return false;
     }
-    this.F.buffer.write(0, valueData, totalSize);
+    this.G.buffer.write(0, valueData, totalSize);
     return true;
   }
 };
@@ -1770,14 +1728,14 @@ function convertSymbolsToSignedInts(input, count, output) {
 
 // src/decoder/compression/entropy/RAnsSymbolDecoder.ts
 var RAnsSymbolDecoder = class {
-  wb = 0;
-  G;
+  ub = 0;
+  H;
   constructor(uniqueSymbolsBitLength) {
     const unclamped = Math.trunc(3 * uniqueSymbolsBitLength / 2);
-    this.G = new RAnsDecoder(unclamped < 12 ? 12 : unclamped > 20 ? 20 : unclamped);
+    this.H = new RAnsDecoder(unclamped < 12 ? 12 : unclamped > 20 ? 20 : unclamped);
   }
   get numSymbols() {
-    return this.wb;
+    return this.ub;
   }
   // Initialize the decoder and decode the probability table. expectedCount is
   // the number of symbols the caller will decode (lets short streams skip the
@@ -1785,7 +1743,7 @@ var RAnsSymbolDecoder = class {
   create(buffer, expectedCount = 2147483647) {
     const numSymbols = decodeVarint(buffer);
     if (numSymbols === void 0) return false;
-    this.wb = numSymbols;
+    this.ub = numSymbols;
     if (Math.trunc(numSymbols / 64) > buffer.remainingSize) {
       return false;
     }
@@ -1818,7 +1776,7 @@ var RAnsSymbolDecoder = class {
       }
     }
     buffer.advance(pos - startPos);
-    return this.G.ransBuildLookUpTable(probabilityTable, numSymbols, expectedCount);
+    return this.H.ransBuildLookUpTable(probabilityTable, numSymbols, expectedCount);
   }
   // Starts decoding, advancing buffer past the encoded data.
   startDecoding(buffer) {
@@ -1829,10 +1787,10 @@ var RAnsSymbolDecoder = class {
     }
     const base = buffer.decodedSize;
     buffer.advance(Number(bytesEncoded));
-    return ansReadInit(this.G, buffer.data, base + Number(bytesEncoded), base, this.G.lRansBase, 4);
+    return ansReadInit(this.H, buffer.data, base + Number(bytesEncoded), base, this.H.lRansBase, 4);
   }
   endDecoding() {
-    this.G.readEnd();
+    this.H.readEnd();
   }
 };
 
@@ -1860,15 +1818,38 @@ function decodeTaggedSymbols(numValues, numComponents, srcBuffer, outValues) {
   if (numValues > 0 && tagDecoder.numSymbols === 0) {
     return false;
   }
-  const tagAns = tagDecoder.G;
+  const ans = tagDecoder.H;
+  const ansBuf = ans.buf;
+  const ansStart = ans.bufStart;
+  const lRansBase = ans.lRansBase;
+  const precisionBits = ans.ransPrecisionBits;
+  const precisionMask = ans.ransPrecisionMask;
+  const probTable = ans.probTable;
+  const cumProbTable = ans.cumProbTable;
+  const lutTable = ans.lutTable;
+  const bucketTable = ans.bucketTable;
+  const bucketShift = ans.bucketShift;
+  let state = ans.state;
+  let ansOffset = ans.bufOffset;
   srcBuffer.startBitDecoding(false);
   const bd = srcBuffer.ka;
-  const buf = bd.Da;
+  const buf = bd.Ea;
   const byteLength = bd.ja;
-  let bitOffset = bd.p;
+  let bitOffset = bd.o;
   let valueId = 0;
   for (let i = 0; i < numValues; i += numComponents) {
-    const bitLength = tagAns.ransRead();
+    while (state < lRansBase && ansOffset > ansStart) {
+      state = state << 8 | ansBuf[--ansOffset];
+    }
+    const rem = state & precisionMask;
+    let bitLength;
+    if (lutTable !== null) {
+      bitLength = lutTable[rem];
+    } else {
+      bitLength = bucketTable[rem >> bucketShift];
+      while (cumProbTable[bitLength + 1] <= rem) bitLength++;
+    }
+    state = (state >>> precisionBits) * probTable[bitLength] + rem - cumProbTable[bitLength];
     if (bitLength < 32) {
       const mask = (1 << bitLength) - 1;
       let j = 0;
@@ -1884,7 +1865,7 @@ function decodeTaggedSymbols(numValues, numComponents, srcBuffer, outValues) {
         outValues[valueId++] = value & mask;
       }
       if (j === numComponents) continue;
-      bd.p = bitOffset;
+      bd.o = bitOffset;
       for (; j < numComponents; ++j) {
         const val = bd.getBits(bitLength);
         if (val === void 0) {
@@ -1892,9 +1873,9 @@ function decodeTaggedSymbols(numValues, numComponents, srcBuffer, outValues) {
         }
         outValues[valueId++] = val;
       }
-      bitOffset = bd.p;
+      bitOffset = bd.o;
     } else {
-      bd.p = bitOffset;
+      bd.o = bitOffset;
       for (let j = 0; j < numComponents; ++j) {
         const val = bd.getBits(bitLength);
         if (val === void 0) {
@@ -1902,10 +1883,12 @@ function decodeTaggedSymbols(numValues, numComponents, srcBuffer, outValues) {
         }
         outValues[valueId++] = val;
       }
-      bitOffset = bd.p;
+      bitOffset = bd.o;
     }
   }
-  bd.p = bitOffset;
+  ans.state = state;
+  ans.bufOffset = ansOffset;
+  bd.o = bitOffset;
   tagDecoder.endDecoding();
   srcBuffer.endBitDecoding();
   return true;
@@ -1932,7 +1915,7 @@ function decodeRawSymbols(numValues, srcBuffer, outValues) {
   if (decoder === null) {
     return false;
   }
-  decoder.G.decodeSymbols(outValues, numValues);
+  decoder.H.decodeSymbols(outValues, numValues);
   decoder.endDecoding();
   return true;
 }
@@ -1983,16 +1966,16 @@ var RAnsBitDecoder = class {
 
 // src/decoder/compression/attributes/prediction_schemes/PredictionSchemeDecoder.ts
 var PredictionSchemeDecoder = class {
-  e;
+  d;
   constructor(transform) {
-    this.e = transform;
+    this.d = transform;
   }
   /** True if all correction values are guaranteed to be positive. */
   areCorrectionsPositive() {
-    return this.e.areCorrectionsPositive();
+    return this.d.areCorrectionsPositive();
   }
   boundsValues(limit) {
-    return this.e.boundsValues(limit);
+    return this.d.boundsValues(limit);
   }
   getNumParentAttributes() {
     return 0;
@@ -2004,7 +1987,7 @@ var PredictionSchemeDecoder = class {
     return false;
   }
   decodePredictionData(buffer) {
-    return this.e.decodeTransformData(buffer);
+    return this.d.decodeTransformData(buffer);
   }
   /**
    * Like computeOriginalValues, but inCorr still holds unsigned zigzag-coded
@@ -2080,12 +2063,12 @@ var MeshPredictionSchemeConstrainedMultiParallelogramDecoder = class extends Mes
     return super.decodePredictionData(buffer);
   }
   computeOriginalValues(inCorr, outData, _size, numComponents, _entryToPointIdMap) {
-    this.e.init(numComponents);
+    this.d.init(numComponents);
     const predVals = [];
     for (let i = 0; i < MAX_NUM_PARALLELOGRAMS; ++i) {
       predVals.push(new Int32Array(numComponents));
     }
-    this.e.computeOriginalValue(predVals[0], 0, inCorr, 0, outData, 0);
+    this.d.computeOriginalValue(predVals[0], 0, inCorr, 0, outData, 0);
     const table = this.b.cornerTable;
     const vertexToDataMap = this.b.vertexToDataMap;
     const oppositeCorners = table.oppositeCornerArray();
@@ -2144,12 +2127,12 @@ var MeshPredictionSchemeConstrainedMultiParallelogramDecoder = class extends Mes
       const dstOffset = p * numComponents;
       if (numUsedParallelograms === 0) {
         const srcOffset = (p - 1) * numComponents;
-        this.e.computeOriginalValue(outData, srcOffset, inCorr, dstOffset, outData, dstOffset);
+        this.d.computeOriginalValue(outData, srcOffset, inCorr, dstOffset, outData, dstOffset);
       } else {
         for (let c = 0; c < numComponents; ++c) {
           multiPredVals[c] = multiPredVals[c] / numUsedParallelograms | 0;
         }
-        this.e.computeOriginalValue(multiPredVals, 0, inCorr, dstOffset, outData, dstOffset);
+        this.d.computeOriginalValue(multiPredVals, 0, inCorr, dstOffset, outData, dstOffset);
       }
     }
     return true;
@@ -2218,38 +2201,38 @@ var MeshPredictionSchemeData = class {
 
 // src/decoder/compression/attributes/NormalCompressionUtils.ts
 var OctahedronToolBox = class {
-  L = -1;
+  K = -1;
   aa = -1;
-  k = -1;
+  l = -1;
   Vb = 1;
-  f = -1;
+  e = -1;
   // q: quantization bits, valid range 2..30.
   setQuantizationBits(q) {
     if (q < 2 || q > 30) return false;
-    this.L = q;
+    this.K = q;
     this.aa = (1 << q) - 1;
-    this.k = this.aa - 1;
-    this.Vb = Math.fround(2 / Math.fround(this.k));
-    this.f = this.k / 2 | 0;
+    this.l = this.aa - 1;
+    this.Vb = Math.fround(2 / Math.fround(this.l));
+    this.e = this.l / 2 | 0;
     return true;
   }
   quantizationBits() {
-    return this.L;
+    return this.K;
   }
   // Canonicalizes edge points into consistent quadrants. Writes result into
   // out[0], out[1] (caller-owned reusable 2-element array).
   canonicalizeOctahedralCoords(s, t, out) {
-    if (s === 0 && t === 0 || s === 0 && t === this.k || s === this.k && t === 0) {
-      s = this.k;
-      t = this.k;
-    } else if (s === 0 && t > this.f) {
-      t = this.f - (t - this.f);
-    } else if (s === this.k && t < this.f) {
-      t = this.f + (this.f - t);
-    } else if (t === this.k && s < this.f) {
-      s = this.f + (this.f - s);
-    } else if (t === 0 && s > this.f) {
-      s = this.f - (s - this.f);
+    if (s === 0 && t === 0 || s === 0 && t === this.l || s === this.l && t === 0) {
+      s = this.l;
+      t = this.l;
+    } else if (s === 0 && t > this.e) {
+      t = this.e - (t - this.e);
+    } else if (s === this.l && t < this.e) {
+      t = this.e + (this.e - t);
+    } else if (t === this.l && s < this.e) {
+      s = this.e + (this.e - s);
+    } else if (t === 0 && s > this.e) {
+      s = this.e - (s - this.e);
     }
     out[0] = s;
     out[1] = t;
@@ -2259,18 +2242,18 @@ var OctahedronToolBox = class {
   integerVectorToQuantizedOctahedralCoords(intVec, out) {
     let s, t;
     if (intVec[0] >= 0) {
-      s = intVec[1] + this.f;
-      t = intVec[2] + this.f;
+      s = intVec[1] + this.e;
+      t = intVec[2] + this.e;
     } else {
       if (intVec[1] < 0) {
         s = Math.abs(intVec[2]);
       } else {
-        s = this.k - Math.abs(intVec[2]);
+        s = this.l - Math.abs(intVec[2]);
       }
       if (intVec[2] < 0) {
         t = Math.abs(intVec[1]);
       } else {
-        t = this.k - Math.abs(intVec[1]);
+        t = this.l - Math.abs(intVec[1]);
       }
     }
     this.canonicalizeOctahedralCoords(s, t, out);
@@ -2279,14 +2262,14 @@ var OctahedronToolBox = class {
   canonicalizeIntegerVector(vec) {
     const absSum = Math.abs(vec[0]) + Math.abs(vec[1]) + Math.abs(vec[2]);
     if (absSum === 0) {
-      vec[0] = this.f;
+      vec[0] = this.e;
     } else {
-      vec[0] = Math.trunc(vec[0] * this.f / absSum);
-      vec[1] = Math.trunc(vec[1] * this.f / absSum);
+      vec[0] = Math.trunc(vec[0] * this.e / absSum);
+      vec[1] = Math.trunc(vec[1] * this.e / absSum);
       if (vec[2] >= 0) {
-        vec[2] = this.f - Math.abs(vec[0]) - Math.abs(vec[1]);
+        vec[2] = this.e - Math.abs(vec[0]) - Math.abs(vec[1]);
       } else {
-        vec[2] = -(this.f - Math.abs(vec[0]) - Math.abs(vec[1]));
+        vec[2] = -(this.e - Math.abs(vec[0]) - Math.abs(vec[1]));
       }
     }
   }
@@ -2296,38 +2279,23 @@ var OctahedronToolBox = class {
 
 // src/decoder/compression/attributes/prediction_schemes/MeshPredictionSchemeGeometricNormalPredictorArea.ts
 var UPPER_BOUND = 1 << 29;
-function fillInt32PositionCache(cache, att, map, numEntries, tempPos) {
-  const bufData = att.buffer && att.buffer.data;
-  if (att.dataType === 5 /* INT32 */ && att.numComponents === 3 && bufData) {
-    const src = new Int32Array(bufData.buffer);
-    const srcStart = bufData.byteOffset + att.byteOffset >> 2;
-    const stride = att.byteStride >> 2;
-    const isIdentity = att.isMappingIdentity;
-    const indicesMap = att.indicesMap;
-    if (isIdentity) {
-      for (let d = 0; d < numEntries; ++d) {
-        const srcOffset = srcStart + map[d] * stride;
-        const o = d * 3;
-        cache[o] = src[srcOffset];
-        cache[o + 1] = src[srcOffset + 1];
-        cache[o + 2] = src[srcOffset + 2];
-      }
-    } else {
-      for (let d = 0; d < numEntries; ++d) {
-        const srcOffset = srcStart + indicesMap[map[d]] * stride;
-        const o = d * 3;
-        cache[o] = src[srcOffset];
-        cache[o + 1] = src[srcOffset + 1];
-        cache[o + 2] = src[srcOffset + 2];
-      }
+function fillInt32PositionCache(cache, att, map, numEntries) {
+  const bytes = att.buffer.data;
+  const src = new Int32Array(bytes.buffer, bytes.byteOffset, bytes.length >> 2);
+  if (att.isMappingIdentity) {
+    for (let d = 0, o = 0; d < numEntries; ++d, o += 3) {
+      const s = map[d] * 3;
+      cache[o] = src[s];
+      cache[o + 1] = src[s + 1];
+      cache[o + 2] = src[s + 2];
     }
   } else {
-    for (let d = 0; d < numEntries; ++d) {
-      att.convertValue(att.mappedIndex(map[d]), tempPos);
-      const o = d * 3;
-      cache[o] = tempPos[0];
-      cache[o + 1] = tempPos[1];
-      cache[o + 2] = tempPos[2];
+    const indicesMap = att.indicesMap;
+    for (let d = 0, o = 0; d < numEntries; ++d, o += 3) {
+      const s = indicesMap[map[d]] * 3;
+      cache[o] = src[s];
+      cache[o + 1] = src[s + 1];
+      cache[o + 2] = src[s + 2];
     }
   }
 }
@@ -2335,12 +2303,8 @@ var MeshPredictionSchemeGeometricNormalPredictorArea = class {
   qa = null;
   ra = null;
   b;
-  Va = new Array(3);
-  sa = null;
-  // flat Int32 positions, indexed by data id
-  o = null;
-  xb = null;
-  // corner -> posCache offset, precomputed
+  // Per value: the area-weighted normal sum of its vertex's faces.
+  vb = null;
   constructor(meshData) {
     this.b = meshData;
   }
@@ -2350,86 +2314,52 @@ var MeshPredictionSchemeGeometricNormalPredictorArea = class {
   setEntryToPointIdMap(map) {
     this.ra = map;
   }
-  buildPositionCache(numEntries) {
-    const posCache = scratchInt32(numEntries * 3);
-    fillInt32PositionCache(posCache, this.qa, this.ra, numEntries, this.Va);
-    this.sa = posCache;
-    const table = this.b.cornerTable;
-    const cornerToVertex = table.cornerToVertexArray();
-    this.o = table.oppositeCornerArray();
+  // Sums every face's area vector into its corners' values (see above).
+  computeNormalSums(numEntries) {
+    const pos = scratchInt32(numEntries * 3);
+    fillInt32PositionCache(pos, this.qa, this.ra, numEntries);
+    const cornerToVertex = this.b.cornerTable.cornerToVertexArray();
     const vertexToDataMap = this.b.vertexToDataMap;
-    const nc = cornerToVertex.length;
-    const c2o = scratchInt32(nc);
-    for (let c = 0; c < nc; ++c) {
-      const v = cornerToVertex[c];
-      c2o[c] = v < 0 ? -1 : vertexToDataMap[v] * 3;
-    }
-    this.xb = c2o;
-  }
-  computePredictedValue(cornerId, prediction) {
-    const oppositeCorners = this.o;
-    const cornerToOffset = this.xb;
-    const posCache = this.sa;
-    const centerOffset = cornerToOffset[cornerId];
-    const centX = posCache[centerOffset];
-    const centY = posCache[centerOffset + 1];
-    const centZ = posCache[centerOffset + 2];
-    let normalX = 0, normalY = 0, normalZ = 0;
-    let currentCorner = cornerId;
-    let leftTraversal = true;
-    while (currentCorner >= 0) {
-      const rem = currentCorner - (currentCorner / 3 | 0) * 3;
-      const cNext = rem === 2 ? currentCorner - 2 : currentCorner + 1;
-      const cPrev = rem === 0 ? currentCorner + 2 : currentCorner - 1;
-      let posOffset = cornerToOffset[cNext];
-      const nextX = posCache[posOffset];
-      const nextY = posCache[posOffset + 1];
-      const nextZ = posCache[posOffset + 2];
-      posOffset = cornerToOffset[cPrev];
-      const prevX = posCache[posOffset];
-      const prevY = posCache[posOffset + 1];
-      const prevZ = posCache[posOffset + 2];
-      const dNextX = nextX - centX;
-      const dNextY = nextY - centY;
-      const dNextZ = nextZ - centZ;
-      const dPrevX = prevX - centX;
-      const dPrevY = prevY - centY;
-      const dPrevZ = prevZ - centZ;
-      normalX += dNextY * dPrevZ - dNextZ * dPrevY;
-      normalY += dNextZ * dPrevX - dNextX * dPrevZ;
-      normalZ += dNextX * dPrevY - dNextY * dPrevX;
-      if (leftTraversal) {
-        const opp = oppositeCorners[cNext];
-        if (opp < 0) {
-          currentCorner = -1;
-        } else {
-          const oppRem = opp - (opp / 3 | 0) * 3;
-          currentCorner = oppRem === 2 ? opp - 2 : opp + 1;
-        }
-        if (currentCorner < 0) {
-          const startRem = cornerId - (cornerId / 3 | 0) * 3;
-          const startPrev = startRem === 0 ? cornerId + 2 : cornerId - 1;
-          const startOpp = oppositeCorners[startPrev];
-          if (startOpp < 0) {
-            currentCorner = -1;
-          } else {
-            const startOppRem = startOpp - (startOpp / 3 | 0) * 3;
-            currentCorner = startOppRem === 0 ? startOpp + 2 : startOpp - 1;
-          }
-          leftTraversal = false;
-        } else if (currentCorner === cornerId) {
-          currentCorner = -1;
-        }
-      } else {
-        const opp = oppositeCorners[cPrev];
-        if (opp < 0) {
-          currentCorner = -1;
-        } else {
-          const oppRem = opp - (opp / 3 | 0) * 3;
-          currentCorner = oppRem === 0 ? opp + 2 : opp - 1;
-        }
-      }
-    }
+    const sums = new Float64Array(numEntries * 3);
+    const numCorners = cornerToVertex.length;
+    for (let c = 0; c < numCorners; c += 3) {
+      const v0 = cornerToVertex[c];
+      const v1 = cornerToVertex[c + 1];
+      const v2 = cornerToVertex[c + 2];
+      if ((v0 | v1 | v2) < 0) return false;
+      const o0 = vertexToDataMap[v0] * 3;
+      const o1 = vertexToDataMap[v1] * 3;
+      const o2 = vertexToDataMap[v2] * 3;
+      const x0 = pos[o0];
+      const y0 = pos[o0 + 1];
+      const z0 = pos[o0 + 2];
+      const ax = pos[o1] - x0;
+      const ay = pos[o1 + 1] - y0;
+      const az = pos[o1 + 2] - z0;
+      const bx = pos[o2] - x0;
+      const by = pos[o2 + 1] - y0;
+      const bz = pos[o2 + 2] - z0;
+      const nx = ay * bz - az * by;
+      const ny = az * bx - ax * bz;
+      const nz = ax * by - ay * bx;
+      sums[o0] += nx;
+      sums[o0 + 1] += ny;
+      sums[o0 + 2] += nz;
+      sums[o1] += nx;
+      sums[o1 + 1] += ny;
+      sums[o1 + 2] += nz;
+      sums[o2] += nx;
+      sums[o2 + 1] += ny;
+      sums[o2 + 2] += nz;
+    }
+    this.vb = sums;
+    return true;
+  }
+  computePredictedValue(dataId, prediction) {
+    const sums = this.vb;
+    let normalX = sums[dataId * 3];
+    let normalY = sums[dataId * 3 + 1];
+    let normalZ = sums[dataId * 3 + 2];
     const absSum = Math.abs(normalX) + Math.abs(normalY) + Math.abs(normalZ);
     if (absSum > UPPER_BOUND) {
       const quotient = Math.floor(absSum / UPPER_BOUND);
@@ -2446,12 +2376,12 @@ var MeshPredictionSchemeGeometricNormalPredictorArea = class {
 // src/decoder/compression/attributes/prediction_schemes/MeshPredictionSchemeGeometricNormalDecoder.ts
 var GEOMETRY_ATTRIBUTE_POSITION = 0;
 var MeshPredictionSchemeGeometricNormalDecoder = class extends MeshPredictionSchemeDecoder {
-  q;
+  p;
   w = new OctahedronToolBox();
-  Wa = new RAnsBitDecoder();
+  Ua = new RAnsBitDecoder();
   constructor(transform, meshData) {
     super(transform, meshData);
-    this.q = new MeshPredictionSchemeGeometricNormalPredictorArea(meshData);
+    this.p = new MeshPredictionSchemeGeometricNormalPredictorArea(meshData);
   }
   getNumParentAttributes() {
     return 1;
@@ -2462,34 +2392,33 @@ var MeshPredictionSchemeGeometricNormalDecoder = class extends MeshPredictionSch
   setParentAttribute(att) {
     if (att.attributeType !== GEOMETRY_ATTRIBUTE_POSITION) return false;
     if (att.numComponents !== 3) return false;
-    this.q.setPositionAttribute(att);
+    this.p.setPositionAttribute(att);
     return true;
   }
   decodePredictionData(buffer) {
-    if (!this.e.decodeTransformData(buffer)) return false;
-    return this.Wa.startDecoding(buffer);
+    if (!this.d.decodeTransformData(buffer)) return false;
+    return this.Ua.startDecoding(buffer);
   }
   computeOriginalValues(inCorr, outData, _size, _numComponents, entryToPointIdMap) {
-    this.w.setQuantizationBits(this.e.quantizationBits());
-    this.q.setEntryToPointIdMap(entryToPointIdMap);
+    this.w.setQuantizationBits(this.d.quantizationBits());
+    this.p.setEntryToPointIdMap(entryToPointIdMap);
     const cornerMapSize = this.b.dataToCornerMap.length;
-    this.q.buildPositionCache(cornerMapSize);
+    if (!this.p.computeNormalSums(cornerMapSize)) return false;
     const predNormal3D = new Int32Array(3);
     const predNormalOct = new Int32Array(2);
     for (let dataId = 0; dataId < cornerMapSize; ++dataId) {
-      const cornerId = this.b.dataToCornerMap[dataId];
-      this.q.computePredictedValue(cornerId, predNormal3D);
+      this.p.computePredictedValue(dataId, predNormal3D);
       this.w.canonicalizeIntegerVector(predNormal3D);
-      if (this.Wa.decodeNextBit()) {
+      if (this.Ua.decodeNextBit()) {
         predNormal3D[0] = -predNormal3D[0];
         predNormal3D[1] = -predNormal3D[1];
         predNormal3D[2] = -predNormal3D[2];
       }
       this.w.integerVectorToQuantizedOctahedralCoords(predNormal3D, predNormalOct);
       const dataOffset = dataId * 2;
-      this.e.computeOriginalValue(predNormalOct, 0, inCorr, dataOffset, outData, dataOffset);
+      this.d.computeOriginalValue(predNormalOct, 0, inCorr, dataOffset, outData, dataOffset);
     }
-    this.Wa.endDecoding();
+    this.Ua.endDecoding();
     return true;
   }
 };
@@ -2498,10 +2427,10 @@ var MeshPredictionSchemeGeometricNormalDecoder = class extends MeshPredictionSch
 var kInvalidCornerIndex3 = -1;
 var MeshPredictionSchemeMultiParallelogramDecoder = class extends MeshPredictionSchemeDecoder {
   computeOriginalValues(inCorr, outData, _size, numComponents, _entryToPointIdMap) {
-    this.e.init(numComponents);
+    this.d.init(numComponents);
     const predVals = new Int32Array(numComponents);
     const parallelogramPredVals = new Int32Array(numComponents);
-    this.e.computeOriginalValue(predVals, 0, inCorr, 0, outData, 0);
+    this.d.computeOriginalValue(predVals, 0, inCorr, 0, outData, 0);
     const table = this.b.cornerTable;
     const vertexToDataMap = this.b.vertexToDataMap;
     const oppositeCorners = table.oppositeCornerArray();
@@ -2538,12 +2467,12 @@ var MeshPredictionSchemeMultiParallelogramDecoder = class extends MeshPrediction
       const dstOffset = p * numComponents;
       if (numParallelograms === 0) {
         const srcOffset = (p - 1) * numComponents;
-        this.e.computeOriginalValue(outData, srcOffset, inCorr, dstOffset, outData, dstOffset);
+        this.d.computeOriginalValue(outData, srcOffset, inCorr, dstOffset, outData, dstOffset);
       } else {
         for (let c = 0; c < numComponents; ++c) {
           predVals[c] = predVals[c] / numParallelograms | 0;
         }
-        this.e.computeOriginalValue(predVals, 0, inCorr, dstOffset, outData, dstOffset);
+        this.d.computeOriginalValue(predVals, 0, inCorr, dstOffset, outData, dstOffset);
       }
     }
     return true;
@@ -2555,7 +2484,7 @@ var MeshPredictionSchemeParallelogramDecoder = class extends MeshPredictionSchem
   // Zigzag-fused variant: decodes corrections that are still in their unsigned
   // zigzag form, unpacking each one inline.
   computeOriginalValuesZigzag(inCorr, outData, _size, numComponents, _entryToPointIdMap) {
-    this.e.init(numComponents);
+    this.d.init(numComponents);
     return this.Wb(inCorr, outData, numComponents, true);
   }
   // The wrap transform's corrections are zigzag-coded; with `zigzag` set the
@@ -2575,9 +2504,9 @@ var MeshPredictionSchemeParallelogramDecoder = class extends MeshPredictionSchem
       return this.Zb(inCorr, outData, zigzag);
     }
     const parents = this.b.parallelogramParents();
-    const transform = this.e;
-    const minValue = transform.T;
-    const maxValue = transform.k;
+    const transform = this.d;
+    const minValue = transform.W;
+    const maxValue = transform.l;
     const maxDif = transform.ba;
     for (let c = 0; c < numComponents; ++c) {
       let pred = 0;
@@ -2643,9 +2572,9 @@ var MeshPredictionSchemeParallelogramDecoder = class extends MeshPredictionSchem
   }
   Xb(inCorr, outData, zigzag) {
     const parents = this.b.parallelogramParents();
-    const transform = this.e;
-    const minValue = transform.T;
-    const maxValue = transform.k;
+    const transform = this.d;
+    const minValue = transform.W;
+    const maxValue = transform.l;
     const maxDif = transform.ba;
     let pred0 = 0;
     let pred1 = 0;
@@ -2721,9 +2650,9 @@ var MeshPredictionSchemeParallelogramDecoder = class extends MeshPredictionSchem
   }
   Yb(inCorr, outData, zigzag) {
     const parents = this.b.parallelogramParents();
-    const transform = this.e;
-    const minValue = transform.T;
-    const maxValue = transform.k;
+    const transform = this.d;
+    const minValue = transform.W;
+    const maxValue = transform.l;
     const maxDif = transform.ba;
     let pred0 = 0;
     let pred1 = 0;
@@ -2830,9 +2759,9 @@ var MeshPredictionSchemeParallelogramDecoder = class extends MeshPredictionSchem
   // structure as the 2/3-component loops.
   Zb(inCorr, outData, zigzag) {
     const parents = this.b.parallelogramParents();
-    const transform = this.e;
-    const minValue = transform.T;
-    const maxValue = transform.k;
+    const transform = this.d;
+    const minValue = transform.W;
+    const maxValue = transform.l;
     const maxDif = transform.ba;
     let pred0 = 0;
     if (pred0 > maxValue) {
@@ -2938,14 +2867,13 @@ function bigIntSqrt(value) {
 var MeshPredictionSchemeTexCoordsPortablePredictor = class {
   qa = null;
   ra = null;
-  r = new Int32Array(2);
-  Ja = new Uint8Array(0);
-  ta = 0;
+  q = new Int32Array(2);
+  Ja = EMPTY_UINT8;
+  sa = 0;
   b;
-  Va = new Array(3);
   // Flat Int32 position cache so fetches are array reads, not convertValue calls.
-  sa = null;
-  h = null;
+  wb = null;
+  i = null;
   constructor(meshData) {
     this.b = meshData;
   }
@@ -2956,26 +2884,26 @@ var MeshPredictionSchemeTexCoordsPortablePredictor = class {
     this.ra = map;
   }
   get predictedValue() {
-    return this.r;
+    return this.q;
   }
   resizeOrientations(numOrientations) {
     this.Ja = new Uint8Array(numOrientations);
-    this.ta = numOrientations;
+    this.sa = numOrientations;
   }
   setOrientation(i, v) {
     this.Ja[i] = v ? 1 : 0;
   }
   buildPositionCache(numEntries) {
     const posCache = new Int32Array(numEntries * 3);
-    fillInt32PositionCache(posCache, this.qa, this.ra, numEntries, this.Va);
-    this.sa = posCache;
-    this.h = this.b.cornerTable.cornerToVertexArray();
+    fillInt32PositionCache(posCache, this.qa, this.ra, numEntries);
+    this.wb = posCache;
+    this.i = this.b.cornerTable.cornerToVertexArray();
   }
   computePredictedValue(cornerId, data, dataId) {
     const rem = cornerId - (cornerId / 3 | 0) * 3;
     const nextCornerId = rem === 2 ? cornerId - 2 : cornerId + 1;
     const prevCornerId = rem === 0 ? cornerId + 2 : cornerId - 1;
-    const cornerToVertex = this.h;
+    const cornerToVertex = this.i;
     const nextVertId = cornerToVertex[nextCornerId];
     const prevVertId = cornerToVertex[prevCornerId];
     const vertexToDataMap = this.b.vertexToDataMap;
@@ -2987,11 +2915,11 @@ var MeshPredictionSchemeTexCoordsPortablePredictor = class {
       const nUV0 = data[nDataOff], nUV1 = data[nDataOff + 1];
       const pUV0 = data[pDataOff], pUV1 = data[pDataOff + 1];
       if (pUV0 === nUV0 && pUV1 === nUV1) {
-        this.r[0] = pUV0;
-        this.r[1] = pUV1;
+        this.q[0] = pUV0;
+        this.q[1] = pUV1;
         return true;
       }
-      const posCache = this.sa;
+      const posCache = this.wb;
       let posOffset = dataId * 3;
       const tip0 = posCache[posOffset];
       const tip1 = posCache[posOffset + 1];
@@ -3015,19 +2943,12 @@ var MeshPredictionSchemeTexCoordsPortablePredictor = class {
         const cnDotPn = pn0 * cn0 + pn1 * cn1 + pn2 * cn2;
         const pnUV0 = pUV0 - nUV0;
         const pnUV1 = pUV1 - nUV1;
-        const INT64_MAX = 2 ** 63;
         const nUVAbsMax = Math.max(Math.abs(nUV0), Math.abs(nUV1));
-        if (nUVAbsMax > INT64_MAX / pnNorm2Squared) {
-          return false;
-        }
         const pnUVAbsMax = Math.max(Math.abs(pnUV0), Math.abs(pnUV1));
-        if (pnUVAbsMax > 0 && Math.abs(cnDotPn) > INT64_MAX / pnUVAbsMax) {
-          return false;
-        }
         const cnNorm2 = cn0 * cn0 + cn1 * cn1 + cn2 * cn2;
         const pnAbsMaxG = Math.max(Math.abs(pn0), Math.abs(pn1), Math.abs(pn2));
         const cnDotPnAbs = Math.abs(cnDotPn);
-        if (cnNorm2 > SAFE_PRODUCT / pnNorm2Squared || nUVAbsMax > SAFE_PRODUCT / pnNorm2Squared || pnUVAbsMax > 0 && cnDotPnAbs > SAFE_PRODUCT / pnUVAbsMax || pnAbsMaxG > 0 && cnDotPnAbs > SAFE_PRODUCT / pnAbsMaxG) {
+        if (!(cnNorm2 * pnNorm2Squared < SAFE_PRODUCT && nUVAbsMax * pnNorm2Squared < SAFE_PRODUCT && cnDotPnAbs * pnUVAbsMax < SAFE_PRODUCT && cnDotPnAbs * pnAbsMaxG < SAFE_PRODUCT)) {
           return this._b(
             tip0,
             tip1,
@@ -3047,9 +2968,6 @@ var MeshPredictionSchemeTexCoordsPortablePredictor = class {
         }
         const xUV0 = nUV0 * pnNorm2Squared + cnDotPn * pnUV0;
         const xUV1 = nUV1 * pnNorm2Squared + cnDotPn * pnUV1;
-        if (pnAbsMaxG > 0 && cnDotPnAbs > INT64_MAX / pnAbsMaxG) {
-          return false;
-        }
         const xPos0 = next0 + Math.trunc(cnDotPn * pn0 / pnNorm2Squared);
         const xPos1 = next1 + Math.trunc(cnDotPn * pn1 / pnNorm2Squared);
         const xPos2 = next2 + Math.trunc(cnDotPn * pn2 / pnNorm2Squared);
@@ -3060,16 +2978,16 @@ var MeshPredictionSchemeTexCoordsPortablePredictor = class {
         const normSquared = Math.floor(Math.sqrt(cxNorm2Squared * pnNorm2Squared));
         const cxUV0 = pnUV1 * normSquared;
         const cxUV1 = -pnUV0 * normSquared;
-        if (this.ta === 0) {
+        if (this.sa === 0) {
           return false;
         }
-        const orientation = this.Ja[--this.ta];
+        const orientation = this.Ja[--this.sa];
         if (orientation) {
-          this.r[0] = Math.trunc((xUV0 + cxUV0) / pnNorm2Squared);
-          this.r[1] = Math.trunc((xUV1 + cxUV1) / pnNorm2Squared);
+          this.q[0] = Math.trunc((xUV0 + cxUV0) / pnNorm2Squared);
+          this.q[1] = Math.trunc((xUV1 + cxUV1) / pnNorm2Squared);
         } else {
-          this.r[0] = Math.trunc((xUV0 - cxUV0) / pnNorm2Squared);
-          this.r[1] = Math.trunc((xUV1 - cxUV1) / pnNorm2Squared);
+          this.q[0] = Math.trunc((xUV0 - cxUV0) / pnNorm2Squared);
+          this.q[1] = Math.trunc((xUV1 - cxUV1) / pnNorm2Squared);
         }
         return true;
       }
@@ -3084,13 +3002,13 @@ var MeshPredictionSchemeTexCoordsPortablePredictor = class {
       if (dataId > 0) {
         dataOffset = (dataId - 1) * 2;
       } else {
-        this.r[0] = 0;
-        this.r[1] = 0;
+        this.q[0] = 0;
+        this.q[1] = 0;
         return true;
       }
     }
-    this.r[0] = data[dataOffset];
-    this.r[1] = data[dataOffset + 1];
+    this.q[0] = data[dataOffset];
+    this.q[1] = data[dataOffset + 1];
     return true;
   }
   // 64-bit-exact projection prediction, used when the double path would lose
@@ -3132,8 +3050,8 @@ var MeshPredictionSchemeTexCoordsPortablePredictor = class {
     const normSquared = bigIntSqrt(cxNorm2 * pnN2 & MASK64);
     const cxUV0 = B.asIntN(64, pnUV1 * normSquared);
     const cxUV1 = B.asIntN(64, -pnUV0 * normSquared);
-    if (this.ta === 0) return false;
-    const orientation = this.Ja[--this.ta];
+    if (this.sa === 0) return false;
+    const orientation = this.Ja[--this.sa];
     let s0, s1;
     if (orientation) {
       s0 = B.asUintN(64, B.asUintN(64, xUV0) + B.asUintN(64, cxUV0));
@@ -3142,8 +3060,8 @@ var MeshPredictionSchemeTexCoordsPortablePredictor = class {
       s0 = B.asUintN(64, B.asUintN(64, xUV0) - B.asUintN(64, cxUV0));
       s1 = B.asUintN(64, B.asUintN(64, xUV1) - B.asUintN(64, cxUV1));
     }
-    this.r[0] = Number(B.asIntN(32, B.asIntN(64, s0) / pnN2));
-    this.r[1] = Number(B.asIntN(32, B.asIntN(64, s1) / pnN2));
+    this.q[0] = Number(B.asIntN(32, B.asIntN(64, s0) / pnN2));
+    this.q[1] = Number(B.asIntN(32, B.asIntN(64, s1) / pnN2));
     return true;
   }
 };
@@ -3151,10 +3069,10 @@ var MeshPredictionSchemeTexCoordsPortablePredictor = class {
 // src/decoder/compression/attributes/prediction_schemes/MeshPredictionSchemeTexCoordsPortableDecoder.ts
 var GEOMETRY_ATTRIBUTE_POSITION2 = 0;
 var MeshPredictionSchemeTexCoordsPortableDecoder = class extends MeshPredictionSchemeDecoder {
-  q;
+  p;
   constructor(transform, meshData) {
     super(transform, meshData);
-    this.q = new MeshPredictionSchemeTexCoordsPortablePredictor(meshData);
+    this.p = new MeshPredictionSchemeTexCoordsPortablePredictor(meshData);
   }
   getNumParentAttributes() {
     return 1;
@@ -3165,13 +3083,13 @@ var MeshPredictionSchemeTexCoordsPortableDecoder = class extends MeshPredictionS
   setParentAttribute(att) {
     if (att.attributeType !== GEOMETRY_ATTRIBUTE_POSITION2) return false;
     if (att.numComponents !== 3) return false;
-    this.q.setPositionAttribute(att);
+    this.p.setPositionAttribute(att);
     return true;
   }
   decodePredictionData(buffer) {
     const numOrientations = buffer.decodeInt32();
     if (numOrientations === void 0 || numOrientations < 0) return false;
-    this.q.resizeOrientations(numOrientations);
+    this.p.resizeOrientations(numOrientations);
     let lastOrientation = true;
     const decoder = new RAnsBitDecoder();
     if (!decoder.startDecoding(buffer)) return false;
@@ -3179,7 +3097,7 @@ var MeshPredictionSchemeTexCoordsPortableDecoder = class extends MeshPredictionS
       if (!decoder.decodeNextBit()) {
         lastOrientation = !lastOrientation;
       }
-      this.q.setOrientation(i, lastOrientation);
+      this.p.setOrientation(i, lastOrientation);
     }
     decoder.endDecoding();
     return super.decodePredictionData(buffer);
@@ -3188,17 +3106,17 @@ var MeshPredictionSchemeTexCoordsPortableDecoder = class extends MeshPredictionS
     if (numComponents !== 2) {
       return false;
     }
-    this.q.setEntryToPointIdMap(entryToPointIdMap);
-    this.e.init(numComponents);
+    this.p.setEntryToPointIdMap(entryToPointIdMap);
+    this.d.init(numComponents);
     const cornerMapSize = this.b.dataToCornerMap.length;
-    this.q.buildPositionCache(cornerMapSize);
+    this.p.buildPositionCache(cornerMapSize);
     for (let p = 0; p < cornerMapSize; ++p) {
       const cornerId = this.b.dataToCornerMap[p];
-      if (!this.q.computePredictedValue(cornerId, outData, p)) {
+      if (!this.p.computePredictedValue(cornerId, outData, p)) {
         return false;
       }
       const dstOffset = p * numComponents;
-      this.e.computeOriginalValue(this.q.predictedValue, 0, inCorr, dstOffset, outData, dstOffset);
+      this.d.computeOriginalValue(this.p.predictedValue, 0, inCorr, dstOffset, outData, dstOffset);
     }
     return true;
   }
@@ -3207,7 +3125,7 @@ var MeshPredictionSchemeTexCoordsPortableDecoder = class extends MeshPredictionS
 // src/decoder/compression/attributes/prediction_schemes/PredictionSchemeDeltaDecoder.ts
 var PredictionSchemeDeltaDecoder = class extends PredictionSchemeDecoder {
   computeOriginalValues(inCorr, outData, size, numComponents, _entryToPointIdMap) {
-    const transform = this.e;
+    const transform = this.d;
     transform.init(numComponents);
     if (transform.computeOriginalValuesDelta) {
       transform.computeOriginalValuesDelta(inCorr, outData, size, numComponents);
@@ -3263,8 +3181,8 @@ function createPredictionSchemeForDecoder(method, attId, decoder, transform) {
 // src/decoder/compression/attributes/prediction_schemes/PredictionSchemeWrapDecodingTransform.ts
 var PredictionSchemeWrapDecodingTransform = class {
   v = 0;
-  T = 0;
-  k = 0;
+  W = 0;
+  l = 0;
   ba = 0;
   getType() {
     return 1 /* PREDICTION_TRANSFORM_WRAP */;
@@ -3276,12 +3194,12 @@ var PredictionSchemeWrapDecodingTransform = class {
     return false;
   }
   boundsValues(limit) {
-    return this.k < limit && this.T > -limit;
+    return this.l < limit && this.W > -limit;
   }
   computeOriginalValue(predictedVals, predictedOffset, corrVals, corrOffset, outOriginalVals, outOffset) {
     const nc = this.v;
-    const minValue = this.T;
-    const maxValue = this.k;
+    const minValue = this.W;
+    const maxValue = this.l;
     const maxDif = this.ba;
     for (let i = 0; i < nc; ++i) {
       let pred = predictedVals[predictedOffset + i];
@@ -3306,8 +3224,8 @@ var PredictionSchemeWrapDecodingTransform = class {
     if (maxValue === void 0) return false;
     const dif = maxValue - minValue;
     if (dif < 0 || dif >= 2147483647) return false;
-    this.T = minValue;
-    this.k = maxValue;
+    this.W = minValue;
+    this.l = maxValue;
     this.ba = 1 + dif;
     return true;
   }
@@ -3315,25 +3233,27 @@ var PredictionSchemeWrapDecodingTransform = class {
 
 // src/decoder/compression/attributes/SequentialIntegerAttributeDecoder.ts
 var SequentialIntegerAttributeDecoder = class extends SequentialAttributeDecoder {
-  M = null;
+  L = null;
   // Two-phase decode state (see SequentialAttributeDecoder): the parse phase
   // stashes the primed raw-symbol stream here so the controller can batch and
   // pair several attributes' decodes; the finish phase consumes it.
   ca = null;
-  Xa = 0;
-  yb = null;
-  // Int32 view over the portable attribute's storage (see preparePortableAttribute).
-  U = null;
+  Va = 0;
+  xb = null;
+  // The decoded (portable) values, numComponents per entry (see
+  // preparePortableAttribute).
+  M = null;
+  yb = 0;
   // --- Two-phase decode (parse headers / batch symbol decode / finish) ---
   pendingSymbolStream() {
     if (this.ca === null) {
       return null;
     }
-    const portableData = this.U;
+    const portableData = this.M;
     return {
-      ans: this.ca.G,
-      out: new Uint32Array(portableData.buffer, portableData.byteOffset, this.Xa),
-      count: this.Xa
+      ans: this.ca.H,
+      out: new Uint32Array(portableData.buffer, portableData.byteOffset, this.Va),
+      count: this.Va
     };
   }
   decodePortableAttributeFinish() {
@@ -3341,13 +3261,13 @@ var SequentialIntegerAttributeDecoder = class extends SequentialAttributeDecoder
       this.ca.endDecoding();
       this.ca = null;
     }
-    return this.$b(this.yb);
+    return this.$b(this.xb);
   }
   // The parse phase of the integer decode: prediction scheme, portable
   // attribute, the symbol stream (raw streams are deferred to the finish
   // phase) and the prediction data.
   decodeValues(pointIds, buffer) {
-    this.yb = pointIds;
+    this.xb = pointIds;
     let predictionSchemeMethod = buffer.decodeUint8();
     if (predictionSchemeMethod !== void 0) predictionSchemeMethod = predictionSchemeMethod << 24 >> 24;
     if (predictionSchemeMethod === void 0) return false;
@@ -3361,10 +3281,10 @@ var SequentialIntegerAttributeDecoder = class extends SequentialAttributeDecoder
       if (predictionTransformType < -1 /* PREDICTION_TRANSFORM_NONE */ || predictionTransformType >= 4 /* NUM_PREDICTION_SCHEME_TRANSFORM_TYPES */) {
         return false;
       }
-      this.M = this.createIntPredictionScheme(predictionSchemeMethod, predictionTransformType);
+      this.L = this.createIntPredictionScheme(predictionSchemeMethod, predictionTransformType);
     }
-    if (this.M) {
-      if (!this.initPredictionScheme(this.M)) {
+    if (this.L) {
+      if (!this.initPredictionScheme(this.L)) {
         return false;
       }
     }
@@ -3375,7 +3295,7 @@ var SequentialIntegerAttributeDecoder = class extends SequentialAttributeDecoder
     const numEntries = pointIds.length;
     const numValues = numEntries * numComponents;
     this.preparePortableAttribute(numEntries, numComponents);
-    const portableAttributeData = this.U;
+    const portableAttributeData = this.M;
     if (portableAttributeData === null) {
       return false;
     }
@@ -3390,7 +3310,7 @@ var SequentialIntegerAttributeDecoder = class extends SequentialAttributeDecoder
             return false;
           }
           this.ca = decoder;
-          this.Xa = numValues;
+          this.Va = numValues;
         } else if (scheme === 0 /* SYMBOL_CODING_TAGGED */) {
           const outUint32 = new Uint32Array(portableAttributeData.buffer, portableAttributeData.byteOffset, numValues);
           if (!decodeTaggedSymbols(numValues, numComponents, buffer, outUint32)) {
@@ -3414,8 +3334,8 @@ var SequentialIntegerAttributeDecoder = class extends SequentialAttributeDecoder
         portableAttributeData[i] = val;
       }
     }
-    if (this.M) {
-      if (!this.M.decodePredictionData(buffer)) {
+    if (this.L) {
+      if (!this.L.decodePredictionData(buffer)) {
         return false;
       }
     }
@@ -3425,14 +3345,14 @@ var SequentialIntegerAttributeDecoder = class extends SequentialAttributeDecoder
   $b(pointIds) {
     const numComponents = this.getNumValueComponents();
     const numValues = pointIds.length * numComponents;
-    const data = this.U;
+    const data = this.M;
     if (data === null) {
       return false;
     }
     if (numValues === 0) {
       return true;
     }
-    const ps = this.M;
+    const ps = this.L;
     if (ps === null) {
       convertSymbolsToSignedInts(new Uint32Array(data.buffer, data.byteOffset, numValues), numValues, data);
       return true;
@@ -3447,7 +3367,7 @@ var SequentialIntegerAttributeDecoder = class extends SequentialAttributeDecoder
     return ps.computeOriginalValues(data, data, numValues, numComponents, pointIds);
   }
   transformAttributeToOriginalFormat(pointIds) {
-    return this.Ya(pointIds.length);
+    return this.Wa(pointIds.length);
   }
   // Prediction scheme for decoding integer values; subclasses override for others.
   createIntPredictionScheme(method, transformType) {
@@ -3465,43 +3385,59 @@ var SequentialIntegerAttributeDecoder = class extends SequentialAttributeDecoder
   // see PointAttribute._lazyFloatValues): true when a prediction transform
   // clamps them into such a range. Unpredicted values are unbounded.
   zb() {
-    return this.M !== null && this.M.boundsValues(16777216);
+    return this.L !== null && this.L.boundsValues(16777216);
   }
   // The decoded values stay in the portable attribute; the final attribute
   // only takes its size (see PointAttribute.setLazyInteger and the overrides
   // in the quantization / normal decoders).
-  vb(numValues) {
+  tb(numValues) {
     this.attribute.resetLazy(numValues);
     return true;
   }
   // Hands the decoded integer values to the attribute, converted to its
   // integer type on extraction.
-  Ya(_numValues) {
+  Wa(_numValues) {
     const dt = this.attribute.dataType;
     if (dt < 1 /* INT8 */ || dt > 6 /* UINT32 */) {
       return false;
     }
-    this.attribute.setLazyInteger(this.U);
+    this.attribute.setLazyInteger(this.M);
     return true;
   }
+  // Heap-backed: the decoded values are what the final attribute hands out
+  // (see _storeValues), so they outlive the decode. The portable
+  // PointAttribute around them is only built if a dependent attribute's
+  // predictor asks for it (see getPortableAttribute).
   preparePortableAttribute(numEntries, numComponents) {
-    const ga = new GeometryAttribute();
-    ga.init(
-      this.attribute.attributeType,
-      null,
-      numComponents,
-      5 /* INT32 */,
-      false,
-      numComponents * dataTypeLength(5 /* INT32 */),
-      0
-    );
-    const portAtt = new PointAttribute(ga);
-    portAtt.setIdentityMapping();
-    portAtt.reset(numEntries);
-    portAtt.uniqueId = this.attribute.uniqueId;
-    this.$ = portAtt;
-    const data = portAtt.buffer.data;
-    this.U = numEntries === 0 ? null : new Int32Array(data.buffer, data.byteOffset + portAtt.byteOffset, numEntries * numComponents);
+    this.yb = numComponents;
+    this.M = numEntries === 0 ? null : new Int32Array(numEntries * numComponents);
+  }
+  getPortableAttribute() {
+    const numComponents = this.yb;
+    if (this.V === null && numComponents > 0) {
+      const ga = new GeometryAttribute();
+      ga.init(
+        this.attribute.attributeType,
+        null,
+        numComponents,
+        5 /* INT32 */,
+        false,
+        numComponents * dataTypeLength(5 /* INT32 */),
+        0
+      );
+      const portAtt = new PointAttribute(ga);
+      portAtt.setIdentityMapping();
+      const data = this.M;
+      if (data === null) portAtt.reset(0);
+      else
+        portAtt.resetWithData(
+          new Uint8Array(data.buffer, data.byteOffset, data.byteLength),
+          data.length / numComponents
+        );
+      portAtt.uniqueId = this.attribute.uniqueId;
+      this.V = portAtt;
+    }
+    return super.getPortableAttribute();
   }
 };
 
@@ -3549,7 +3485,7 @@ var PredictionSchemeNormalOctahedronCanonicalizedDecodingTransform = class exten
   }
   computeOriginalValue(predVals, predOffset, corrVals, corrOffset, outOrigVals, outOffset) {
     const toolBox = this.w;
-    const center = toolBox.f;
+    const center = toolBox.e;
     const maxQuantizedValue = toolBox.aa;
     const corrS = corrVals[corrOffset];
     const corrT = corrVals[corrOffset + 1];
@@ -3677,7 +3613,7 @@ var PredictionSchemeNormalOctahedronCanonicalizedDecodingTransform = class exten
   // sync; only the plumbing differs.
   computeOriginalValuesDelta(inCorr, outData, size, numComponents) {
     const toolBox = this.w;
-    const center = toolBox.f;
+    const center = toolBox.e;
     const maxQuantizedValue = toolBox.aa;
     let prevS = 0;
     let prevT = 0;
@@ -3816,7 +3752,7 @@ var PredictionSchemeNormalOctahedronDecodingTransform = class extends Prediction
   }
   computeOriginalValue(predVals, predOffset, corrVals, corrOffset, outOrigVals, outOffset) {
     const toolBox = this.w;
-    const center = toolBox.f;
+    const center = toolBox.e;
     const maxQuantizedValue = toolBox.aa;
     const predS = predVals[predOffset] - center;
     const predT = predVals[predOffset + 1] - center;
@@ -3896,7 +3832,7 @@ var PredictionSchemeNormalOctahedronDecodingTransform = class extends Prediction
 
 // src/decoder/compression/attributes/SequentialNormalAttributeDecoder.ts
 var SequentialNormalAttributeDecoder = class extends SequentialIntegerAttributeDecoder {
-  L = -1;
+  K = -1;
   init(decoder, attributeId) {
     if (!super.init(decoder, attributeId)) {
       return false;
@@ -3911,16 +3847,16 @@ var SequentialNormalAttributeDecoder = class extends SequentialIntegerAttributeD
   decodeDataNeededByPortableTransform(_pointIds, buffer) {
     const qBits = buffer.decodeUint8();
     if (qBits === void 0) return false;
-    this.L = qBits;
+    this.K = qBits;
     return true;
   }
   // The octahedral-to-unit-vector transform is deferred to extractTo (see
   // PointAttribute.setLazyOctahedron).
-  Ya(_numPoints) {
-    const q = this.L;
+  Wa(_numPoints) {
+    const q = this.K;
     if (q < 2 || q > 30) return false;
     this.attribute.setLazyOctahedron(
-      this.U,
+      this.M,
       Math.fround(2 / Math.fround((1 << q) - 2)),
       this.zb()
     );
@@ -3937,8 +3873,8 @@ var SequentialNormalAttributeDecoder = class extends SequentialIntegerAttributeD
 
 // src/decoder/compression/attributes/SequentialQuantizationAttributeDecoder.ts
 var SequentialQuantizationAttributeDecoder = class extends SequentialIntegerAttributeDecoder {
-  L = -1;
-  Za = [];
+  K = -1;
+  Xa = [];
   Bb = 0;
   init(decoder, attributeId) {
     if (!super.init(decoder, attributeId)) {
@@ -3949,39 +3885,39 @@ var SequentialQuantizationAttributeDecoder = class extends SequentialIntegerAttr
   // The quantization parameters (AttributeQuantizationTransform::DecodeParameters).
   decodeDataNeededByPortableTransform(_pointIds, buffer) {
     const numComponents = this.attribute.numComponents;
-    this.Za = new Array(numComponents);
+    this.Xa = new Array(numComponents);
     for (let i = 0; i < numComponents; i++) {
       const val = buffer.decodeFloat32();
       if (val === void 0) return false;
-      this.Za[i] = val;
+      this.Xa[i] = val;
     }
     const range = buffer.decodeFloat32();
     if (range === void 0) return false;
     this.Bb = range;
     const qBits = buffer.decodeUint8();
     if (qBits === void 0 || qBits < 1 || qBits > 30) return false;
-    this.L = qBits;
+    this.K = qBits;
     return true;
   }
   // Dequantization is deferred to extractTo (see PointAttribute.setLazyQuantized).
-  Ya(_numValues) {
-    const maxQuantizedValue = (1 << this.L >>> 0) - 1;
+  Wa(_numValues) {
+    const maxQuantizedValue = (1 << this.K >>> 0) - 1;
     if (maxQuantizedValue <= 0) return false;
     const delta = Math.fround(this.Bb / Math.fround(maxQuantizedValue));
-    this.attribute.setLazyQuantized(this.U, this.Za, delta, this.zb());
+    this.attribute.setLazyQuantized(this.M, this.Xa, delta, this.zb());
     return true;
   }
 };
 
 // src/decoder/compression/attributes/SequentialAttributeDecodersController.ts
 var SequentialAttributeDecodersController = class extends AttributesDecoder {
-  ua = [];
+  da = [];
   // Replaced by the sequencer's output in _prepareSequence.
-  Ka = new Int32Array(0);
-  V;
+  Ka = EMPTY_INT32;
+  X;
   constructor(sequencer) {
     super();
-    this.V = sequencer;
+    this.X = sequencer;
   }
   decodeAttributesDecoderData(buffer) {
     if (!super.decodeAttributesDecoderData(buffer)) {
@@ -3995,19 +3931,21 @@ var SequentialAttributeDecodersController = class extends AttributesDecoder {
       if (decoder === null || !decoder.init(this.getDecoder(), this.getAttributeId(i))) {
         return false;
       }
-      this.ua[i] = decoder;
+      this.da[i] = decoder;
     }
     return true;
   }
-  ac() {
-    if (!this.V.generateSequence()) {
+  ac(buffer) {
+    const first = this.da[0];
+    const parallelogram = first instanceof SequentialIntegerAttributeDecoder && buffer.remainingSize > 0 && buffer.data[buffer.decodedSize] === 1 /* MESH_PREDICTION_PARALLELOGRAM */;
+    if (!this.X.generateSequence(parallelogram)) {
       return false;
     }
-    this.Ka = this.V.getOutputPointIds();
+    this.Ka = this.X.getOutputPointIds();
     const numAttributes = this.getNumAttributes();
     for (let i = 0; i < numAttributes; i++) {
       const pa = this.getDecoder().pointCloud().attribute(this.getAttributeId(i));
-      if (!this.V.updatePointToAttributeIndexMapping(pa)) {
+      if (!this.X.updatePointToAttributeIndexMapping(pa)) {
         return false;
       }
     }
@@ -4021,10 +3959,10 @@ var SequentialAttributeDecodersController = class extends AttributesDecoder {
   // of the finish work reads the buffer, and dependents only read parent
   // portable VALUES in finish, so ordering and output stay identical.
   decodeAttributesParse(buffer) {
-    if (!this.ac()) {
+    if (!this.ac(buffer)) {
       return false;
     }
-    const decoders = this.ua;
+    const decoders = this.da;
     for (let i = 0; i < decoders.length; i++) {
       if (!decoders[i].decodePortableAttributeParse(this.Ka, buffer)) {
         return false;
@@ -4038,7 +3976,7 @@ var SequentialAttributeDecodersController = class extends AttributesDecoder {
     return true;
   }
   collectPendingSymbolStreams(out) {
-    const decoders = this.ua;
+    const decoders = this.da;
     for (let i = 0; i < decoders.length; i++) {
       const pending = decoders[i].pendingSymbolStream();
       if (pending !== null) {
@@ -4047,7 +3985,7 @@ var SequentialAttributeDecodersController = class extends AttributesDecoder {
     }
   }
   decodeAttributesFinish() {
-    const decoders = this.ua;
+    const decoders = this.da;
     for (let i = 0; i < decoders.length; i++) {
       if (!decoders[i].decodePortableAttributeFinish()) {
         return false;
@@ -4065,7 +4003,7 @@ var SequentialAttributeDecodersController = class extends AttributesDecoder {
     if (locId < 0) {
       return null;
     }
-    return this.ua[locId].getPortableAttribute();
+    return this.da[locId].getPortableAttribute();
   }
   createSequentialDecoder(decoderType) {
     switch (decoderType) {
@@ -4104,27 +4042,35 @@ var kInvalidFaceIndex = -1;
 var kInvalidVertexIndex = -1;
 var DepthFirstTraverser = class {
   a = null;
-  va = null;
-  W = null;
+  ta = null;
+  ua = null;
   Cb = [];
-  da = 0;
+  va = 0;
   // Identifies the traversal order for the shared traversal cache
   // (MESH_TRAVERSAL_DEPTH_FIRST). See MeshTraversalSequencer.
   Db = 0;
   // The sequencer derives the point id sequence from the corner map after
-  // the traversal (see traverseFromCorner).
+  // the traversal (see traverseAll).
   emitsPointIds = false;
-  h = null;
-  o = null;
-  y = null;
-  H = 0;
+  i = null;
+  t = null;
+  z = null;
+  I = 0;
+  // When set (see MeshTraversalSequencer.generateSequence), each new value's
+  // parallelogram parents are recorded here as it is numbered: parents[3p ..
+  // 3p+2] are the value ids of the vertices of the face opposite its corner,
+  // or parents[3p] is -1 when that face is missing or has a vertex not
+  // numbered yet -- exactly MeshPredictionSchemeData.parallelogramParents'
+  // "parent decoded after it" test, since values are numbered in order.
+  // The traversal has just touched those corners, so they are read hot.
+  Eb = null;
   init(cornerTable, observer) {
     this.a = cornerTable;
-    this.va = observer;
-    this.h = cornerTable.cornerToVertexArray();
-    this.o = cornerTable.oppositeCornerArray();
-    this.y = cornerTable.vertexOnBoundaryArray();
-    this.H = cornerTable.numCorners();
+    this.ta = observer;
+    this.i = cornerTable.cornerToVertexArray();
+    this.t = cornerTable.oppositeCornerArray();
+    this.z = cornerTable.vertexOnBoundaryArray();
+    this.I = cornerTable.numCorners();
   }
   cornerTable() {
     return this.a;
@@ -4134,118 +4080,137 @@ var DepthFirstTraverser = class {
   // this entirely, including the visited-flag zero-fill (worth ~0.5% on the
   // ~500-primitive manablade bundle, which shares attribute corner tables across
   // primitives). Uint8Array (0/1) instead of Array(bool): these flags are read
-  // and written on every corner of the hottest decode loop (traverseFromCorner).
+  // and written on every corner of the hottest decode loop (traverseAll).
   // Decode-scoped scratch: released in bulk at the end of the decode.
   onTraversalStart() {
     const cornerTable = this.a;
-    this.W = scratchUint8Zeroed(cornerTable.numFaces());
-    this.Cb = scratchInt32(this.H);
+    this.ua = scratchUint8Zeroed(cornerTable.numFaces());
+    this.Cb = scratchInt32(this.I);
   }
   // Traverses every face, seeding a new traversal at the first corner of each
-  // face not yet reached. The visited check lives here rather than behind a
-  // traverseFromCorner call per face: on a connected mesh nearly every face is
-  // already visited by the time its seed comes up, and that call-and-return
-  // was measurable next to the traversal itself.
+  // face not yet reached. One function for the seeds and the walks they
+  // start: a mesh cut into many pieces (small parts, or UV islands in an
+  // attribute table) seeds a new walk every few faces, and a call per seed
+  // would reload the whole traversal state each time.
   traverseAll() {
     const numFaces = this.a.numFaces();
-    const isFaceVisited = this.W;
-    for (let f = 0; f < numFaces && this.da < numFaces; ++f) {
-      if (isFaceVisited[f] === 0 && !this.traverseFromCorner(3 * f)) {
-        return false;
-      }
-    }
-    return true;
-  }
-  traverseFromCorner(cornerId) {
-    if (this.W[cornerId / 3 | 0]) {
-      return true;
-    }
-    const isFaceVisited = this.W;
-    const observer = this.va;
-    const cornerToVertex = this.h;
-    const oppositeCorners = this.o;
-    const vertexOnBoundary = this.y;
+    const isFaceVisited = this.ua;
+    const observer = this.ta;
+    const cornerToVertex = this.i;
+    const oppositeCorners = this.t;
+    const vertexOnBoundary = this.z;
     const stack = this.Cb;
-    let numVisitedFaces = this.da;
+    let numVisitedFaces = this.va;
     const encodingData = observer.n;
-    const encodedToCornerMap = observer._a;
-    const vertexToEncodedMap = observer.$a;
+    const encodedToCornerMap = observer.Ya;
+    const vertexToEncodedMap = observer.Za;
+    const parents = this.Eb;
     let numValues = encodingData.numValues;
-    let stackSize = 0;
-    stack[stackSize++] = cornerId;
-    const nextCorner = cornerId % 3 === 2 ? cornerId - 2 : cornerId + 1;
-    const prevCorner = cornerId % 3 === 0 ? cornerId + 2 : cornerId - 1;
-    const nextVert = cornerToVertex[nextCorner];
-    const prevVert = cornerToVertex[prevCorner];
-    if (nextVert === kInvalidVertexIndex || prevVert === kInvalidVertexIndex) {
-      return false;
-    }
-    if (vertexToEncodedMap[nextVert] < 0) {
-      encodedToCornerMap[numValues] = nextCorner;
-      vertexToEncodedMap[nextVert] = numValues++;
-    }
-    if (vertexToEncodedMap[prevVert] < 0) {
-      encodedToCornerMap[numValues] = prevCorner;
-      vertexToEncodedMap[prevVert] = numValues++;
-    }
-    while (stackSize > 0) {
-      cornerId = stack[stackSize - 1];
-      let faceId = cornerId / 3 | 0;
-      if (cornerId === kInvalidCornerIndex4 || isFaceVisited[faceId]) {
-        stackSize--;
-        continue;
+    for (let f = 0; f < numFaces && numVisitedFaces < numFaces; ++f) {
+      if (isFaceVisited[f] !== 0) continue;
+      let cornerId = 3 * f;
+      let stackSize = 0;
+      stack[stackSize++] = cornerId;
+      const nextCorner = cornerId + 1;
+      const prevCorner = cornerId + 2;
+      const nextVert = cornerToVertex[nextCorner];
+      const prevVert = cornerToVertex[prevCorner];
+      if (nextVert === kInvalidVertexIndex || prevVert === kInvalidVertexIndex) {
+        encodingData.numValues = numValues;
+        return false;
       }
-      while (true) {
-        isFaceVisited[faceId] = 1;
-        numVisitedFaces++;
-        const vertId = cornerToVertex[cornerId];
-        if (vertId === kInvalidVertexIndex) {
-          encodingData.numValues = numValues;
-          return false;
+      if (vertexToEncodedMap[nextVert] < 0) {
+        encodedToCornerMap[numValues] = nextCorner;
+        if (parents !== null)
+          recordParents(parents, numValues, nextCorner, oppositeCorners, cornerToVertex, vertexToEncodedMap);
+        vertexToEncodedMap[nextVert] = numValues++;
+      }
+      if (vertexToEncodedMap[prevVert] < 0) {
+        encodedToCornerMap[numValues] = prevCorner;
+        if (parents !== null)
+          recordParents(parents, numValues, prevCorner, oppositeCorners, cornerToVertex, vertexToEncodedMap);
+        vertexToEncodedMap[prevVert] = numValues++;
+      }
+      while (stackSize > 0) {
+        cornerId = stack[stackSize - 1];
+        let faceId = cornerId / 3 | 0;
+        if (cornerId === kInvalidCornerIndex4 || isFaceVisited[faceId]) {
+          stackSize--;
+          continue;
         }
-        const faceBase = faceId * 3;
-        const nextCornerId = cornerId === faceBase + 2 ? faceBase : cornerId + 1;
-        if (vertexToEncodedMap[vertId] < 0) {
-          encodedToCornerMap[numValues] = cornerId;
-          vertexToEncodedMap[vertId] = numValues++;
-          if (vertexOnBoundary[vertId] === 0) {
-            cornerId = oppositeCorners[nextCornerId];
-            faceId = cornerId / 3 | 0;
-            continue;
+        while (true) {
+          isFaceVisited[faceId] = 1;
+          numVisitedFaces++;
+          const vertId = cornerToVertex[cornerId];
+          if (vertId === kInvalidVertexIndex) {
+            encodingData.numValues = numValues;
+            return false;
           }
-        }
-        const rightCornerId = oppositeCorners[nextCornerId];
-        const prevCornerId = cornerId === faceBase ? faceBase + 2 : cornerId - 1;
-        const leftCornerId = oppositeCorners[prevCornerId];
-        const rightFaceId = rightCornerId === kInvalidCornerIndex4 ? kInvalidFaceIndex : rightCornerId / 3 | 0;
-        const leftFaceId = leftCornerId === kInvalidCornerIndex4 ? kInvalidFaceIndex : leftCornerId / 3 | 0;
-        const isRightVisited = rightFaceId === kInvalidFaceIndex || isFaceVisited[rightFaceId];
-        const isLeftVisited = leftFaceId === kInvalidFaceIndex || isFaceVisited[leftFaceId];
-        if (isRightVisited) {
-          if (isLeftVisited) {
-            stackSize--;
-            break;
-          } else {
-            cornerId = leftCornerId;
-            faceId = leftFaceId;
+          const faceBase = faceId * 3;
+          const nextCornerId = cornerId === faceBase + 2 ? faceBase : cornerId + 1;
+          if (vertexToEncodedMap[vertId] < 0) {
+            encodedToCornerMap[numValues] = cornerId;
+            if (parents !== null)
+              recordParents(parents, numValues, cornerId, oppositeCorners, cornerToVertex, vertexToEncodedMap);
+            vertexToEncodedMap[vertId] = numValues++;
+            if (vertexOnBoundary[vertId] === 0) {
+              cornerId = oppositeCorners[nextCornerId];
+              faceId = cornerId / 3 | 0;
+              continue;
+            }
           }
-        } else {
-          if (isLeftVisited) {
-            cornerId = rightCornerId;
-            faceId = rightFaceId;
+          const rightCornerId = oppositeCorners[nextCornerId];
+          const prevCornerId = cornerId === faceBase ? faceBase + 2 : cornerId - 1;
+          const leftCornerId = oppositeCorners[prevCornerId];
+          const rightFaceId = rightCornerId === kInvalidCornerIndex4 ? kInvalidFaceIndex : rightCornerId / 3 | 0;
+          const leftFaceId = leftCornerId === kInvalidCornerIndex4 ? kInvalidFaceIndex : leftCornerId / 3 | 0;
+          const isRightVisited = rightFaceId === kInvalidFaceIndex || isFaceVisited[rightFaceId];
+          const isLeftVisited = leftFaceId === kInvalidFaceIndex || isFaceVisited[leftFaceId];
+          if (isRightVisited) {
+            if (isLeftVisited) {
+              stackSize--;
+              break;
+            } else {
+              cornerId = leftCornerId;
+              faceId = leftFaceId;
+            }
           } else {
-            stack[stackSize - 1] = leftCornerId;
-            stack[stackSize++] = rightCornerId;
-            break;
+            if (isLeftVisited) {
+              cornerId = rightCornerId;
+              faceId = rightFaceId;
+            } else {
+              stack[stackSize - 1] = leftCornerId;
+              stack[stackSize++] = rightCornerId;
+              break;
+            }
           }
         }
       }
     }
-    this.da = numVisitedFaces;
+    this.va = numVisitedFaces;
     encodingData.numValues = numValues;
     return true;
   }
 };
+function recordParents(parents, value, corner, oppositeCorners, cornerToVertex, vertexToEncodedMap) {
+  const o = value * 3;
+  const oci = oppositeCorners[corner];
+  if (oci < 0) {
+    parents[o] = -1;
+    return;
+  }
+  const rem = oci - (oci / 3 | 0) * 3;
+  const a = vertexToEncodedMap[cornerToVertex[oci]];
+  const b = vertexToEncodedMap[cornerToVertex[rem === 2 ? oci - 2 : oci + 1]];
+  const c = vertexToEncodedMap[cornerToVertex[rem === 0 ? oci + 2 : oci - 1]];
+  if ((a | b | c) < 0) {
+    parents[o] = -1;
+  } else {
+    parents[o] = a;
+    parents[o + 1] = b;
+    parents[o + 2] = c;
+  }
+}
 
 // src/decoder/compression/mesh/traverser/MaxPredictionDegreeTraverser.ts
 var kInvalidCornerIndex5 = -1;
@@ -4253,18 +4218,18 @@ var kInvalidFaceIndex2 = -1;
 var kMaxPriority = 3;
 var MaxPredictionDegreeTraverser = class {
   a = null;
-  va = null;
-  W = null;
-  ab = null;
-  da = 0;
+  ta = null;
+  ua = null;
+  _a = null;
+  va = 0;
   // One stack (bucket) per priority level [0, kMaxPriority).
   La = null;
-  X = 0;
+  Y = 0;
   // Prediction degree accumulated per vertex during traversal.
-  bb = null;
+  $a = null;
   // Flat connectivity arrays (see DepthFirstTraverser for why).
-  h = null;
-  o = null;
+  i = null;
+  t = null;
   // Identifies the traversal order for the shared traversal cache
   // (MESH_TRAVERSAL_PREDICTION_DEGREE). See MeshTraversalSequencer.
   Db = 1;
@@ -4272,32 +4237,32 @@ var MaxPredictionDegreeTraverser = class {
   emitsPointIds = true;
   init(cornerTable, observer) {
     this.a = cornerTable;
-    this.va = observer;
-    this.W = new Uint8Array(cornerTable.numFaces());
-    this.ab = new Uint8Array(cornerTable.numVertices());
-    this.h = cornerTable.cornerToVertexArray();
-    this.o = cornerTable.oppositeCornerArray();
+    this.ta = observer;
+    this.ua = new Uint8Array(cornerTable.numFaces());
+    this._a = new Uint8Array(cornerTable.numVertices());
+    this.i = cornerTable.cornerToVertexArray();
+    this.t = cornerTable.oppositeCornerArray();
     this.La = [[], [], []];
   }
   cornerTable() {
     return this.a;
   }
   // corner is always valid (>= 0) where these are used.
-  Eb(c) {
+  Fb(c) {
     return c % 3 === 2 ? c - 2 : c + 1;
   }
-  Fb(c) {
+  Gb(c) {
     return c % 3 === 0 ? c + 2 : c - 1;
   }
   onTraversalStart() {
-    this.bb = new Int32Array(this.a.numVertices());
+    this.$a = new Int32Array(this.a.numVertices());
   }
   // Same contract as DepthFirstTraverser.traverseAll. Seeds every face
   // through traverseFromCorner (which re-checks the first face's vertices),
   // exactly as the sequencer's loop always has.
   traverseAll() {
     const numFaces = this.a.numFaces();
-    for (let f = 0; f < numFaces && this.da < numFaces; ++f) {
+    for (let f = 0; f < numFaces && this.va < numFaces; ++f) {
       if (!this.traverseFromCorner(3 * f)) {
         return false;
       }
@@ -4306,11 +4271,11 @@ var MaxPredictionDegreeTraverser = class {
   }
   // Returns the priority of traversing the edge leading to cornerId. Mutates
   // the prediction degree of the destination vertex.
-  Gb(cornerId) {
-    const vTip = this.h[cornerId];
+  Hb(cornerId) {
+    const vTip = this.i[cornerId];
     let priority = 0;
-    if (!this.ab[vTip]) {
-      const degree = ++this.bb[vTip];
+    if (!this._a[vTip]) {
+      const degree = ++this.$a[vTip];
       priority = degree > 1 ? 1 : 2;
     }
     if (priority >= kMaxPriority) {
@@ -4318,38 +4283,38 @@ var MaxPredictionDegreeTraverser = class {
     }
     return priority;
   }
-  Hb(ci, priority) {
+  Ib(ci, priority) {
     this.La[priority].push(ci);
-    if (priority < this.X) {
-      this.X = priority;
+    if (priority < this.Y) {
+      this.Y = priority;
     }
   }
   // Retrieves the next available corner to traverse, processed by priority.
   // Returns kInvalidCornerIndex when no corner is available.
   bc() {
-    for (let i = this.X; i < kMaxPriority; ++i) {
+    for (let i = this.Y; i < kMaxPriority; ++i) {
       const stack = this.La[i];
       if (stack.length > 0) {
         const ret = stack.pop();
-        this.X = i;
+        this.Y = i;
         return ret;
       }
     }
     return kInvalidCornerIndex5;
   }
   traverseFromCorner(cornerId) {
-    if (this.bb.length === 0) {
+    if (this.$a.length === 0) {
       return true;
     }
-    const cornerToVertex = this.h;
-    const oppositeCorners = this.o;
-    const isFaceVisited = this.W;
-    const isVertexVisited = this.ab;
-    const observer = this.va;
+    const cornerToVertex = this.i;
+    const oppositeCorners = this.t;
+    const isFaceVisited = this.ua;
+    const isVertexVisited = this._a;
+    const observer = this.ta;
     this.La[0].push(cornerId);
-    this.X = 0;
-    const firstNext = this.Eb(cornerId);
-    const firstPrev = this.Fb(cornerId);
+    this.Y = 0;
+    const firstNext = this.Fb(cornerId);
+    const firstPrev = this.Gb(cornerId);
     const nextVert = cornerToVertex[firstNext];
     const prevVert = cornerToVertex[firstPrev];
     if (!isVertexVisited[nextVert]) {
@@ -4373,34 +4338,34 @@ var MaxPredictionDegreeTraverser = class {
       while (true) {
         faceId = cornerId / 3 | 0;
         isFaceVisited[faceId] = 1;
-        this.da++;
+        this.va++;
         const vertId = cornerToVertex[cornerId];
         if (!isVertexVisited[vertId]) {
           isVertexVisited[vertId] = 1;
           observer.onNewVertexVisited(vertId, cornerId);
         }
-        const rightCornerId = oppositeCorners[this.Eb(cornerId)];
-        const leftCornerId = oppositeCorners[this.Fb(cornerId)];
+        const rightCornerId = oppositeCorners[this.Fb(cornerId)];
+        const leftCornerId = oppositeCorners[this.Gb(cornerId)];
         const rightFaceId = rightCornerId === kInvalidCornerIndex5 ? kInvalidFaceIndex2 : rightCornerId / 3 | 0;
         const leftFaceId = leftCornerId === kInvalidCornerIndex5 ? kInvalidFaceIndex2 : leftCornerId / 3 | 0;
         const isRightFaceVisited = rightFaceId === kInvalidFaceIndex2 || isFaceVisited[rightFaceId] !== 0;
         const isLeftFaceVisited = leftFaceId === kInvalidFaceIndex2 || isFaceVisited[leftFaceId] !== 0;
         if (!isLeftFaceVisited) {
-          const priority = this.Gb(leftCornerId);
-          if (isRightFaceVisited && priority <= this.X) {
+          const priority = this.Hb(leftCornerId);
+          if (isRightFaceVisited && priority <= this.Y) {
             cornerId = leftCornerId;
             continue;
           } else {
-            this.Hb(leftCornerId, priority);
+            this.Ib(leftCornerId, priority);
           }
         }
         if (!isRightFaceVisited) {
-          const priority = this.Gb(rightCornerId);
-          if (priority <= this.X) {
+          const priority = this.Hb(rightCornerId);
+          if (priority <= this.Y) {
             cornerId = rightCornerId;
             continue;
           } else {
-            this.Hb(rightCornerId, priority);
+            this.Ib(rightCornerId, priority);
           }
         }
         break;
@@ -4413,65 +4378,77 @@ var MaxPredictionDegreeTraverser = class {
 // src/decoder/compression/mesh/traverser/MeshAttributeIndicesEncodingObserver.ts
 var MeshAttributeIndicesEncodingObserver = class {
   n;
-  V;
-  $a;
-  _a;
-  Ib;
+  X;
+  Za;
+  Ya;
+  Jb;
   constructor(mesh, sequencer, encodingData) {
     this.n = encodingData;
-    this.V = sequencer;
-    this.$a = encodingData.vertexToEncodedAttributeValueIndexMap;
-    this._a = encodingData.encodedAttributeValueIndexToCornerMap;
-    this.Ib = mesh.faces_;
+    this.X = sequencer;
+    this.Za = encodingData.vertexToEncodedAttributeValueIndexMap;
+    this.Ya = encodingData.encodedAttributeValueIndexToCornerMap;
+    this.Jb = mesh.faces_;
   }
   onNewVertexVisited(vertex, corner) {
-    const pointId = this.Ib[corner];
-    this.V.addPointId(pointId);
+    const pointId = this.Jb[corner];
+    this.X.addPointId(pointId);
     const numValues = this.n.numValues;
-    this._a[numValues] = corner;
-    this.$a[vertex] = numValues;
+    this.Ya[numValues] = corner;
+    this.Za[vertex] = numValues;
     this.n.numValues++;
   }
 };
 
 // src/decoder/compression/mesh/traverser/MeshTraversalSequencer.ts
 var MeshTraversalSequencer = class {
-  C;
+  D;
   n;
-  wa = null;
-  u = new Int32Array(0);
-  xa = 0;
+  ea = null;
+  u = EMPTY_INT32;
+  wa = 0;
   // Per-decode cache, keyed by corner table, shared across the attribute
   // decoders of one mesh (see MeshEdgebreakerDecoderImpl).
-  cb;
+  ab;
   // The cache entry the last generateSequence resolved to (hit or store);
   // carries the shared indicesMap.
-  db = null;
+  bb = null;
   // One representative corner per point id, when the connectivity decoder
   // recorded them (see MeshEdgebreakerDecoderImpl._assignAttributeVerticesAndPoints).
-  ea;
-  constructor(mesh, encodingData, traversalCache, pointCorner) {
-    this.C = mesh;
+  Z;
+  // The corner table whose vertex ids are the point ids, if any.
+  xa;
+  constructor(mesh, encodingData, traversalCache, pointCorner, pointVertexTable) {
+    this.D = mesh;
     this.n = encodingData;
-    this.cb = traversalCache;
-    this.ea = pointCorner;
+    this.ab = traversalCache;
+    this.Z = pointCorner;
+    this.xa = pointVertexTable;
   }
   setTraverser(traverser) {
-    this.wa = traverser;
-  }
-  generateSequence() {
-    const cornerTable = this.wa.cornerTable();
-    const methodId = this.wa.Db;
+    this.ea = traverser;
+  }
+  // With parallelogramParents set, a depth-first traversal also records the
+  // parallelogram parents of its values (see
+  // MeshPredictionSchemeData.parallelogramParents), stored with the result.
+  generateSequence(parallelogramParents) {
+    const cornerTable = this.ea.cornerTable();
+    const methodId = this.ea.Db;
     const cacheKey = cornerTable.cornerToVertexArray();
     const encodingData = this.n;
-    let byMethod = this.cb.get(cacheKey);
+    let byMethod = this.ab.get(cacheKey);
     const cached = byMethod && byMethod.get(methodId);
     if (cached !== void 0) {
       this.u = cached.pointIds;
       encodingData.adoptTraversalResult(cached);
-      this.db = cached;
+      this.bb = cached;
       return true;
     }
+    const traverser = this.ea;
+    let parents = null;
+    if (parallelogramParents && traverser instanceof DepthFirstTraverser) {
+      parents = scratchInt32(encodingData.vertexToEncodedAttributeValueIndexMap.length * 3);
+      traverser.Eb = parents;
+    }
     if (!this.cc()) {
       return false;
     }
@@ -4484,7 +4461,7 @@ var MeshTraversalSequencer = class {
     }
     if (byMethod === void 0) {
       byMethod = /* @__PURE__ */ new Map();
-      this.cb.set(cacheKey, byMethod);
+      this.ab.set(cacheKey, byMethod);
     }
     const entry = {
       pointIds: this.u,
@@ -4492,34 +4469,42 @@ var MeshTraversalSequencer = class {
       cornerMap: encodingData.encodedAttributeValueIndexToCornerMap,
       numValues,
       indicesMap: null,
-      parents: null
+      parents
     };
     byMethod.set(methodId, entry);
     encodingData.cacheEntry = entry;
-    this.db = entry;
+    this.bb = entry;
     return true;
   }
   getOutputPointIds() {
     return this.u;
   }
   addPointId(pointId) {
-    this.u[this.xa++] = pointId;
+    this.u[this.wa++] = pointId;
   }
   updatePointToAttributeIndexMapping(attribute) {
-    const entry = this.db;
+    const entry = this.bb;
     if (entry !== null && entry.indicesMap !== null) {
       attribute.setExplicitMappingShared(entry.indicesMap);
       return true;
     }
-    const cornerTable = this.wa.cornerTable();
-    const numFaces = this.C.numFaces();
-    const numPoints = this.C.numPoints();
+    const cornerTable = this.ea.cornerTable();
+    const numFaces = this.D.numFaces();
+    const numPoints = this.D.numPoints();
     attribute.setExplicitMappingUnfilled(numPoints);
     const cornerToVertex = cornerTable.cornerToVertexArray();
     const vertexToAttEntry = this.n.vertexToEncodedAttributeValueIndexMap;
     const indicesMap = attribute.indicesMap;
-    const pointCorner = this.ea;
-    if (pointCorner !== null) {
+    const pointCorner = this.Z;
+    if (cornerTable === this.xa) {
+      for (let p = 0; p < numPoints; ++p) {
+        const attEntryId = vertexToAttEntry[p];
+        if (attEntryId < 0 || attEntryId >= numPoints) {
+          return false;
+        }
+        indicesMap[p] = attEntryId;
+      }
+    } else if (pointCorner !== null) {
       for (let p = 0; p < numPoints; ++p) {
         const vertId = cornerToVertex[pointCorner[p]];
         if (vertId < 0) {
@@ -4533,7 +4518,7 @@ var MeshTraversalSequencer = class {
       }
     } else {
       const numCorners = numFaces * 3;
-      const faces = this.C.faces_;
+      const faces = this.D.faces_;
       for (let ci = 0; ci < numCorners; ++ci) {
         const vertId = cornerToVertex[ci];
         if (vertId < 0) {
@@ -4553,9 +4538,9 @@ var MeshTraversalSequencer = class {
     return true;
   }
   cc() {
-    this.xa = 0;
-    this.u = scratchInt32(this.C.numPoints());
-    const traverser = this.wa;
+    this.wa = 0;
+    this.u = scratchInt32(this.D.numPoints());
+    const traverser = this.ea;
     traverser.onTraversalStart();
     if (!traverser.traverseAll()) {
       return false;
@@ -4563,15 +4548,15 @@ var MeshTraversalSequencer = class {
     if (!traverser.emitsPointIds) {
       const numValues = this.n.numValues;
       const cornerMap = this.n.encodedAttributeValueIndexToCornerMap;
-      const faces = this.C.faces_;
+      const faces = this.D.faces_;
       const outPointIds = this.u;
       for (let i = 0; i < numValues; ++i) {
         outPointIds[i] = faces[cornerMap[i]];
       }
-      this.xa = numValues;
+      this.wa = numValues;
     }
-    if (this.xa < this.u.length) {
-      this.u = this.u.subarray(0, this.xa);
+    if (this.wa < this.u.length) {
+      this.u = this.u.subarray(0, this.wa);
     }
     return true;
   }
@@ -4580,38 +4565,40 @@ var MeshTraversalSequencer = class {
 // src/decoder/compression/mesh/MeshEdgebreakerDecoderImpl.ts
 var kInvalidCornerIndex6 = -1;
 var MeshEdgebreakerDecoderImpl = class {
-  l;
+  m;
   a = null;
   N = [];
-  fa = new Uint8Array(0);
-  Y = 0;
-  eb = new MeshAttributeIndicesEncodingData();
-  Jb = -1;
+  fa = EMPTY_UINT8;
+  _ = 0;
+  cb = new MeshAttributeIndicesEncodingData();
+  Kb = -1;
   // Cache of vertex-traversal results keyed by corner table, so attributes
   // sharing connectivity traverse once.
   dc = /* @__PURE__ */ new Map();
-  g = [];
-  I;
+  h = [];
+  J;
   // One corner per point id (decode-scoped scratch), filled by
-  // _assignAttributeVerticesAndPoints; null when points are the base vertices.
-  ea = null;
-  // Corners on a boundary edge, counted by _decodeAttributeConnectivities.
-  Kb = 0;
+  // _assignAttributeVerticesAndPoints; null for a mesh without attribute data
+  // (see _assignPointsToVertices).
+  Z = null;
+  // The corner table whose vertex ids are the point ids, if any (see
+  // MeshTraversalSequencer.updatePointToAttributeIndexMapping).
+  xa = null;
   constructor(decoder, TraversalDecoderClass) {
-    this.l = decoder;
-    this.I = new TraversalDecoderClass();
+    this.m = decoder;
+    this.J = new TraversalDecoderClass();
   }
   getCornerTable() {
     return this.a;
   }
   // The attribute data set whose attributes decoder owns attId, if any.
   Lb(attId) {
-    for (let i = 0; i < this.g.length; ++i) {
-      const ad = this.g[i];
-      if (ad.decoderId < 0 || ad.decoderId >= this.l.numAttributesDecoders()) {
+    for (let i = 0; i < this.h.length; ++i) {
+      const ad = this.h[i];
+      if (ad.decoderId < 0 || ad.decoderId >= this.m.numAttributesDecoders()) {
         continue;
       }
-      const dec = this.l.attributesDecoder(ad.decoderId);
+      const dec = this.m.attributesDecoder(ad.decoderId);
       for (let j = 0; j < dec.getNumAttributes(); ++j) {
         if (dec.getAttributeId(j) === attId) {
           return ad;
@@ -4626,28 +4613,28 @@ var MeshEdgebreakerDecoderImpl = class {
   }
   getAttributeEncodingData(attId) {
     const ad = this.Lb(attId);
-    return ad !== null ? ad.encodingData : this.eb;
+    return ad !== null ? ad.encodingData : this.cb;
   }
   createAttributesDecoder(attDecoderId) {
-    const buffer = this.l.buffer();
+    const buffer = this.m.buffer();
     let attDataId = buffer.decodeUint8();
     if (attDataId !== void 0) attDataId = attDataId << 24 >> 24;
     if (attDataId === void 0) return false;
     const decoderType = buffer.decodeUint8();
     if (decoderType === void 0) return false;
     if (attDataId >= 0) {
-      if (attDataId >= this.g.length) {
+      if (attDataId >= this.h.length) {
         return false;
       }
-      if (this.g[attDataId].decoderId >= 0) {
+      if (this.h[attDataId].decoderId >= 0) {
         return false;
       }
-      this.g[attDataId].decoderId = attDecoderId;
+      this.h[attDataId].decoderId = attDecoderId;
     } else {
-      if (this.Jb >= 0) {
+      if (this.Kb >= 0) {
         return false;
       }
-      this.Jb = attDecoderId;
+      this.Kb = attDecoderId;
     }
     const traversalMethod = buffer.decodeUint8();
     if (traversalMethod === void 0 || traversalMethod >= 2 /* NUM_TRAVERSAL_METHODS */) {
@@ -4657,44 +4644,50 @@ var MeshEdgebreakerDecoderImpl = class {
     let cornerTable;
     if (decoderType === 0 /* MESH_VERTEX_ATTRIBUTE */) {
       if (attDataId < 0) {
-        encodingData = this.eb;
+        encodingData = this.cb;
       } else {
-        encodingData = this.g[attDataId].encodingData;
-        this.g[attDataId].isConnectivityUsed = false;
+        encodingData = this.h[attDataId].encodingData;
+        this.h[attDataId].isConnectivityUsed = false;
       }
       cornerTable = this.a;
     } else {
       if (traversalMethod !== 0 /* MESH_TRAVERSAL_DEPTH_FIRST */ || attDataId < 0) {
         return false;
       }
-      const ad = this.g[attDataId];
+      const ad = this.h[attDataId];
       if (ad.noInteriorSeams) this.ec(ad);
       encodingData = ad.encodingData;
       cornerTable = ad.connectivityData;
     }
-    const mesh = this.l.mesh();
-    const sequencer = new MeshTraversalSequencer(mesh, encodingData, this.dc, this.ea);
+    const mesh = this.m.mesh();
+    const sequencer = new MeshTraversalSequencer(
+      mesh,
+      encodingData,
+      this.dc,
+      this.Z,
+      this.xa
+    );
     const observer = new MeshAttributeIndicesEncodingObserver(mesh, sequencer, encodingData);
     const traverser = traversalMethod === 1 /* MESH_TRAVERSAL_PREDICTION_DEGREE */ ? new MaxPredictionDegreeTraverser() : new DepthFirstTraverser();
     traverser.init(cornerTable, observer);
     sequencer.setTraverser(traverser);
-    return this.l.setAttributesDecoder(attDecoderId, new SequentialAttributeDecodersController(sequencer));
+    return this.m.setAttributesDecoder(attDecoderId, new SequentialAttributeDecodersController(sequencer));
   }
   decodeConnectivity() {
-    const buffer = this.l.buffer();
+    const buffer = this.m.buffer();
     const numEncodedVertices = decodeVarint(buffer);
     if (numEncodedVertices === void 0) return false;
-    this.Y = numEncodedVertices;
+    this._ = numEncodedVertices;
     const numFaces = decodeVarint(buffer);
     if (numFaces === void 0) return false;
     if (numFaces > 2147483647 / 3) {
       return false;
     }
-    if (this.Y > numFaces * 3) {
+    if (this._ > numFaces * 3) {
       return false;
     }
     const minNumFaceEdges = Math.floor(3 * numFaces / 2);
-    const maxNumVertexEdges = this.Y * (this.Y - 1) / 2;
+    const maxNumVertexEdges = this._ * (this._ - 1) / 2;
     if (maxNumVertexEdges < minNumFaceEdges) {
       return false;
     }
@@ -4719,43 +4712,42 @@ var MeshEdgebreakerDecoderImpl = class {
       const ad = new AttributeData();
       ad.attributeSeamCorners = scratchInt32(numFaces * 3);
       ad.numSeamCorners = 0;
-      this.g.push(ad);
+      this.h.push(ad);
     }
-    this.a.reset(numFaces, this.Y + numEncodedSplitSymbols);
-    this.fa = scratchUint8Filled(this.Y + numEncodedSplitSymbols, 1);
+    this.a.reset(numFaces, this._ + numEncodedSplitSymbols);
+    this.fa = scratchUint8Filled(this._ + numEncodedSplitSymbols, 1);
     if (!this.fc(buffer)) {
       return false;
     }
-    this.I.init(this);
-    this.I.setNumEncodedVertices(this.Y + numEncodedSplitSymbols);
-    this.I.setNumAttributeData(numAttributeData);
+    this.J.init(this);
+    this.J.setNumEncodedVertices(this._ + numEncodedSplitSymbols);
+    this.J.setNumAttributeData(numAttributeData);
     const traversalEndBuffer = new DecoderBuffer();
-    if (!this.I.start(traversalEndBuffer)) {
+    if (!this.J.start(traversalEndBuffer)) {
       return false;
     }
     const numConnectivityVerts = this.gc(numEncodedSymbols);
     if (numConnectivityVerts === -1) {
       return false;
     }
-    buffer.init(traversalEndBuffer.dataHead, traversalEndBuffer.remainingSize);
+    buffer.initFrom(traversalEndBuffer);
     this.a.finishBoundaries();
-    if (this.g.length > 0) {
+    if (this.h.length > 0) {
       this.hc();
     }
-    this.I.done();
-    const numBoundaryCorners = this.Kb;
+    this.J.done();
     const distinctTables = [];
     const seamEdgeCounts = [];
     const adoptions = [];
     let previousConnectivityData = null;
     let previousSeamCorners = null;
     let previousSeamCount = 0;
-    for (let i = 0; i < this.g.length; ++i) {
-      const connectivityData = this.g[i].connectivityData;
-      const seamCorners = this.g[i].attributeSeamCorners;
-      const seamCount = this.g[i].numSeamCorners;
-      if (seamCount === numBoundaryCorners) {
-        this.g[i].noInteriorSeams = true;
+    for (let i = 0; i < this.h.length; ++i) {
+      const connectivityData = this.h[i].connectivityData;
+      const seamCorners = this.h[i].attributeSeamCorners;
+      const seamCount = this.h[i].numSeamCorners;
+      if (seamCount === 0) {
+        this.h[i].noInteriorSeams = true;
         continue;
       }
       let sameAsPrevious = previousConnectivityData !== null && seamCount === previousSeamCount;
@@ -4782,7 +4774,7 @@ var MeshEdgebreakerDecoderImpl = class {
       previousSeamCorners = seamCorners;
       previousSeamCount = seamCount;
     }
-    if (this.g.length === 0) {
+    if (this.h.length === 0) {
       this.ic(numConnectivityVerts);
     } else if (!this.jc(distinctTables, seamEdgeCounts)) {
       return false;
@@ -4790,13 +4782,13 @@ var MeshEdgebreakerDecoderImpl = class {
     for (let i = 0; i < adoptions.length; i += 2) {
       adoptions[i].adoptFrom(adoptions[i + 1]);
     }
-    this.eb.init(this.a.numVertices());
-    for (let i = 0; i < this.g.length; ++i) {
-      let attConnectivityVerts = this.g[i].connectivityData.numVertices();
+    this.cb.init(this.a.numVertices());
+    for (let i = 0; i < this.h.length; ++i) {
+      let attConnectivityVerts = this.h[i].connectivityData.numVertices();
       if (attConnectivityVerts < this.a.numVertices()) {
         attConnectivityVerts = this.a.numVertices();
       }
-      this.g[i].encodingData.init(attConnectivityVerts);
+      this.h[i].encodingData.init(attConnectivityVerts);
     }
     return true;
   }
@@ -4823,15 +4815,15 @@ var MeshEdgebreakerDecoderImpl = class {
     const topologySplitActiveCorners = /* @__PURE__ */ new Map();
     const splitResult = { faceEdge: 0, encoderSplitSymbolId: 0 };
     const invalidVertices = [];
-    const removeInvalidVertices = this.g.length === 0;
+    const removeInvalidVertices = this.h.length === 0;
     let maxNumVertices = this.fa.length;
     let numFacesDecoded = 0;
-    const cornerToVertex = this.a.h;
-    const oppositeCorners = this.a.o;
+    const cornerToVertex = this.a.i;
+    const oppositeCorners = this.a.t;
     const vc = this.a;
-    let vertexCorners = vc.s;
+    let vertexCorners = vc.r;
     const isVertHole = this.fa;
-    const traversalDecoder = this.I;
+    const traversalDecoder = this.J;
     for (let symbolId = 0; symbolId < numSymbols; ++symbolId) {
       const faceIndex = numFacesDecoded++;
       let checkTopologySplit = false;
@@ -4883,13 +4875,13 @@ var MeshEdgebreakerDecoderImpl = class {
         oppositeCorners[oppCorner] = cornerA;
         oppositeCorners[cornerA] = oppCorner;
         let newVertIndex;
-        if (vc.i < vertexCorners.length) {
-          newVertIndex = vc.i++;
+        if (vc.j < vertexCorners.length) {
+          newVertIndex = vc.j++;
         } else {
           newVertIndex = vc.addNewVertex();
-          vertexCorners = vc.s;
+          vertexCorners = vc.r;
         }
-        if (vc.i > maxNumVertices) return -1;
+        if (vc.j > maxNumVertices) return -1;
         cornerToVertex[oppCorner] = newVertIndex;
         vertexCorners[newVertIndex] = oppCorner;
         const pA = cornerA % 3 === 0 ? cornerA + 2 : cornerA - 1;
@@ -4950,16 +4942,16 @@ var MeshEdgebreakerDecoderImpl = class {
       } else if (symbol === TOPOLOGY_E) {
         const corner = 3 * faceIndex;
         let firstVertIndex;
-        if (vc.i + 3 <= vertexCorners.length) {
-          firstVertIndex = vc.i;
-          vc.i += 3;
+        if (vc.j + 3 <= vertexCorners.length) {
+          firstVertIndex = vc.j;
+          vc.j += 3;
         } else {
           firstVertIndex = vc.addNewVertex();
           vc.addNewVertex();
           vc.addNewVertex();
-          vertexCorners = vc.s;
+          vertexCorners = vc.r;
         }
-        if (vc.i > maxNumVertices) return -1;
+        if (vc.j > maxNumVertices) return -1;
         cornerToVertex[corner] = firstVertIndex;
         cornerToVertex[corner + 1] = firstVertIndex + 1;
         cornerToVertex[corner + 2] = firstVertIndex + 2;
@@ -4988,7 +4980,7 @@ var MeshEdgebreakerDecoderImpl = class {
         }
       }
     }
-    if (vc.i > maxNumVertices) {
+    if (vc.j > maxNumVertices) {
       return -1;
     }
     numFacesDecoded = this.lc(activeCornerStack, activeCornerStackSize, numFacesDecoded);
@@ -5004,11 +4996,11 @@ var MeshEdgebreakerDecoderImpl = class {
   // Returns the updated decoded-face count, or -1 on malformed input.
   lc(activeCornerStack, activeCornerStackSize, numFacesDecoded) {
     const ct = this.a;
-    const oppositeCorners = ct.o;
-    const cornerToVertex = ct.h;
-    const vertexCorners = ct.s;
+    const oppositeCorners = ct.t;
+    const cornerToVertex = ct.i;
+    const vertexCorners = ct.r;
     const isVertHole = this.fa;
-    const traversalDecoder = this.I;
+    const traversalDecoder = this.J;
     const numCorners = ct.numCorners();
     const numFaces = ct.numFaces();
     const next = (c) => c < 0 ? -1 : c % 3 === 2 ? c - 2 : c + 1;
@@ -5058,8 +5050,8 @@ var MeshEdgebreakerDecoderImpl = class {
   // forward iteration order matters). Returns the final vertex count, or -1.
   mc(invalidVertices) {
     const ct = this.a;
-    const cornerToVertex = ct.h;
-    const vertexCorners = ct.s;
+    const cornerToVertex = ct.i;
+    const vertexCorners = ct.r;
     const isVertHole = this.fa;
     const leftMostCorner = (v) => v < 0 || v >= vertexCorners.length ? -1 : vertexCorners[v];
     let numVertices = ct.numVertices();
@@ -5141,32 +5133,24 @@ var MeshEdgebreakerDecoderImpl = class {
   //
   // The face comparison the C++ makes -- floor(oppCorner/3) >= floor(cc/3) for
   // the face's base corner -- is just `oppCorner >= faceBaseCorner`, since the
-  // base corner is a multiple of 3. That removes the per-corner division; the
-  // invalid-corner case (-1) is still handled by the branch above it.
+  // base corner is a multiple of 3. That removes the per-corner division, and
+  // an invalid (-1) opposite fails it too.
   hc() {
     const oppositeCorners = this.a.oppositeCornerArray();
-    const attributeData = this.g;
+    const attributeData = this.h;
     const numAttrData = attributeData.length;
-    const connectivityDecoders = this.I.Mb;
+    const connectivityDecoders = this.J.Mb;
     const numCorners = this.a.numCorners();
     const candidates = scratchInt32(numCorners);
     let numCandidates = 0;
-    let numBoundaryCorners = 0;
     for (let corner = 0; corner < numCorners; corner += 3) {
-      let opp = oppositeCorners[corner];
-      candidates[numCandidates] = corner ^ opp >> 31;
-      numCandidates -= (opp | corner - opp - 1) >> 31;
-      numBoundaryCorners -= opp >> 31;
-      opp = oppositeCorners[corner + 1];
-      candidates[numCandidates] = corner + 1 ^ opp >> 31;
-      numCandidates -= (opp | corner - opp - 1) >> 31;
-      numBoundaryCorners -= opp >> 31;
-      opp = oppositeCorners[corner + 2];
-      candidates[numCandidates] = corner + 2 ^ opp >> 31;
-      numCandidates -= (opp | corner - opp - 1) >> 31;
-      numBoundaryCorners -= opp >> 31;
-    }
-    this.Kb = numBoundaryCorners;
+      candidates[numCandidates] = corner;
+      numCandidates -= corner - oppositeCorners[corner] - 1 >> 31;
+      candidates[numCandidates] = corner + 1;
+      numCandidates -= corner - oppositeCorners[corner + 1] - 1 >> 31;
+      candidates[numCandidates] = corner + 2;
+      numCandidates -= corner - oppositeCorners[corner + 2] - 1 >> 31;
+    }
     let i = 0;
     for (; i + 2 <= numAttrData; i += 2) {
       decodeSeamBits2(
@@ -5184,7 +5168,7 @@ var MeshEdgebreakerDecoderImpl = class {
   }
   // Position-only connectivity: vertex indices equal point indices.
   ic(numConnectivityVerts) {
-    const mesh = this.l.mesh();
+    const mesh = this.m.mesh();
     const ct = this.a;
     mesh.setNumFaces(ct.numFaces());
     const numCorners = ct.numCorners();
@@ -5193,8 +5177,8 @@ var MeshEdgebreakerDecoderImpl = class {
     for (let c = 0; c < numCorners; ++c) {
       faces[c] = baseCornerToVertex[c];
     }
-    this.ea = null;
-    this.l.pointCloud().setNumPoints(numConnectivityVerts);
+    this.Z = null;
+    this.m.pointCloud().setNumPoints(numConnectivityVerts);
   }
   // Sets up an attribute corner table whose only seams are boundary edges
   // (see decodeConnectivity), for a per-corner decoder that asked for it:
@@ -5235,7 +5219,7 @@ var MeshEdgebreakerDecoderImpl = class {
   // (or left through the seam-aware table, which stops at the boundary), so
   // an open ring is walked from that corner too.
   jc(tables, seamEdgeCounts) {
-    const mesh = this.l.mesh();
+    const mesh = this.m.mesh();
     const ct = this.a;
     mesh.setNumFaces(ct.numFaces());
     const numCorners = ct.numCorners();
@@ -5247,24 +5231,41 @@ var MeshEdgebreakerDecoderImpl = class {
     const isVertHole = this.fa;
     const baseOnBoundary = ct.vertexOnBoundaryArray();
     const numTables = tables.length;
+    if (numTables === 0) {
+      let isolated = false;
+      for (let v = 0; v < numVertices; ++v) {
+        if (vertexLeftmost[v] < 0) {
+          isolated = true;
+          break;
+        }
+      }
+      if (!isolated) {
+        faces.set(baseCornerToVertex);
+        this.Z = vertexLeftmost;
+        this.xa = ct;
+        this.m.pointCloud().setNumPoints(numVertices);
+        return true;
+      }
+    }
     const attCornerToVertex = new Array(numTables);
     const attOpposite = new Array(numTables);
     const vertexOnSeam = new Array(numTables);
     const onBoundaryMaps = new Array(numTables);
     const numExtraVertices = new Int32Array(numTables);
     for (let t = 0; t < numTables; ++t) {
-      attCornerToVertex[t] = tables[t].S;
-      attOpposite[t] = tables[t].E;
+      attCornerToVertex[t] = tables[t].U;
+      attOpposite[t] = tables[t].F;
       vertexOnSeam[t] = tables[t].la;
       const onBoundary = scratchUint8(numVertices + 2 * seamEdgeCounts[t]);
       onBoundary.set(baseOnBoundary);
       onBoundary.fill(1, numVertices);
       onBoundaryMaps[t] = onBoundary;
     }
-    const ring = scratchInt32(numCorners);
-    const ringNext = scratchInt32(numCorners);
+    const ringSize = numTables > 0 ? numCorners : 0;
+    const ring = scratchInt32(ringSize);
+    const ringNext = scratchInt32(ringSize);
     const pointCorner = scratchInt32(numCorners);
-    const idChange = scratchUint8Zeroed(numCorners);
+    const idChange = scratchUint8Zeroed(ringSize);
     let numPoints = 0;
     const plainPointId = scratchInt32(numVertices);
     let numWalked = 0;
@@ -5386,8 +5387,8 @@ var MeshEdgebreakerDecoderImpl = class {
     for (let t = 0; t < numTables; ++t) {
       tables[t].setRecomputedVertices(onBoundaryMaps[t], numVertices + numExtraVertices[t]);
     }
-    this.ea = pointCorner;
-    this.l.pointCloud().setNumPoints(numPoints);
+    this.Z = pointCorner;
+    this.m.pointCloud().setNumPoints(numPoints);
     return true;
   }
 };
@@ -5401,11 +5402,6 @@ function decodeSeamBits1(candidates, numCandidates, ad, decoder) {
   let state = ans.state;
   let bufOffset = ans.bufOffset;
   for (let n = 0; n < numCandidates; ++n) {
-    const cc = candidates[n];
-    if (cc < 0) {
-      seamCorners[numSeamCorners++] = ~cc;
-      continue;
-    }
     if (state < ANS_L_BASE && bufOffset > bufStart) {
       state = state << 8 | buf[--bufOffset];
     }
@@ -5414,7 +5410,7 @@ function decodeSeamBits1(candidates, numCandidates, ad, decoder) {
     const mask = rem - p >> 31;
     const stateIfZero = state - xn - p;
     state = stateIfZero + (mask & xn + rem - stateIfZero);
-    seamCorners[numSeamCorners] = cc;
+    seamCorners[numSeamCorners] = candidates[n];
     numSeamCorners -= mask;
   }
   ans.state = state;
@@ -5440,11 +5436,6 @@ function decodeSeamBits2(candidates, numCandidates, ad0, decoder0, ad1, decoder1
   let off1 = ans1.bufOffset;
   for (let n = 0; n < numCandidates; ++n) {
     const cc = candidates[n];
-    if (cc < 0) {
-      seam0[num0++] = ~cc;
-      seam1[num1++] = ~cc;
-      continue;
-    }
     if (state0 < ANS_L_BASE && off0 > start0) {
       state0 = state0 << 8 | buf0[--off0];
     }
@@ -5474,8 +5465,8 @@ function decodeSeamBits2(candidates, numCandidates, ad0, decoder0, ad1, decoder1
   ad1.numSeamCorners = num1;
 }
 var MeshAttributeIndicesEncodingData = class {
-  vertexToEncodedAttributeValueIndexMap = new Int32Array(0);
-  encodedAttributeValueIndexToCornerMap = new Int32Array(0);
+  vertexToEncodedAttributeValueIndexMap = EMPTY_INT32;
+  encodedAttributeValueIndexToCornerMap = EMPTY_INT32;
   numValues = 0;
   // The traversal cache entry the maps came from (see MeshTraversalSequencer);
   // carries what later passes derive from the traversal and share.
@@ -5501,43 +5492,43 @@ var AttributeData = class {
   connectivityData = new MeshAttributeCornerTable();
   isConnectivityUsed = true;
   encodingData = new MeshAttributeIndicesEncodingData();
-  attributeSeamCorners = new Int32Array(0);
+  attributeSeamCorners = EMPTY_INT32;
   numSeamCorners = 0;
-  // Set when every seam is a boundary edge and connectivityData was therefore
+  // Set when the set has no interior seam and connectivityData was therefore
   // left unbuilt (see decodeConnectivity); cleared once it is built on demand.
   noInteriorSeams = false;
 };
 var CornerTable = class {
   Nb = 0;
-  H = 0;
-  i = 0;
-  h = null;
+  I = 0;
+  j = 0;
+  i = null;
   // corner -> vertex
-  o = null;
+  t = null;
   // corner -> opposite corner
-  s = null;
+  r = null;
   // vertex -> left-most corner
   // vertex -> 1 when its fan is open (C++ IsOnBoundary: the edge left of
   // the left-most corner has no opposite face), computed once after the
   // connectivity decode (see finishBoundaries) for the traversals, whose
   // critical path would otherwise chase two dependent loads per new vertex.
-  y = null;
+  z = null;
   reset(numFaces, numVertices) {
     this.Nb = numFaces;
-    this.H = numFaces * 3;
-    this.i = 0;
-    this.h = scratchInt32Filled(this.H, -1);
-    this.o = scratchInt32Filled(this.H, -1);
-    this.s = scratchInt32Filled(numVertices, -1);
+    this.I = numFaces * 3;
+    this.j = 0;
+    this.i = scratchInt32Filled(this.I, -1);
+    this.t = scratchInt32Filled(this.I, -1);
+    this.r = scratchInt32Filled(numVertices, -1);
   }
   numFaces() {
     return this.Nb;
   }
   numCorners() {
-    return this.H;
+    return this.I;
   }
   numVertices() {
-    return this.i;
+    return this.j;
   }
   next(corner) {
     if (corner < 0) return -1;
@@ -5550,50 +5541,50 @@ var CornerTable = class {
     return rem === 0 ? corner + 2 : corner - 1;
   }
   vertex(corner) {
-    if (corner < 0 || corner >= this.H) return -1;
-    return this.h[corner];
+    if (corner < 0 || corner >= this.I) return -1;
+    return this.i[corner];
   }
   opposite(corner) {
-    if (corner < 0 || corner >= this.H) return -1;
-    return this.o[corner];
+    if (corner < 0 || corner >= this.I) return -1;
+    return this.t[corner];
   }
   // Flat-array accessors; let callers avoid polymorphic per-corner dispatch.
   cornerToVertexArray() {
-    return this.h;
+    return this.i;
   }
   oppositeCornerArray() {
-    return this.o;
+    return this.t;
   }
   vertexLeftmostCornerArray() {
-    return this.s;
+    return this.r;
   }
   vertexOnBoundaryArray() {
-    return this.y;
+    return this.z;
   }
   // Derives _vertexOnBoundary from the finished connectivity (decode-scoped
   // scratch). Isolated vertices count as boundary; they are never traversed.
   finishBoundaries() {
-    const numVertices = this.i;
-    const vertexCorners = this.s;
-    const oppositeCorners = this.o;
+    const numVertices = this.j;
+    const vertexCorners = this.r;
+    const oppositeCorners = this.t;
     const onBoundary = scratchUint8(numVertices);
     for (let v = 0; v < numVertices; ++v) {
       const lc = vertexCorners[v];
       onBoundary[v] = lc < 0 || oppositeCorners[lc % 3 === 2 ? lc - 2 : lc + 1] < 0 ? 1 : 0;
     }
-    this.y = onBoundary;
+    this.z = onBoundary;
   }
   // Mirrors C++ CornerTable::AddNewVertex() (push_back(kInvalidCornerIndex)).
   addNewVertex() {
-    const newVertex = this.i;
-    this.i++;
-    if (newVertex >= this.s.length) {
-      const newCapacity = Math.max(newVertex + 1, this.s.length * 2, 64);
+    const newVertex = this.j;
+    this.j++;
+    if (newVertex >= this.r.length) {
+      const newCapacity = Math.max(newVertex + 1, this.r.length * 2, 64);
       const newArr = scratchInt32Filled(newCapacity, -1);
-      newArr.set(this.s);
-      this.s = newArr;
+      newArr.set(this.r);
+      this.r = newArr;
     }
-    this.s[newVertex] = -1;
+    this.r[newVertex] = -1;
     return newVertex;
   }
   // Next corner around a vertex, CCW. SwingLeft(c) = Next(Opposite(Next(c))).
@@ -5615,8 +5606,8 @@ var CornerTable = class {
 // src/decoder/compression/mesh/MeshEdgebreakerTraversalDecoder.ts
 var MeshEdgebreakerTraversalDecoder = class {
   c = new DecoderBuffer();
-  J = new DecoderBuffer();
-  fb = null;
+  O = new DecoderBuffer();
+  db = null;
   Mb = [];
   Ob = 0;
   // _symbolBuffer's bit cursor, captured once bit decoding starts: decodeSymbol
@@ -5624,8 +5615,8 @@ var MeshEdgebreakerTraversalDecoder = class {
   // loads and a method call per read.
   Pb = null;
   init(decoder) {
-    const srcBuffer = decoder.l.buffer();
-    this.c.init(srcBuffer.dataHead, srcBuffer.remainingSize);
+    const srcBuffer = decoder.m.buffer();
+    this.c.initFrom(srcBuffer);
   }
   // Ignored by default; overridden by predictive/valence decoders.
   setNumEncodedVertices(_numVertices) {
@@ -5644,33 +5635,33 @@ var MeshEdgebreakerTraversalDecoder = class {
     if (!this.decodeAttributeSeams()) {
       return false;
     }
-    outBuffer.init(this.c.dataHead, this.c.remainingSize);
+    outBuffer.initFrom(this.c);
     return true;
   }
   decodeStartFaceConfiguration() {
-    return this.fb.decodeNextBit();
+    return this.db.decodeNextBit();
   }
   decodeSymbol() {
     const bd = this.Pb;
     if (bd !== null) {
-      const buf = bd.Da;
-      const off = bd.p;
+      const buf = bd.Ea;
+      const off = bd.o;
       const byteOffset = off >> 3;
       if (byteOffset + 4 < bd.ja) {
         const bits = (buf[byteOffset] | buf[byteOffset + 1] << 8 | buf[byteOffset + 2] << 16 | buf[byteOffset + 3] << 24) >>> (off & 7) & 7;
         if ((bits & 1) === TOPOLOGY_C) {
-          bd.p = off + 1;
+          bd.o = off + 1;
           return TOPOLOGY_C;
         }
-        bd.p = off + 3;
+        bd.o = off + 3;
         return bits;
       }
     }
-    let symbol = this.J.decodeLeastSignificantBits32(1);
+    let symbol = this.O.decodeLeastSignificantBits32(1);
     if (symbol === TOPOLOGY_C) {
       return symbol;
     }
-    const symbolSuffix = this.J.decodeLeastSignificantBits32(2);
+    const symbolSuffix = this.O.decodeLeastSignificantBits32(2);
     symbol |= symbolSuffix << 1;
     return symbol;
   }
@@ -5679,18 +5670,18 @@ var MeshEdgebreakerTraversalDecoder = class {
   mergeVertices(_dest, _source) {
   }
   done() {
-    if (this.J.bitDecoderActive) {
-      this.J.endBitDecoding();
+    if (this.O.bitDecoderActive) {
+      this.O.endBitDecoding();
     }
   }
   decodeTraversalSymbols() {
-    this.J.init(this.c.dataHead, this.c.remainingSize);
-    const traversalSize = this.J.startBitDecoding(true);
+    this.O.initFrom(this.c);
+    const traversalSize = this.O.startBitDecoding(true);
     if (traversalSize === void 0) {
       return false;
     }
-    this.Pb = this.J.ka;
-    this.c.init(this.J.dataHead, this.J.remainingSize);
+    this.Pb = this.O.ka;
+    this.c.initFrom(this.O);
     if (traversalSize > this.c.remainingSize) {
       return false;
     }
@@ -5699,8 +5690,8 @@ var MeshEdgebreakerTraversalDecoder = class {
   }
   decodeStartFaces() {
     try {
-      this.fb = new RAnsBitDecoder();
-      return this.fb.startDecoding(this.c);
+      this.db = new RAnsBitDecoder();
+      return this.db.startDecoding(this.c);
     } catch {
       return false;
     }
@@ -5720,17 +5711,17 @@ var MeshEdgebreakerTraversalDecoder = class {
 // src/decoder/compression/mesh/MeshEdgebreakerTraversalPredictiveDecoder.ts
 var MeshEdgebreakerTraversalPredictiveDecoder = class extends MeshEdgebreakerTraversalDecoder {
   a = null;
-  i = 0;
+  j = 0;
   x = -1;
   ga = -1;
-  j = [];
-  gb = null;
+  k = [];
+  eb = null;
   init(decoder) {
     super.init(decoder);
     this.a = decoder.getCornerTable();
   }
   setNumEncodedVertices(numVertices) {
-    this.i = numVertices;
+    this.j = numVertices;
   }
   start(outBuffer) {
     if (!super.start(outBuffer)) {
@@ -5740,16 +5731,16 @@ var MeshEdgebreakerTraversalPredictiveDecoder = class extends MeshEdgebreakerTra
     if (numSplitSymbols === void 0 || numSplitSymbols < 0) {
       return false;
     }
-    if (numSplitSymbols >= this.i) {
+    if (numSplitSymbols >= this.j) {
       return false;
     }
-    this.j = new Array(this.i).fill(0);
-    this.gb = new RAnsBitDecoder();
-    return this.gb.startDecoding(outBuffer);
+    this.k = new Array(this.j).fill(0);
+    this.eb = new RAnsBitDecoder();
+    return this.eb.startDecoding(outBuffer);
   }
   decodeSymbol() {
     if (this.ga !== -1) {
-      if (this.gb.decodeNextBit()) {
+      if (this.eb.decodeNextBit()) {
         this.x = this.ga;
         return this.ga;
       }
@@ -5764,30 +5755,30 @@ var MeshEdgebreakerTraversalPredictiveDecoder = class extends MeshEdgebreakerTra
     switch (this.x) {
       case TOPOLOGY_C:
       case TOPOLOGY_S:
-        this.j[ct.vertex(next)] += 1;
-        this.j[ct.vertex(prev)] += 1;
+        this.k[ct.vertex(next)] += 1;
+        this.k[ct.vertex(prev)] += 1;
         break;
       case TOPOLOGY_R:
-        this.j[ct.vertex(corner)] += 1;
-        this.j[ct.vertex(next)] += 1;
-        this.j[ct.vertex(prev)] += 2;
+        this.k[ct.vertex(corner)] += 1;
+        this.k[ct.vertex(next)] += 1;
+        this.k[ct.vertex(prev)] += 2;
         break;
       case TOPOLOGY_L:
-        this.j[ct.vertex(corner)] += 1;
-        this.j[ct.vertex(next)] += 2;
-        this.j[ct.vertex(prev)] += 1;
+        this.k[ct.vertex(corner)] += 1;
+        this.k[ct.vertex(next)] += 2;
+        this.k[ct.vertex(prev)] += 1;
         break;
       case TOPOLOGY_E:
-        this.j[ct.vertex(corner)] += 2;
-        this.j[ct.vertex(next)] += 2;
-        this.j[ct.vertex(prev)] += 2;
+        this.k[ct.vertex(corner)] += 2;
+        this.k[ct.vertex(next)] += 2;
+        this.k[ct.vertex(prev)] += 2;
         break;
       default:
         break;
     }
     if (this.x === TOPOLOGY_C || this.x === TOPOLOGY_R) {
       const pivot = ct.vertex(ct.next(corner));
-      if (this.j[pivot] < 6) {
+      if (this.k[pivot] < 6) {
         this.ga = TOPOLOGY_R;
       } else {
         this.ga = TOPOLOGY_C;
@@ -5797,34 +5788,34 @@ var MeshEdgebreakerTraversalPredictiveDecoder = class extends MeshEdgebreakerTra
     }
   }
   mergeVertices(dest, source) {
-    this.j[dest] += this.j[source];
+    this.k[dest] += this.k[source];
   }
 };
 
 // src/decoder/compression/mesh/MeshEdgebreakerTraversalValenceDecoder.ts
 var MeshEdgebreakerTraversalValenceDecoder = class extends MeshEdgebreakerTraversalDecoder {
   a = null;
-  i = 0;
+  j = 0;
   x = -1;
   Ma = -1;
   Na = 2;
-  hb = 7;
-  j = new Int32Array(0);
+  fb = 7;
+  k = EMPTY_INT32;
   ha = [];
   // Int32Array, not number[]: read and written once per decoded symbol.
-  ya = new Int32Array(0);
+  ya = EMPTY_INT32;
   // corner -> vertex of _cornerTable, cached at init(); the array is created
   // once by CornerTable.reset() before the traversal decoder is initialized and
   // never replaced, so the per-symbol hot path can read it without two property
   // loads.
-  h = new Int32Array(0);
+  i = EMPTY_INT32;
   init(decoder) {
     super.init(decoder);
     this.a = decoder.getCornerTable();
-    this.h = this.a.h;
+    this.i = this.a.i;
   }
   setNumEncodedVertices(numVertices) {
-    this.i = numVertices;
+    this.j = numVertices;
   }
   start(outBuffer) {
     if (!this.decodeStartFaces()) {
@@ -5833,9 +5824,9 @@ var MeshEdgebreakerTraversalValenceDecoder = class extends MeshEdgebreakerTraver
     if (!this.decodeAttributeSeams()) {
       return false;
     }
-    outBuffer.init(this.c.dataHead, this.c.remainingSize);
-    this.j = scratchInt32Filled(this.i, 0);
-    const numUniqueValences = this.hb - this.Na + 1;
+    outBuffer.initFrom(this.c);
+    this.k = scratchInt32Filled(this.j, 0);
+    const numUniqueValences = this.fb - this.Na + 1;
     this.ha = new Array(numUniqueValences);
     this.ya = new Int32Array(numUniqueValences);
     const pending = [];
@@ -5876,7 +5867,7 @@ var MeshEdgebreakerTraversalValenceDecoder = class extends MeshEdgebreakerTraver
           return false;
         }
         pending.push(decoder);
-        streams.push({ ans: decoder.G, out: this.ha[i], count: numSymbols });
+        streams.push({ ans: decoder.H, out: this.ha[i], count: numSymbols });
         this.ya[i] = numSymbols;
       } else {
         this.ha[i] = new Uint32Array(0);
@@ -5904,8 +5895,8 @@ var MeshEdgebreakerTraversalValenceDecoder = class extends MeshEdgebreakerTraver
     return this.x;
   }
   newActiveCornerReached(corner) {
-    const cornerToVertex = this.h;
-    const valences = this.j;
+    const cornerToVertex = this.i;
+    const valences = this.k;
     const next = corner % 3 === 2 ? corner - 2 : corner + 1;
     const prev = corner % 3 === 0 ? corner + 2 : corner - 1;
     const vertNext = cornerToVertex[next];
@@ -5938,15 +5929,15 @@ var MeshEdgebreakerTraversalValenceDecoder = class extends MeshEdgebreakerTraver
     let clampedValence;
     if (activeValence < this.Na) {
       clampedValence = this.Na;
-    } else if (activeValence > this.hb) {
-      clampedValence = this.hb;
+    } else if (activeValence > this.fb) {
+      clampedValence = this.fb;
     } else {
       clampedValence = activeValence;
     }
     this.Ma = clampedValence - this.Na;
   }
   mergeVertices(dest, source) {
-    this.j[dest] += this.j[source];
+    this.k[dest] += this.k[source];
   }
 };
 
@@ -5987,7 +5978,7 @@ var LinearSequencer = class {
   constructor(numPoints) {
     this.Oa = numPoints;
   }
-  generateSequence() {
+  generateSequence(_parallelogramParents) {
     if (this.Oa < 0) {
       return false;
     }