itowns 2.44.3-next.8 → 2.45.0

package/lib/Core/Picking.js

@@ -1,255 +0,0 @@
-import * as THREE from 'three';
-import RenderMode from "../Renderer/RenderMode.js";
-import { unpack1K } from "../Renderer/LayeredMaterial.js";
-import Coordinates from "./Geographic/Coordinates.js";
-const depthRGBA = new THREE.Vector4();
-// TileMesh picking support function
-function screenCoordsToNodeId(view, tileLayer, viewCoords) {
-  let radius = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : 0;
-  const dim = view.mainLoop.gfxEngine.getWindowSize();
-  viewCoords = viewCoords || new THREE.Vector2(Math.floor(dim.x / 2), Math.floor(dim.y / 2));
-  const restore = tileLayer.level0Nodes.map(n => RenderMode.push(n, RenderMode.MODES.ID));
-  const buffer = view.mainLoop.gfxEngine.renderViewToBuffer({
-    camera: view.camera,
-    scene: tileLayer.object3d
-  }, {
-    x: viewCoords.x - radius,
-    y: viewCoords.y - radius,
-    width: 1 + radius * 2,
-    height: 1 + radius * 2
-  });
-  restore.forEach(r => r());
-  const ids = [];
-  traversePickingCircle(radius, (x, y) => {
-    const idx = (y * 2 * radius + x) * 4;
-    const data = buffer.slice(idx, idx + 4 || undefined);
-    depthRGBA.fromArray(data).divideScalar(255.0);
-    const unpack = unpack1K(depthRGBA, 256 ** 3);
-    const _id = Math.round(unpack);
-    if (!ids.includes(_id)) {
-      ids.push(_id);
-    }
-  });
-  return ids;
-}
-function traversePickingCircle(radius, callback) {
-  // iterate on radius so we get closer to the mouse
-  // results first.
-  // Result traversal order for radius=2
-  // --3--
-  // -323-
-  // 32123
-  // -323
-  // --3--
-  let prevSq;
-  for (let r = 0; r <= radius; r++) {
-    const sq = r * r;
-    for (let x = -r; x <= r; x++) {
-      const sqx = x * x;
-      for (let y = -r; y <= r; y++) {
-        const dist = sqx + y * y;
-        // skip if too far
-        if (dist > sq) {
-          continue;
-        }
-        // skip if belongs to previous
-        if (dist <= prevSq) {
-          continue;
-        }
-        if (callback(x, y) === false) {
-          return;
-        }
-      }
-    }
-    prevSq = sq;
-  }
-}
-function findLayerInParent(obj) {
-  if (obj.layer) {
-    return obj.layer;
-  }
-  if (obj.parent) {
-    return findLayerInParent(obj.parent);
-  }
-}
-const raycaster = new THREE.Raycaster();
-const normalized = new THREE.Vector2();
-const pointPos = new THREE.Vector3();
-const pointPosCoord = new Coordinates('EPSG:4978'); // default crs, will be set to view crs when used
-const cameraPos = new THREE.Vector3();
-const cameraPosCoord = new Coordinates('EPSG:4978'); // default crs, will be set to view crs when used
-
-/**
- * @module Picking
- *
- * Implement various picking methods for geometry layers.
- * These methods are not meant to be used directly, see View.pickObjectsAt
- * instead.
- *
- * All the methods here takes the same parameters:
- *   - the View instance
- *   - view coordinates (in pixels) where picking should be done
- *   - radius (in pixels) of the picking circle
- *   - layer: the geometry layer used for picking
- */
-export default {
-  pickTilesAt(view, viewCoords, radius, layer) {
-    let results = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : [];
-    const _ids = screenCoordsToNodeId(view, layer, viewCoords, radius);
-    const extractResult = node => {
-      if (_ids.includes(node.id) && node.isTileMesh) {
-        results.push({
-          object: node,
-          layer
-        });
-      }
-    };
-    for (const n of layer.level0Nodes) {
-      n.traverse(extractResult);
-    }
-    return results;
-  },
-  pickPointsAt(view, viewCoords, radius, layer) {
-    let result = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : [];
-    if (!layer.root) {
-      return;
-    }
-
-    // enable picking mode for points material
-    layer.object3d.traverse(o => {
-      if (o.isPoints && o.baseId) {
-        o.material.enablePicking(true);
-      }
-    });
-
-    // render 1 pixel
-    // TODO: support more than 1 pixel selection
-    const buffer = view.mainLoop.gfxEngine.renderViewToBuffer({
-      camera: view.camera,
-      scene: layer.object3d
-    }, {
-      x: viewCoords.x - radius,
-      y: viewCoords.y - radius,
-      width: 1 + radius * 2,
-      height: 1 + radius * 2
-    });
-    const candidates = [];
-    traversePickingCircle(radius, (x, y) => {
-      const idx = (y * 2 * radius + x) * 4;
-      const data = buffer.slice(idx, idx + 4);
-
-      // see PotreeProvider and the construction of unique_id
-      const objId = data[0] << 8 | data[1];
-      const index = data[2] << 8 | data[3];
-      const r = {
-        objId,
-        index
-      };
-      for (let i = 0; i < candidates.length; i++) {
-        if (candidates[i].objId == r.objId && candidates[i].index == r.index) {
-          return;
-        }
-      }
-      candidates.push(r);
-    });
-    layer.object3d.traverse(o => {
-      if (o.isPoints && o.baseId) {
-        // disable picking mode
-        o.material.enablePicking(false);
-
-        // if baseId matches objId, the clicked point belongs to `o`
-        for (let i = 0; i < candidates.length; i++) {
-          if (candidates[i].objId == o.baseId) {
-            // Get point position: get the picked point from the buffer geometry and apply local to world
-            // transform of the picked object
-            pointPos.fromBufferAttribute(o.geometry.attributes.position, candidates[i].index);
-            o.localToWorld(pointPos);
-            // Compute distance to the camera
-            pointPosCoord.setCrs(view.referenceCrs);
-            pointPosCoord.setFromVector3(pointPos);
-            view.camera3D.getWorldPosition(cameraPos);
-            cameraPosCoord.setCrs(view.referenceCrs);
-            cameraPosCoord.setFromVector3(cameraPos);
-            const dist = pointPosCoord.spatialEuclideanDistanceTo(cameraPosCoord);
-            result.push({
-              object: o,
-              point: pointPos.clone(),
-              // the position of the point in the 3D view. Same name and value than what's returned by pickObjectsAt
-              index: candidates[i].index,
-              distance: dist,
-              layer
-            });
-          }
-        }
-      }
-    });
-    return result;
-  },
-  /*
-   * Default picking method. Uses THREE.Raycaster
-   */
-  pickObjectsAt(view, viewCoords, radius, object) {
-    let target = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : [];
-    // Raycaster use NDC coordinate
-    view.viewToNormalizedCoords(viewCoords, normalized);
-    if (radius < 0) {
-      raycaster.setFromCamera(normalized, view.camera3D);
-      const intersects = raycaster.intersectObject(object, true);
-      for (const inter of intersects) {
-        inter.layer = findLayerInParent(inter.object);
-        target.push(inter);
-      }
-      return target;
-    }
-    // Instead of doing N raycast (1 per x,y returned by traversePickingCircle),
-    // we force render the zone of interest.
-    // Then we'll only do raycasting for the pixels where something was drawn.
-    const zone = {
-      x: viewCoords.x - radius,
-      y: viewCoords.y - radius,
-      width: 1 + radius * 2,
-      height: 1 + radius * 2
-    };
-    const pixels = view.mainLoop.gfxEngine.renderViewToBuffer({
-      scene: object,
-      camera: view.camera
-    }, zone);
-    const clearColor = new THREE.Color();
-    view.mainLoop.gfxEngine.renderer.getClearColor(clearColor);
-    const clearR = Math.round(255 * clearColor.r);
-    const clearG = Math.round(255 * clearColor.g);
-    const clearB = Math.round(255 * clearColor.b);
-
-    // Raycaster use NDC coordinate
-    const tmp = normalized.clone();
-    traversePickingCircle(radius, (x, y) => {
-      // x, y are offset from the center of the picking circle,
-      // and pixels is a square where 0, 0 is the top-left corner.
-      // So we need to shift x,y by radius.
-
-      const offset = ((y + radius) * (radius * 2 + 1) + (x + radius)) * 4;
-      const r = pixels[offset];
-      const g = pixels[offset + 1];
-      const b = pixels[offset + 2];
-      // Use approx. test to avoid rounding error or to behave
-      // differently depending on hardware rounding mode.
-      if (Math.abs(clearR - r) <= 1 && Math.abs(clearG - g) <= 1 && Math.abs(clearB - b) <= 1) {
-        // skip because nothing has been rendered here
-        return;
-      }
-
-      // Perform raycasting
-      tmp.setX(normalized.x + x / view.camera.width).setY(normalized.y + y / view.camera.height);
-      raycaster.setFromCamera(tmp, view.camera3D);
-      const intersects = raycaster.intersectObject(object, true);
-      for (const inter of intersects) {
-        inter.layer = findLayerInParent(inter.object);
-        target.push(inter);
-      }
-
-      // Stop at first hit
-      return target.length == 0;
-    });
-    return target;
-  }
-};

package/lib/Core/PointCloudNode.js

@@ -1,42 +0,0 @@
-import * as THREE from 'three';
-class PointCloudNode extends THREE.EventDispatcher {
-  constructor() {
-    let numPoints = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : 0;
-    let layer = arguments.length > 1 ? arguments[1] : undefined;
-    super();
-    this.numPoints = numPoints;
-    this.layer = layer;
-    this.children = [];
-    this.bbox = new THREE.Box3();
-    this.sse = -1;
-  }
-  add(node, indexChild) {
-    this.children.push(node);
-    node.parent = this;
-    this.createChildAABB(node, indexChild);
-  }
-  load() {
-    // Query octree/HRC if we don't have children potreeNode yet.
-    if (!this.octreeIsLoaded) {
-      this.loadOctree();
-    }
-    return this.layer.source.fetcher(this.url, this.layer.source.networkOptions).then(file => this.layer.source.parse(file, {
-      out: this.layer,
-      in: this.layer.source
-    }));
-  }
-  findCommonAncestor(node) {
-    if (node.depth == this.depth) {
-      if (node.id == this.id) {
-        return node;
-      } else if (node.depth != 0) {
-        return this.parent.findCommonAncestor(node.parent);
-      }
-    } else if (node.depth < this.depth) {
-      return this.parent.findCommonAncestor(node);
-    } else {
-      return this.findCommonAncestor(node.parent);
-    }
-  }
-}
-export default PointCloudNode;

package/lib/Core/Potree2Node.js

@@ -1,206 +0,0 @@
-/*
-============
-== POTREE ==
-============
-
-http://potree.org
-
-Copyright (c) 2011-2020, Markus Schütz
-All rights reserved.
-
-    Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions are met:
-
-    1. Redistributions of source code must retain the above copyright notice, this
-list of conditions and the following disclaimer.
-2. Redistributions in binary form must reproduce the above copyright notice,
-    this list of conditions and the following disclaimer in the documentation
-and/or other materials provided with the distribution.
-
-    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
-ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
-WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
-ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
-(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
-LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
-ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
-SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-    The views and conclusions contained in the software and documentation are those
-of the authors and should not be interpreted as representing official policies,
-    either expressed or implied, of the FreeBSD Project.
- */
-
-import * as THREE from 'three';
-import PointCloudNode from "./PointCloudNode.js";
-
-// Create an A(xis)A(ligned)B(ounding)B(ox) for the child `childIndex` of one aabb.
-// (PotreeConverter protocol builds implicit octree hierarchy by applying the same
-// subdivision algo recursively)
-const dHalfLength = new THREE.Vector3();
-const NODE_TYPE = {
-  NORMAL: 0,
-  LEAF: 1,
-  PROXY: 2
-};
-class Potree2Node extends PointCloudNode {
-  constructor() {
-    let numPoints = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : 0;
-    let childrenBitField = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
-    let layer = arguments.length > 2 ? arguments[2] : undefined;
-    super(numPoints, layer);
-    this.childrenBitField = childrenBitField;
-    this.id = '';
-    this.depth = 0;
-    this.baseurl = layer.source.baseurl;
-  }
-  add(node, indexChild) {
-    super.add(node, indexChild);
-    node.id = this.id + indexChild;
-    node.depth = this.depth + 1;
-  }
-  createChildAABB(node, childIndex) {
-    // Code inspired from potree
-    node.bbox.copy(this.bbox);
-    this.bbox.getCenter(node.bbox.max);
-    dHalfLength.copy(node.bbox.max).sub(this.bbox.min);
-    if (childIndex === 1) {
-      node.bbox.min.z += dHalfLength.z;
-      node.bbox.max.z += dHalfLength.z;
-    } else if (childIndex === 3) {
-      node.bbox.min.z += dHalfLength.z;
-      node.bbox.max.z += dHalfLength.z;
-      node.bbox.min.y += dHalfLength.y;
-      node.bbox.max.y += dHalfLength.y;
-    } else if (childIndex === 0) {
-      //
-    } else if (childIndex === 2) {
-      node.bbox.min.y += dHalfLength.y;
-      node.bbox.max.y += dHalfLength.y;
-    } else if (childIndex === 5) {
-      node.bbox.min.z += dHalfLength.z;
-      node.bbox.max.z += dHalfLength.z;
-      node.bbox.min.x += dHalfLength.x;
-      node.bbox.max.x += dHalfLength.x;
-    } else if (childIndex === 7) {
-      node.bbox.min.add(dHalfLength);
-      node.bbox.max.add(dHalfLength);
-    } else if (childIndex === 4) {
-      node.bbox.min.x += dHalfLength.x;
-      node.bbox.max.x += dHalfLength.x;
-    } else if (childIndex === 6) {
-      node.bbox.min.y += dHalfLength.y;
-      node.bbox.max.y += dHalfLength.y;
-      node.bbox.min.x += dHalfLength.x;
-      node.bbox.max.x += dHalfLength.x;
-    }
-  }
-  get octreeIsLoaded() {
-    return !(this.childrenBitField && this.children.length === 0);
-  }
-  get url() {
-    return `${this.baseurl}/octree.bin`;
-  }
-  networkOptions(byteOffset, byteSize) {
-    const first = byteOffset;
-    // When we specify 'multipart/byteranges' on headers request it trigger a preflight request
-    // Actually github doesn't support it https://github.com/orgs/community/discussions/24659
-    // But if we omit header parameter, github seems to know it's a 'multipart/byteranges' request (thanks to 'Range' parameter)
-    const networkOptions = {
-      ...this.layer.source.networkOptions,
-      headers: {
-        ...this.layer.source.networkOptions.headers,
-        ...(this.url.startsWith('https://raw.githubusercontent.com') ? {} : {
-          'content-type': 'multipart/byteranges'
-        }),
-        Range: `bytes=${first}-${first + byteSize - 1n}`
-      }
-    };
-    return networkOptions;
-  }
-  async load() {
-    // Query octree if we don't have children potreeNode yet.
-    if (!this.octreeIsLoaded) {
-      await this.loadOctree();
-    }
-    return this.layer.source.fetcher(this.url, this.networkOptions(this.byteOffset, this.byteSize)).then(file => this.layer.source.parser(file, {
-      in: {
-        source: this.layer.source,
-        bbox: this.bbox,
-        numPoints: this.numPoints
-      },
-      out: this.layer
-    })).then(data => {
-      this.loaded = true;
-      this.loading = false;
-      return data.geometry;
-    });
-  }
-  async loadOctree() {
-    if (this.loaded || this.loading) {
-      return;
-    }
-    this.loading = true;
-    return this.nodeType === NODE_TYPE.PROXY ? this.loadHierarchy() : Promise.resolve();
-  }
-  async loadHierarchy() {
-    const hierarchyPath = `${this.baseurl}/hierarchy.bin`;
-    const buffer = await this.layer.source.fetcher(hierarchyPath, this.networkOptions(this.hierarchyByteOffset, this.hierarchyByteSize));
-    this.parseHierarchy(buffer);
-  }
-  parseHierarchy(buffer) {
-    const view = new DataView(buffer);
-    const bytesPerNode = 22;
-    const numNodes = buffer.byteLength / bytesPerNode;
-    const stack = [];
-    stack.push(this);
-    for (let indexNode = 0; indexNode < numNodes; indexNode++) {
-      const current = stack.shift();
-      const offset = indexNode * bytesPerNode;
-      const type = view.getUint8(offset + 0);
-      const childMask = view.getUint8(offset + 1);
-      const numPoints = view.getUint32(offset + 2, true);
-      const byteOffset = view.getBigInt64(offset + 6, true);
-      const byteSize = view.getBigInt64(offset + 14, true);
-      if (current.nodeType === NODE_TYPE.PROXY) {
-        // replace proxy with real node
-        current.byteOffset = byteOffset;
-        current.byteSize = byteSize;
-        current.numPoints = numPoints;
-      } else if (type === NODE_TYPE.PROXY) {
-        // load proxy
-        current.hierarchyByteOffset = byteOffset;
-        current.hierarchyByteSize = byteSize;
-        current.numPoints = numPoints;
-      } else {
-        // load real node
-        current.byteOffset = byteOffset;
-        current.byteSize = byteSize;
-        current.numPoints = numPoints;
-      }
-      if (current.byteSize === 0n) {
-        // workaround for issue potree/potree#1125
-        // some inner nodes erroneously report >0 points even though have 0 points
-        // however, they still report a byteSize of 0, so based on that we now set node.numPoints to 0
-        current.numPoints = 0;
-      }
-      current.nodeType = type;
-      if (current.nodeType === NODE_TYPE.PROXY) {
-        continue;
-      }
-      for (let childIndex = 0; childIndex < 8; childIndex++) {
-        const childExists = (1 << childIndex & childMask) !== 0;
-        if (!childExists) {
-          continue;
-        }
-        const child = new Potree2Node(numPoints, childMask, this.layer);
-        child.spacing = current.spacing / 2;
-        current.add(child, childIndex);
-        stack.push(child);
-      }
-    }
-  }
-}
-export default Potree2Node;

package/lib/Core/Potree2PointAttributes.js

@@ -1,139 +0,0 @@
-/*
-============
-== POTREE ==
-============
-
-http://potree.org
-
-Copyright (c) 2011-2020, Markus Schütz
-All rights reserved.
-
-    Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions are met:
-
-    1. Redistributions of source code must retain the above copyright notice, this
-list of conditions and the following disclaimer.
-2. Redistributions in binary form must reproduce the above copyright notice,
-    this list of conditions and the following disclaimer in the documentation
-and/or other materials provided with the distribution.
-
-    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
-ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
-WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
-ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
-(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
-LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
-ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
-SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-    The views and conclusions contained in the software and documentation are those
-of the authors and should not be interpreted as representing official policies,
-    either expressed or implied, of the FreeBSD Project.
- */
-
-/**
- * Some types of possible point attribute data formats
- *
- * @class
- */
-const PointAttributeTypes = {
-  DATA_TYPE_DOUBLE: {
-    name: 'double',
-    size: 8
-  },
-  DATA_TYPE_FLOAT: {
-    name: 'float',
-    size: 4
-  },
-  DATA_TYPE_INT8: {
-    name: 'int8',
-    size: 1
-  },
-  DATA_TYPE_UINT8: {
-    name: 'uint8',
-    size: 1
-  },
-  DATA_TYPE_INT16: {
-    name: 'int16',
-    size: 2
-  },
-  DATA_TYPE_UINT16: {
-    name: 'uint16',
-    size: 2
-  },
-  DATA_TYPE_INT32: {
-    name: 'int32',
-    size: 4
-  },
-  DATA_TYPE_UINT32: {
-    name: 'uint32',
-    size: 4
-  },
-  DATA_TYPE_INT64: {
-    name: 'int64',
-    size: 8
-  },
-  DATA_TYPE_UINT64: {
-    name: 'uint64',
-    size: 8
-  }
-};
-Object.keys(PointAttributeTypes).forEach((type, index) => {
-  PointAttributeTypes[index] = PointAttributeTypes[type];
-});
-export { PointAttributeTypes };
-class PointAttribute {
-  constructor(name, type, numElements) {
-    this.name = name;
-    this.type = type;
-    this.numElements = numElements;
-    this.byteSize = this.numElements * this.type.size;
-    this.description = '';
-    this.range = [Infinity, -Infinity];
-  }
-}
-PointAttribute.POSITION_CARTESIAN = new PointAttribute('POSITION_CARTESIAN', PointAttributeTypes.DATA_TYPE_FLOAT, 3);
-PointAttribute.RGBA_PACKED = new PointAttribute('COLOR_PACKED', PointAttributeTypes.DATA_TYPE_INT8, 4);
-PointAttribute.COLOR_PACKED = PointAttribute.RGBA_PACKED;
-PointAttribute.RGB_PACKED = new PointAttribute('COLOR_PACKED', PointAttributeTypes.DATA_TYPE_INT8, 3);
-PointAttribute.NORMAL_FLOATS = new PointAttribute('NORMAL_FLOATS', PointAttributeTypes.DATA_TYPE_FLOAT, 3);
-PointAttribute.INTENSITY = new PointAttribute('INTENSITY', PointAttributeTypes.DATA_TYPE_UINT16, 1);
-PointAttribute.CLASSIFICATION = new PointAttribute('CLASSIFICATION', PointAttributeTypes.DATA_TYPE_UINT8, 1);
-PointAttribute.NORMAL_SPHEREMAPPED = new PointAttribute('NORMAL_SPHEREMAPPED', PointAttributeTypes.DATA_TYPE_UINT8, 2);
-PointAttribute.NORMAL_OCT16 = new PointAttribute('NORMAL_OCT16', PointAttributeTypes.DATA_TYPE_UINT8, 2);
-PointAttribute.NORMAL = new PointAttribute('NORMAL', PointAttributeTypes.DATA_TYPE_FLOAT, 3);
-PointAttribute.RETURN_NUMBER = new PointAttribute('RETURN_NUMBER', PointAttributeTypes.DATA_TYPE_UINT8, 1);
-PointAttribute.NUMBER_OF_RETURNS = new PointAttribute('NUMBER_OF_RETURNS', PointAttributeTypes.DATA_TYPE_UINT8, 1);
-PointAttribute.SOURCE_ID = new PointAttribute('SOURCE_ID', PointAttributeTypes.DATA_TYPE_UINT16, 1);
-PointAttribute.INDICES = new PointAttribute('INDICES', PointAttributeTypes.DATA_TYPE_UINT32, 1);
-PointAttribute.SPACING = new PointAttribute('SPACING', PointAttributeTypes.DATA_TYPE_FLOAT, 1);
-PointAttribute.GPS_TIME = new PointAttribute('GPS_TIME', PointAttributeTypes.DATA_TYPE_DOUBLE, 1);
-export { PointAttribute };
-export class Potree2PointAttributes {
-  constructor() {
-    this.attributes = [];
-    this.byteSize = 0;
-    this.size = 0;
-    this.vectors = [];
-  }
-  add(pointAttribute) {
-    this.attributes.push(pointAttribute);
-    this.byteSize += pointAttribute.byteSize;
-    this.size++;
-  }
-  addVector(vector) {
-    this.vectors.push(vector);
-  }
-  hasNormals() {
-    for (let index = 0; index < this.attributes.length; index++) {
-      const name = this.attributes[index];
-      const pointAttribute = this.attributes[name];
-      if (pointAttribute === PointAttribute.NORMAL_SPHEREMAPPED || pointAttribute === PointAttribute.NORMAL_FLOATS || pointAttribute === PointAttribute.NORMAL || pointAttribute === PointAttribute.NORMAL_OCT16) {
-        return true;
-      }
-    }
-    return false;
-  }
-}