@itwin/core-orbitgt 3.0.0-dev.100

package/lib/cjs/pointcloud/render/ViewTree.d.ts

@@ -0,0 +1,114 @@
+/** @packageDocumentation
+ * @module OrbitGT
+ */
+declare type int32 = number;
+import { Bounds } from "../../spatial/geom/Bounds";
+import { AList } from "../../system/collection/AList";
+import { BlockIndex } from "../model/BlockIndex";
+import { PointData } from "../model/PointData";
+import { TileIndex } from "../model/TileIndex";
+import { AViewRequest } from "./AViewRequest";
+import { DataManager } from "./DataManager";
+import { Level } from "./Level";
+/**
+ * Class TileSpatialIndex manages a spatial index of levels, blocks and tiles in pointcloud. The index does not store data, only block and tile indexes.
+ *
+ * @version 1.0 November 2015
+ */
+/** @internal */
+export declare class ViewTree {
+    /** The name of this module */
+    private static readonly MODULE;
+    /** Debug mode? */
+    private static readonly DEBUG;
+    /** The data manager */
+    private _dataManager;
+    /** The levels */
+    private _levels;
+    /** The data bounds */
+    private _dataBounds;
+    /** The root blocks */
+    private _rootBlocks;
+    /**
+     * Create a new tree.
+     * @param levels the levels.
+     * @param dataBounds the data bounds.
+     */
+    constructor(dataManager: DataManager, levels: Array<Level>, dataBounds: Bounds);
+    /**
+     * Find all root blocks (dropping of single-point tiles during pyramid creation can lead to missing branches).
+     * @return all root blocks.
+     */
+    private findRootBlocks;
+    /**
+     * Get the number of levels.
+     * @return the number of levels.
+     */
+    getLevelCount(): int32;
+    /**
+     * Get a level.
+     * @param index the index of the level.
+     * @return the level.
+     */
+    getLevel(index: int32): Level;
+    /**
+     * Get the data bounds.
+     * @return the data bounds.
+     */
+    getDataBounds(): Bounds;
+    /**
+     * Set the blocks for a level (after a data load operation).
+     * @param level the level.
+     * @param blockIndexes the indexes of the blocks in the level.
+     */
+    setLevelBlocks(level: Level, blockIndexes: Array<BlockIndex>): void;
+    /**
+     * Set the tiles for a block (after a data load operation).
+     * @param blockIndex the index of the block.
+     * @param tileIndexes the indexes of the tiles in the block.
+     */
+    setBlockTiles(blockIndex: BlockIndex, tileIndexes: Array<TileIndex>): void;
+    /**
+     * Split a tile into lower-level tiles.
+     * @param level the level of the tile to split.
+     * @param tile the tile to split.
+     * @param childLevel the lower level of the tile.
+     * @param children the list of children to split into.
+     * @param levelsToLoad the list of levels to load.
+     * @param blocksToLoad the list of blocks to load.
+     * @return true if the list of children is complete.
+     */
+    private splitTile;
+    /**
+     * Is all tile data available for rendering?
+     * @param viewRequest the view request.
+     * @param tiles a list of tiles to check.
+     * @param missingTiles the list of tiles whose data is missing.
+     */
+    private checkDataAvailable;
+    /**
+     * Is all tile data available for rendering?
+     * @param viewRequest the view request.
+     * @param tiles a list of tiles to check.
+     * @return true if the tile data is available.
+     */
+    private isDataAvailable;
+    /**
+     * Add visible tiles to the view.
+     * @param viewRequest the view request.
+     * @param level the level of the tiles.
+     * @param tiles the tiles to check.
+     * @param visibleTiles the list of visible tiles to add to.
+     */
+    private addTilesToView;
+    /**
+     * Find tile indexes for a 3D view.
+     * @param viewRequest the request parameters.
+     * @param visibleTiles the list of visible tiles to add to.
+     * @param availableTiles the set of available tiles.
+     * @param visibleAvailableTiles the list if visible and available tiles to add to.
+     */
+    renderView3D(viewRequest: AViewRequest, levelsToLoad: AList<Level>, blocksToLoad: AList<BlockIndex>, tilesToLoad: AList<TileIndex>, tilesToRender: AList<PointData>): void;
+}
+export {};
+//# sourceMappingURL=ViewTree.d.ts.map

package/lib/cjs/pointcloud/render/ViewTree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ViewTree.d.ts","sourceRoot":"","sources":["../../../../src/pointcloud/render/ViewTree.ts"],"names":[],"mappings":"AAIA;;GAEG;AAMH,aAAK,KAAK,GAAG,MAAM,CAAC;AAIpB,OAAO,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AACnD,OAAO,EAAE,KAAK,EAAE,MAAM,+BAA+B,CAAC;AAEtD,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAEjD,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAC/C,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAC/C,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAE9C,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAC5C,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAEhC;;;;GAIG;AACH,gBAAgB;AAChB,qBAAa,QAAQ;IACpB,8BAA8B;IAC9B,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAsB;IAEpD,kBAAkB;IAClB,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAkB;IAE/C,uBAAuB;IACvB,OAAO,CAAC,YAAY,CAAc;IAClC,iBAAiB;IACjB,OAAO,CAAC,OAAO,CAAe;IAC9B,sBAAsB;IACtB,OAAO,CAAC,WAAW,CAAS;IAC5B,sBAAsB;IACtB,OAAO,CAAC,WAAW,CAAe;IAElC;;;;OAIG;gBACgB,WAAW,EAAE,WAAW,EAAE,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,UAAU,EAAE,MAAM;IASrF;;;OAGG;IACH,OAAO,CAAC,cAAc;IA6BtB;;;OAGG;IACI,aAAa,IAAI,KAAK;IAI7B;;;;OAIG;IACI,QAAQ,CAAC,KAAK,EAAE,KAAK,GAAG,KAAK;IAIpC;;;OAGG;IACI,aAAa,IAAI,MAAM;IAI9B;;;;OAIG;IACI,cAAc,CAAC,KAAK,EAAE,KAAK,EAAE,YAAY,EAAE,KAAK,CAAC,UAAU,CAAC,GAAG,IAAI;IAQ1E;;;;OAIG;IACI,aAAa,CAAC,UAAU,EAAE,UAAU,EAAE,WAAW,EAAE,KAAK,CAAC,SAAS,CAAC,GAAG,IAAI;IAMjF;;;;;;;;;OASG;IACH,OAAO,CAAC,SAAS;IAyDjB;;;;;OAKG;IACH,OAAO,CAAC,kBAAkB;IAkB1B;;;;;OAKG;IACH,OAAO,CAAC,eAAe;IAYvB;;;;;;OAMG;IACH,OAAO,CAAC,cAAc;IAkEtB;;;;;;OAMG;IACI,YAAY,CAAC,WAAW,EAAE,YAAY,EAAE,YAAY,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,UAAU,CAAC,EAAE,WAAW,EAAE,KAAK,CAAC,SAAS,CAAC,EAAE,aAAa,EAAE,KAAK,CAAC,SAAS,CAAC,GAAG,IAAI;CA2BjL"}

package/lib/cjs/pointcloud/render/ViewTree.js

@@ -0,0 +1,364 @@
+"use strict";
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module OrbitGT
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ViewTree = void 0;
+const AList_1 = require("../../system/collection/AList");
+const Message_1 = require("../../system/runtime/Message");
+const GridIndex_1 = require("../model/GridIndex");
+const Block_1 = require("./Block");
+/**
+ * Class TileSpatialIndex manages a spatial index of levels, blocks and tiles in pointcloud. The index does not store data, only block and tile indexes.
+ *
+ * @version 1.0 November 2015
+ */
+/** @internal */
+class ViewTree {
+    /**
+     * Create a new tree.
+     * @param levels the levels.
+     * @param dataBounds the data bounds.
+     */
+    constructor(dataManager, levels, dataBounds) {
+        /* Store the parameters */
+        this._dataManager = dataManager;
+        this._levels = levels;
+        this._dataBounds = dataBounds;
+        /* Find the root blocks */
+        this._rootBlocks = this.findRootBlocks();
+    }
+    /**
+     * Find all root blocks (dropping of single-point tiles during pyramid creation can lead to missing branches).
+     * @return all root blocks.
+     */
+    findRootBlocks() {
+        /* Check some levels below the top */
+        let startLevel = (this._levels.length - 6);
+        if (startLevel < 0)
+            startLevel = 0;
+        Message_1.Message.print(ViewTree.MODULE, "Finding root blocks starting at level index " + startLevel + " of " + this._levels.length);
+        /* Check the levels */
+        let rootBlocks = new AList_1.AList();
+        let nextLevelIndex = new GridIndex_1.GridIndex(0, 0, 0);
+        for (let i = startLevel; i < this._levels.length - 1; i++) {
+            /* Check all blocks in the level */
+            let level = this._levels[i];
+            for (let block of level.getBlocks()) {
+                /* Non-top level? */
+                let isRoot = true;
+                if (i < this._levels.length - 2) {
+                    /* Do we have a parent block in the next level? */
+                    block.getBlockIndex().gridIndex.getNextLevelIndex(nextLevelIndex);
+                    isRoot = (this._levels[i + 1].findBlockGridIndex(nextLevelIndex) == null);
+                    if (isRoot)
+                        Message_1.Message.print(ViewTree.MODULE, "Block L" + i + " " + block.getBlockIndex().gridIndex + " is non-top root");
+                }
+                /* Add to the list? */
+                if (isRoot)
+                    rootBlocks.add(block);
+            }
+        }
+        /* Return the roots */
+        Message_1.Message.print(ViewTree.MODULE, "Found " + rootBlocks.size() + " root blocks");
+        return rootBlocks;
+    }
+    /**
+     * Get the number of levels.
+     * @return the number of levels.
+     */
+    getLevelCount() {
+        return this._levels.length;
+    }
+    /**
+     * Get a level.
+     * @param index the index of the level.
+     * @return the level.
+     */
+    getLevel(index) {
+        return this._levels[index];
+    }
+    /**
+     * Get the data bounds.
+     * @return the data bounds.
+     */
+    getDataBounds() {
+        return this._dataBounds;
+    }
+    /**
+     * Set the blocks for a level (after a data load operation).
+     * @param level the level.
+     * @param blockIndexes the indexes of the blocks in the level.
+     */
+    setLevelBlocks(level, blockIndexes) {
+        if (blockIndexes == null)
+            return;
+        let blockList = new Array(blockIndexes.length);
+        for (let i = 0; i < blockIndexes.length; i++)
+            blockList[i] = new Block_1.Block(blockIndexes[i]);
+        level.setBlockList(blockList);
+        Message_1.Message.print(ViewTree.MODULE, "Loaded " + blockIndexes.length + " blocks for level " + level.getIndex());
+    }
+    /**
+     * Set the tiles for a block (after a data load operation).
+     * @param blockIndex the index of the block.
+     * @param tileIndexes the indexes of the tiles in the block.
+     */
+    setBlockTiles(blockIndex, tileIndexes) {
+        let level = this._levels[blockIndex.level];
+        let block = level.findBlock(blockIndex);
+        block.setTiles(tileIndexes);
+    }
+    /**
+     * Split a tile into lower-level tiles.
+     * @param level the level of the tile to split.
+     * @param tile the tile to split.
+     * @param childLevel the lower level of the tile.
+     * @param children the list of children to split into.
+     * @param levelsToLoad the list of levels to load.
+     * @param blocksToLoad the list of blocks to load.
+     * @return true if the list of children is complete.
+     */
+    splitTile(level, tile, childLevel, children, levelsToLoad, blocksToLoad) {
+        /* Clear the result */
+        children.clear();
+        /* Already calculated? */
+        let childList = tile.children;
+        if (childList != null) {
+            /* Return */
+            for (let child of childList)
+                children.add(child);
+            return true;
+        }
+        /* Assume we have a complete list of children */
+        let complete = true;
+        /* Unloaded level? */
+        if (childLevel.getBlockCount() == 0) {
+            /* No need to continue, we need the level block list */
+            if (levelsToLoad.contains(childLevel) == false)
+                levelsToLoad.add(childLevel);
+            return false;
+        }
+        /* Check the 8 possible child tiles */
+        let index = tile.gridIndex;
+        let childIndex = new GridIndex_1.GridIndex(0, 0, 0);
+        for (let z = 0; z < 2; z++)
+            for (let y = 0; y < 2; y++)
+                for (let x = 0; x < 2; x++) {
+                    /* Get the index of the child */
+                    childIndex.x = (2 * index.x + x);
+                    childIndex.y = (2 * index.y + y);
+                    childIndex.z = (2 * index.z + z);
+                    /* Find the block */
+                    let block = childLevel.findBlockForTile(childIndex);
+                    if (block == null) {
+                        /* This should not happen */
+                        Message_1.Message.printWarning(ViewTree.MODULE, "Unable to find tile block " + childIndex + " in child level " + childLevel.getIndex() + " (" + childLevel.getBlockCount() + " blocks)");
+                        complete = false;
+                        continue;
+                    }
+                    /* No tile info in the block? */
+                    if (block.hasTiles() == false) {
+                        /* Load the block data */
+                        if (blocksToLoad.contains(block.getBlockIndex()) == false)
+                            blocksToLoad.add(block.getBlockIndex());
+                        complete = false;
+                    }
+                    else {
+                        /* Find the child */
+                        let child = block.findTile(childIndex);
+                        if (child != null)
+                            children.add(child);
+                    }
+                }
+        /* Store the result if complete */
+        if (complete) {
+            /* Store */
+            let tileChildren = new Array(children.size());
+            for (let i = 0; i < tileChildren.length; i++)
+                tileChildren[i] = children.get(i);
+            tile.children = tileChildren;
+        }
+        /* Do we have all children? */
+        return complete;
+    }
+    /**
+     * Is all tile data available for rendering?
+     * @param viewRequest the view request.
+     * @param tiles a list of tiles to check.
+     * @param missingTiles the list of tiles whose data is missing.
+     */
+    checkDataAvailable(viewRequest, tiles, missingTiles) {
+        /* Check all tiles */
+        missingTiles.clear();
+        for (let i = 0; i < tiles.size(); i++) {
+            /* Get the next tile */
+            let tile = tiles.get(i);
+            /* Not available? */
+            if (this._dataManager.isTileLoaded(tile) == null) {
+                /* Request to load the block */
+                missingTiles.add(tile);
+            }
+            else {
+                /* Touch the block */
+                tile.accessTime = viewRequest.getFrameTime();
+            }
+        }
+    }
+    /**
+     * Is all tile data available for rendering?
+     * @param viewRequest the view request.
+     * @param tiles a list of tiles to check.
+     * @return true if the tile data is available.
+     */
+    isDataAvailable(viewRequest, tiles) {
+        /* Check all tiles */
+        for (let i = 0; i < tiles.length; i++) {
+            /* Get the next tile */
+            let tile = tiles[i];
+            /* Not available? */
+            if (this._dataManager.isTileLoaded(tile) == null)
+                return false;
+        }
+        /* Available */
+        return true;
+    }
+    /**
+     * Add visible tiles to the view.
+     * @param viewRequest the view request.
+     * @param level the level of the tiles.
+     * @param tiles the tiles to check.
+     * @param visibleTiles the list of visible tiles to add to.
+     */
+    addTilesToView(viewRequest, level, tiles, levelsToLoad, blocksToLoad, tilesToLoad, tilesToRender) {
+        /* No tiles? */
+        if (tiles == null)
+            return;
+        /* Make the lists */
+        let childTiles = new AList_1.AList();
+        let missingChildTiles = new AList_1.AList();
+        /* Check all tiles */
+        for (let i = 0; i < tiles.length; i++) {
+            /* Get the next tile */
+            let tile = tiles[i];
+            if (ViewTree.DEBUG)
+                Message_1.Message.print(ViewTree.MODULE, "Checking tile L" + tile.level + " (" + tile.gridIndex.x + "," + tile.gridIndex.y + "," + tile.gridIndex.z + ")");
+            /* Visible? */
+            let tileBounds = level.getTileGrid().getCellBounds(tile.gridIndex).getIntersection(this._dataBounds);
+            if (ViewTree.DEBUG)
+                Message_1.Message.print(ViewTree.MODULE, "> level " + tile.level);
+            if (viewRequest.isVisibleBox(tileBounds)) {
+                /* Has the tile been loaded? */
+                let tileData = this._dataManager.isTileLoaded(tile);
+                let tileAvailable = (tileData != null);
+                tile.accessTime = viewRequest.getFrameTime();
+                if (ViewTree.DEBUG)
+                    Message_1.Message.print(ViewTree.MODULE, " > available? " + tileAvailable);
+                /* We load all intermediate tiles to avoid holes in the coverage */
+                if (tileAvailable == false)
+                    tilesToLoad.add(tile);
+                /* Split the tile? */
+                let shouldSplit = (level.getIndex() > 0) && viewRequest.shouldSplit(level, tile);
+                if (shouldSplit) {
+                    if (ViewTree.DEBUG)
+                        Message_1.Message.print(ViewTree.MODULE, " > visible, but needs splitting");
+                    /* Find the children at the lower level */
+                    let childLevel = this._levels[level.getIndex() - 1];
+                    let completeChildList = this.splitTile(level, tile, childLevel, childTiles, levelsToLoad, blocksToLoad);
+                    if (completeChildList == false) {
+                        if (ViewTree.DEBUG)
+                            Message_1.Message.print(ViewTree.MODULE, " > loading child indexes");
+                        /* Display the tile while we wait for the block-tiles to load */
+                        if (tileAvailable)
+                            tilesToRender.add(tileData);
+                    }
+                    else {
+                        /* Are all children available with their data? */
+                        this.checkDataAvailable(viewRequest, childTiles, missingChildTiles);
+                        if (missingChildTiles.size() == 0) {
+                            if (ViewTree.DEBUG)
+                                Message_1.Message.print(ViewTree.MODULE, " > rendering children");
+                            /* Add the children */
+                            let childTiles2 = new Array(childTiles.size());
+                            for (let j = 0; j < childTiles2.length; j++)
+                                childTiles2[j] = childTiles.get(j);
+                            this.addTilesToView(viewRequest, childLevel, childTiles2, levelsToLoad, blocksToLoad, tilesToLoad, tilesToRender);
+                        }
+                        else {
+                            if (ViewTree.DEBUG)
+                                Message_1.Message.print(ViewTree.MODULE, " > loading children");
+                            /* Request for the missing children to be loaded */
+                            for (let j = 0; j < missingChildTiles.size(); j++)
+                                tilesToLoad.add(missingChildTiles.get(j));
+                            /* Display the tile while we wait for the child tiles to load */
+                            if (tileAvailable)
+                                tilesToRender.add(tileData);
+                        }
+                    }
+                }
+                else {
+                    /* Display the tile */
+                    if (ViewTree.DEBUG)
+                        Message_1.Message.print(ViewTree.MODULE, " > visible");
+                    if (tileAvailable)
+                        tilesToRender.add(tileData);
+                }
+            }
+            else {
+                /* Log */
+                if (ViewTree.DEBUG)
+                    Message_1.Message.print(ViewTree.MODULE, " > not visible");
+            }
+        }
+    }
+    /**
+     * Find tile indexes for a 3D view.
+     * @param viewRequest the request parameters.
+     * @param visibleTiles the list of visible tiles to add to.
+     * @param availableTiles the set of available tiles.
+     * @param visibleAvailableTiles the list if visible and available tiles to add to.
+     */
+    renderView3D(viewRequest, levelsToLoad, blocksToLoad, tilesToLoad, tilesToRender) {
+        /* Log? */
+        if (ViewTree.DEBUG)
+            Message_1.Message.print(ViewTree.MODULE, "Finding pointcloud tiles to render");
+        if (ViewTree.DEBUG)
+            Message_1.Message.print(ViewTree.MODULE, " > dataBounds: " + this._dataBounds);
+        //if (DEBUG) Message.print(MODULE," > view: "+viewRequest.getViewProjection());
+        //if (DEBUG) Message.print(MODULE," > distance: "+viewRequest.getDistanceRange());
+        //if (DEBUG) Message.print(MODULE," > model-transform: "+viewRequest.getModelTransform());
+        /* Check all blocks */
+        tilesToRender.clear();
+        if (ViewTree.DEBUG)
+            Message_1.Message.print(ViewTree.MODULE, "Checking " + this._rootBlocks.size() + " root blocks");
+        for (let i = 0; i < this._rootBlocks.size(); i++) // start from the root tiles
+         {
+            /* Visible? */
+            let block = this._rootBlocks.get(i);
+            let blockIndex = block.getBlockIndex();
+            let level = this._levels[blockIndex.level];
+            /* Visible? */
+            if (ViewTree.DEBUG)
+                Message_1.Message.print(ViewTree.MODULE, "Checking top-level block L" + blockIndex.level + " (" + blockIndex.gridIndex.x + "," + blockIndex.gridIndex.y + "," + blockIndex.gridIndex.z + ")");
+            let blockBounds = block.getBlockBounds(level).getIntersection(this._dataBounds);
+            if (ViewTree.DEBUG)
+                Message_1.Message.print(ViewTree.MODULE, " > blockBounds: " + blockBounds);
+            if (viewRequest.isVisibleBox(blockBounds)) {
+                /* Add the tiles */
+                if (ViewTree.DEBUG)
+                    Message_1.Message.print(ViewTree.MODULE, " > visible");
+                this.addTilesToView(viewRequest, level, block.getTiles(blocksToLoad), levelsToLoad, blocksToLoad, tilesToLoad, tilesToRender);
+            }
+        }
+    }
+}
+exports.ViewTree = ViewTree;
+/** The name of this module */
+ViewTree.MODULE = "ViewTree";
+/** Debug mode? */
+ViewTree.DEBUG = false;
+//# sourceMappingURL=ViewTree.js.map

package/lib/cjs/pointcloud/render/ViewTree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ViewTree.js","sourceRoot":"","sources":["../../../../src/pointcloud/render/ViewTree.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAWH,yDAAsD;AACtD,0DAAuD;AAEvD,kDAA+C;AAI/C,mCAAgC;AAIhC;;;;GAIG;AACH,gBAAgB;AAChB,MAAa,QAAQ;IAgBpB;;;;OAIG;IACH,YAAmB,WAAwB,EAAE,MAAoB,EAAE,UAAkB;QACpF,0BAA0B;QAC1B,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;QAChC,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;QACtB,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;QAC9B,0BAA0B;QAC1B,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;IAC1C,CAAC;IAED;;;OAGG;IACK,cAAc;QACrB,qCAAqC;QACrC,IAAI,UAAU,GAAU,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAClD,IAAI,UAAU,GAAG,CAAC;YAAE,UAAU,GAAG,CAAC,CAAC;QACnC,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,8CAA8C,GAAG,UAAU,GAAG,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAC3H,sBAAsB;QACtB,IAAI,UAAU,GAAiB,IAAI,aAAK,EAAS,CAAC;QAClD,IAAI,cAAc,GAAc,IAAI,qBAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACvD,KAAK,IAAI,CAAC,GAAW,UAAU,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAClE,mCAAmC;YACnC,IAAI,KAAK,GAAU,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACnC,KAAK,IAAI,KAAK,IAAI,KAAK,CAAC,SAAS,EAAE,EAAE;gBACpC,oBAAoB;gBACpB,IAAI,MAAM,GAAY,IAAI,CAAC;gBAC3B,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE;oBAChC,kDAAkD;oBAClD,KAAK,CAAC,aAAa,EAAE,CAAC,SAAS,CAAC,iBAAiB,CAAC,cAAc,CAAC,CAAC;oBAClE,MAAM,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,kBAAkB,CAAC,cAAc,CAAC,IAAI,IAAI,CAAC,CAAC;oBAC1E,IAAI,MAAM;wBAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,SAAS,GAAG,CAAC,GAAG,GAAG,GAAG,KAAK,CAAC,aAAa,EAAE,CAAC,SAAS,GAAG,kBAAkB,CAAC,CAAC;iBACvH;gBACD,sBAAsB;gBACtB,IAAI,MAAM;oBAAE,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;aAClC;SACD;QACD,sBAAsB;QACtB,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,GAAG,UAAU,CAAC,IAAI,EAAE,GAAG,cAAc,CAAC,CAAC;QAC9E,OAAO,UAAU,CAAC;IACnB,CAAC;IAED;;;OAGG;IACI,aAAa;QACnB,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IAC5B,CAAC;IAED;;;;OAIG;IACI,QAAQ,CAAC,KAAY;QAC3B,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IAED;;;OAGG;IACI,aAAa;QACnB,OAAO,IAAI,CAAC,WAAW,CAAC;IACzB,CAAC;IAED;;;;OAIG;IACI,cAAc,CAAC,KAAY,EAAE,YAA+B;QAClE,IAAI,YAAY,IAAI,IAAI;YAAE,OAAO;QACjC,IAAI,SAAS,GAAiB,IAAI,KAAK,CAAQ,YAAY,CAAC,MAAM,CAAC,CAAC;QACpE,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,SAAS,CAAC,CAAC,CAAC,GAAG,IAAI,aAAK,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;QAChG,KAAK,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;QAC9B,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,SAAS,GAAG,YAAY,CAAC,MAAM,GAAG,oBAAoB,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;IAC3G,CAAC;IAED;;;;OAIG;IACI,aAAa,CAAC,UAAsB,EAAE,WAA6B;QACzE,IAAI,KAAK,GAAU,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QAClD,IAAI,KAAK,GAAU,KAAK,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QAC/C,KAAK,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;IAC7B,CAAC;IAED;;;;;;;;;OASG;IACK,SAAS,CAAC,KAAY,EAAE,IAAe,EAAE,UAAiB,EAAE,QAA0B,EAAE,YAA0B,EAAE,YAA+B;QAC1J,sBAAsB;QACtB,QAAQ,CAAC,KAAK,EAAE,CAAC;QACjB,yBAAyB;QACzB,IAAI,SAAS,GAAqB,IAAI,CAAC,QAAQ,CAAC;QAChD,IAAI,SAAS,IAAI,IAAI,EAAE;YACtB,YAAY;YACZ,KAAK,IAAI,KAAK,IAAI,SAAS;gBAAE,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACjD,OAAO,IAAI,CAAC;SACZ;QACD,gDAAgD;QAChD,IAAI,QAAQ,GAAY,IAAI,CAAC;QAC7B,qBAAqB;QACrB,IAAI,UAAU,CAAC,aAAa,EAAE,IAAI,CAAC,EAAE;YACpC,uDAAuD;YACvD,IAAI,YAAY,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,KAAK;gBAAE,YAAY,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YAC7E,OAAO,KAAK,CAAC;SACb;QACD,sCAAsC;QACtC,IAAI,KAAK,GAAc,IAAI,CAAC,SAAS,CAAC;QACtC,IAAI,UAAU,GAAc,IAAI,qBAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACnD,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAAE,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;oBAC3G,gCAAgC;oBAChC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBACjC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBACjC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBACjC,oBAAoB;oBACpB,IAAI,KAAK,GAAU,UAAU,CAAC,gBAAgB,CAAC,UAAU,CAAC,CAAC;oBAC3D,IAAI,KAAK,IAAI,IAAI,EAAE;wBAClB,4BAA4B;wBAC5B,iBAAO,CAAC,YAAY,CAAC,QAAQ,CAAC,MAAM,EAAE,4BAA4B,GAAG,UAAU,GAAG,kBAAkB,GAAG,UAAU,CAAC,QAAQ,EAAE,GAAG,IAAI,GAAG,UAAU,CAAC,aAAa,EAAE,GAAG,UAAU,CAAC,CAAC;wBAC/K,QAAQ,GAAG,KAAK,CAAC;wBACjB,SAAS;qBACT;oBACD,gCAAgC;oBAChC,IAAI,KAAK,CAAC,QAAQ,EAAE,IAAI,KAAK,EAAE;wBAC9B,yBAAyB;wBACzB,IAAI,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC,IAAI,KAAK;4BAAE,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC,CAAC;wBACnG,QAAQ,GAAG,KAAK,CAAC;qBACjB;yBACI;wBACJ,oBAAoB;wBACpB,IAAI,KAAK,GAAc,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;wBAClD,IAAI,KAAK,IAAI,IAAI;4BAAE,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;qBACvC;iBACD;QACD,kCAAkC;QAClC,IAAI,QAAQ,EAAE;YACb,WAAW;YACX,IAAI,YAAY,GAAqB,IAAI,KAAK,CAAY,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;YAC3E,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE;gBAAE,YAAY,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACxF,IAAI,CAAC,QAAQ,GAAG,YAAY,CAAC;SAC7B;QACD,8BAA8B;QAC9B,OAAO,QAAQ,CAAC;IACjB,CAAC;IAED;;;;;OAKG;IACK,kBAAkB,CAAC,WAAyB,EAAE,KAAuB,EAAE,YAA8B;QAC5G,qBAAqB;QACrB,YAAY,CAAC,KAAK,EAAE,CAAC;QACrB,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE;YAC9C,uBAAuB;YACvB,IAAI,IAAI,GAAc,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACnC,oBAAoB;YACpB,IAAI,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,IAAI,EAAE;gBACjD,+BAA+B;gBAC/B,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;aACvB;iBACI;gBACJ,qBAAqB;gBACrB,IAAI,CAAC,UAAU,GAAG,WAAW,CAAC,YAAY,EAAE,CAAC;aAC7C;SACD;IACF,CAAC;IAED;;;;;OAKG;IACK,eAAe,CAAC,WAAyB,EAAE,KAAuB;QACzE,qBAAqB;QACrB,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC9C,uBAAuB;YACvB,IAAI,IAAI,GAAc,KAAK,CAAC,CAAC,CAAC,CAAC;YAC/B,oBAAoB;YACpB,IAAI,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,IAAI;gBAAE,OAAO,KAAK,CAAC;SAC/D;QACD,eAAe;QACf,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;;;;OAMG;IACK,cAAc,CAAC,WAAyB,EAAE,KAAY,EAAE,KAAuB,EAAE,YAA0B,EAAE,YAA+B,EAAE,WAA6B,EAAE,aAA+B;QACnN,eAAe;QACf,IAAI,KAAK,IAAI,IAAI;YAAE,OAAO;QAC1B,oBAAoB;QACpB,IAAI,UAAU,GAAqB,IAAI,aAAK,EAAa,CAAC;QAC1D,IAAI,iBAAiB,GAAqB,IAAI,aAAK,EAAa,CAAC;QACjE,qBAAqB;QACrB,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC9C,uBAAuB;YACvB,IAAI,IAAI,GAAc,KAAK,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,QAAQ,CAAC,KAAK;gBAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,iBAAiB,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;YACrK,cAAc;YACd,IAAI,UAAU,GAAW,KAAK,CAAC,WAAW,EAAE,CAAC,aAAa,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAC7G,IAAI,QAAQ,CAAC,KAAK;gBAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;YAC5E,IAAI,WAAW,CAAC,YAAY,CAAC,UAAU,CAAC,EAAE;gBACzC,+BAA+B;gBAC/B,IAAI,QAAQ,GAAc,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;gBAC/D,IAAI,aAAa,GAAY,CAAC,QAAQ,IAAI,IAAI,CAAC,CAAC;gBAChD,IAAI,CAAC,UAAU,GAAG,WAAW,CAAC,YAAY,EAAE,CAAC;gBAC7C,IAAI,QAAQ,CAAC,KAAK;oBAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,gBAAgB,GAAG,aAAa,CAAC,CAAC;gBACrF,mEAAmE;gBACnE,IAAI,aAAa,IAAI,KAAK;oBAAE,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAClD,qBAAqB;gBACrB,IAAI,WAAW,GAAY,CAAC,KAAK,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC,IAAI,WAAW,CAAC,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;gBAC1F,IAAI,WAAW,EAAE;oBAChB,IAAI,QAAQ,CAAC,KAAK;wBAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,iCAAiC,CAAC,CAAC;oBACtF,0CAA0C;oBAC1C,IAAI,UAAU,GAAU,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC,CAAC;oBAC3D,IAAI,iBAAiB,GAAY,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,UAAU,EAAE,UAAU,EAAE,YAAY,EAAE,YAAY,CAAC,CAAC;oBACjH,IAAI,iBAAiB,IAAI,KAAK,EAAE;wBAC/B,IAAI,QAAQ,CAAC,KAAK;4BAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,0BAA0B,CAAC,CAAC;wBAC/E,gEAAgE;wBAChE,IAAI,aAAa;4BAAE,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;qBAC/C;yBACI;wBACJ,iDAAiD;wBACjD,IAAI,CAAC,kBAAkB,CAAC,WAAW,EAAE,UAAU,EAAE,iBAAiB,CAAC,CAAC;wBACpE,IAAI,iBAAiB,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE;4BAClC,IAAI,QAAQ,CAAC,KAAK;gCAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,uBAAuB,CAAC,CAAC;4BAC5E,sBAAsB;4BACtB,IAAI,WAAW,GAAqB,IAAI,KAAK,CAAY,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC;4BAC5E,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE;gCAAE,WAAW,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;4BACxF,IAAI,CAAC,cAAc,CAAC,WAAW,EAAE,UAAU,EAAE,WAAW,EAAE,YAAY,EAAE,YAAY,EAAE,WAAW,EAAE,aAAa,CAAC,CAAC;yBAClH;6BACI;4BACJ,IAAI,QAAQ,CAAC,KAAK;gCAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,qBAAqB,CAAC,CAAC;4BAC1E,mDAAmD;4BACnD,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,iBAAiB,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE;gCAAE,WAAW,CAAC,GAAG,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;4BACrG,gEAAgE;4BAChE,IAAI,aAAa;gCAAE,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;yBAC/C;qBACD;iBACD;qBACI;oBACJ,sBAAsB;oBACtB,IAAI,QAAQ,CAAC,KAAK;wBAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;oBACjE,IAAI,aAAa;wBAAE,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;iBAC/C;aACD;iBACI;gBACJ,SAAS;gBACT,IAAI,QAAQ,CAAC,KAAK;oBAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;aACrE;SACD;IACF,CAAC;IAED;;;;;;OAMG;IACI,YAAY,CAAC,WAAyB,EAAE,YAA0B,EAAE,YAA+B,EAAE,WAA6B,EAAE,aAA+B;QACzK,UAAU;QACV,IAAI,QAAQ,CAAC,KAAK;YAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,oCAAoC,CAAC,CAAC;QACzF,IAAI,QAAQ,CAAC,KAAK;YAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,iBAAiB,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;QACzF,+EAA+E;QAC/E,kFAAkF;QAClF,0FAA0F;QAC1F,sBAAsB;QACtB,aAAa,CAAC,KAAK,EAAE,CAAC;QACtB,IAAI,QAAQ,CAAC,KAAK;YAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,GAAG,cAAc,CAAC,CAAC;QAC3G,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,4BAA4B;SACtF;YACC,cAAc;YACd,IAAI,KAAK,GAAU,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC3C,IAAI,UAAU,GAAe,KAAK,CAAC,aAAa,EAAE,CAAC;YACnD,IAAI,KAAK,GAAU,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YAClD,cAAc;YACd,IAAI,QAAQ,CAAC,KAAK;gBAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,4BAA4B,GAAG,UAAU,CAAC,KAAK,GAAG,IAAI,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,GAAG,GAAG,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,GAAG,GAAG,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;YACxM,IAAI,WAAW,GAAW,KAAK,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YACxF,IAAI,QAAQ,CAAC,KAAK;gBAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,kBAAkB,GAAG,WAAW,CAAC,CAAC;YACrF,IAAI,WAAW,CAAC,YAAY,CAAC,WAAW,CAAC,EAAE;gBAC1C,mBAAmB;gBACnB,IAAI,QAAQ,CAAC,KAAK;oBAAE,iBAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;gBACjE,IAAI,CAAC,cAAc,CAAC,WAAW,EAAE,KAAK,EAAE,KAAK,CAAC,QAAQ,CAAC,YAAY,CAAC,EAAE,YAAY,EAAE,YAAY,EAAE,WAAW,EAAE,aAAa,CAAC,CAAC;aAC9H;SACD;IACF,CAAC;;AAvUF,4BAwUC;AAvUA,8BAA8B;AACN,eAAM,GAAW,UAAU,CAAC;AAEpD,kBAAkB;AACM,cAAK,GAAY,KAAK,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module OrbitGT\r\n */\r\n\r\n//package orbitgt.pointcloud.render;\r\n\r\ntype int8 = number;\r\ntype int16 = number;\r\ntype int32 = number;\r\ntype float32 = number;\r\ntype float64 = number;\r\n\r\nimport { Bounds } from \"../../spatial/geom/Bounds\";\r\nimport { AList } from \"../../system/collection/AList\";\r\nimport { Message } from \"../../system/runtime/Message\";\r\nimport { BlockIndex } from \"../model/BlockIndex\";\r\nimport { GridIndex } from \"../model/GridIndex\";\r\nimport { PointData } from \"../model/PointData\";\r\nimport { TileIndex } from \"../model/TileIndex\";\r\nimport { AViewRequest } from \"./AViewRequest\";\r\nimport { Block } from \"./Block\";\r\nimport { DataManager } from \"./DataManager\";\r\nimport { Level } from \"./Level\";\r\n\r\n/**\r\n * Class TileSpatialIndex manages a spatial index of levels, blocks and tiles in pointcloud. The index does not store data, only block and tile indexes.\r\n *\r\n * @version 1.0 November 2015\r\n */\r\n/** @internal */\r\nexport class ViewTree {\r\n\t/** The name of this module */\r\n\tprivate static readonly MODULE: string = \"ViewTree\";\r\n\r\n\t/** Debug mode? */\r\n\tprivate static readonly DEBUG: boolean = false;\r\n\r\n\t/** The data manager */\r\n\tprivate _dataManager: DataManager;\r\n\t/** The levels */\r\n\tprivate _levels: Array<Level>;\r\n\t/** The data bounds */\r\n\tprivate _dataBounds: Bounds;\r\n\t/** The root blocks */\r\n\tprivate _rootBlocks: AList<Block>;\r\n\r\n\t/**\r\n\t * Create a new tree.\r\n\t * @param levels the levels.\r\n\t * @param dataBounds the data bounds.\r\n\t */\r\n\tpublic constructor(dataManager: DataManager, levels: Array<Level>, dataBounds: Bounds) {\r\n\t\t/* Store the parameters */\r\n\t\tthis._dataManager = dataManager;\r\n\t\tthis._levels = levels;\r\n\t\tthis._dataBounds = dataBounds;\r\n\t\t/* Find the root blocks */\r\n\t\tthis._rootBlocks = this.findRootBlocks();\r\n\t}\r\n\r\n\t/**\r\n\t * Find all root blocks (dropping of single-point tiles during pyramid creation can lead to missing branches).\r\n\t * @return all root blocks.\r\n\t */\r\n\tprivate findRootBlocks(): AList<Block> {\r\n\t\t/* Check some levels below the top */\r\n\t\tlet startLevel: int32 = (this._levels.length - 6);\r\n\t\tif (startLevel < 0) startLevel = 0;\r\n\t\tMessage.print(ViewTree.MODULE, \"Finding root blocks starting at level index \" + startLevel + \" of \" + this._levels.length);\r\n\t\t/* Check the levels */\r\n\t\tlet rootBlocks: AList<Block> = new AList<Block>();\r\n\t\tlet nextLevelIndex: GridIndex = new GridIndex(0, 0, 0);\r\n\t\tfor (let i: number = startLevel; i < this._levels.length - 1; i++) {\r\n\t\t\t/* Check all blocks in the level */\r\n\t\t\tlet level: Level = this._levels[i];\r\n\t\t\tfor (let block of level.getBlocks()) {\r\n\t\t\t\t/* Non-top level? */\r\n\t\t\t\tlet isRoot: boolean = true;\r\n\t\t\t\tif (i < this._levels.length - 2) {\r\n\t\t\t\t\t/* Do we have a parent block in the next level? */\r\n\t\t\t\t\tblock.getBlockIndex().gridIndex.getNextLevelIndex(nextLevelIndex);\r\n\t\t\t\t\tisRoot = (this._levels[i + 1].findBlockGridIndex(nextLevelIndex) == null);\r\n\t\t\t\t\tif (isRoot) Message.print(ViewTree.MODULE, \"Block L\" + i + \" \" + block.getBlockIndex().gridIndex + \" is non-top root\");\r\n\t\t\t\t}\r\n\t\t\t\t/* Add to the list? */\r\n\t\t\t\tif (isRoot) rootBlocks.add(block);\r\n\t\t\t}\r\n\t\t}\r\n\t\t/* Return the roots */\r\n\t\tMessage.print(ViewTree.MODULE, \"Found \" + rootBlocks.size() + \" root blocks\");\r\n\t\treturn rootBlocks;\r\n\t}\r\n\r\n\t/**\r\n\t * Get the number of levels.\r\n\t * @return the number of levels.\r\n\t */\r\n\tpublic getLevelCount(): int32 {\r\n\t\treturn this._levels.length;\r\n\t}\r\n\r\n\t/**\r\n\t * Get a level.\r\n\t * @param index the index of the level.\r\n\t * @return the level.\r\n\t */\r\n\tpublic getLevel(index: int32): Level {\r\n\t\treturn this._levels[index];\r\n\t}\r\n\r\n\t/**\r\n\t * Get the data bounds.\r\n\t * @return the data bounds.\r\n\t */\r\n\tpublic getDataBounds(): Bounds {\r\n\t\treturn this._dataBounds;\r\n\t}\r\n\r\n\t/**\r\n\t * Set the blocks for a level (after a data load operation).\r\n\t * @param level the level.\r\n\t * @param blockIndexes the indexes of the blocks in the level.\r\n\t */\r\n\tpublic setLevelBlocks(level: Level, blockIndexes: Array<BlockIndex>): void {\r\n\t\tif (blockIndexes == null) return;\r\n\t\tlet blockList: Array<Block> = new Array<Block>(blockIndexes.length);\r\n\t\tfor (let i: number = 0; i < blockIndexes.length; i++) blockList[i] = new Block(blockIndexes[i]);\r\n\t\tlevel.setBlockList(blockList);\r\n\t\tMessage.print(ViewTree.MODULE, \"Loaded \" + blockIndexes.length + \" blocks for level \" + level.getIndex());\r\n\t}\r\n\r\n\t/**\r\n\t * Set the tiles for a block (after a data load operation).\r\n\t * @param blockIndex the index of the block.\r\n\t * @param tileIndexes the indexes of the tiles in the block.\r\n\t */\r\n\tpublic setBlockTiles(blockIndex: BlockIndex, tileIndexes: Array<TileIndex>): void {\r\n\t\tlet level: Level = this._levels[blockIndex.level];\r\n\t\tlet block: Block = level.findBlock(blockIndex);\r\n\t\tblock.setTiles(tileIndexes);\r\n\t}\r\n\r\n\t/**\r\n\t * Split a tile into lower-level tiles.\r\n\t * @param level the level of the tile to split.\r\n\t * @param tile the tile to split.\r\n\t * @param childLevel the lower level of the tile.\r\n\t * @param children the list of children to split into.\r\n     * @param levelsToLoad the list of levels to load.\r\n     * @param blocksToLoad the list of blocks to load.\r\n\t * @return true if the list of children is complete.\r\n\t */\r\n\tprivate splitTile(level: Level, tile: TileIndex, childLevel: Level, children: AList<TileIndex>, levelsToLoad: AList<Level>, blocksToLoad: AList<BlockIndex>): boolean {\r\n\t\t/* Clear the result */\r\n\t\tchildren.clear();\r\n\t\t/* Already calculated? */\r\n\t\tlet childList: Array<TileIndex> = tile.children;\r\n\t\tif (childList != null) {\r\n\t\t\t/* Return */\r\n\t\t\tfor (let child of childList) children.add(child);\r\n\t\t\treturn true;\r\n\t\t}\r\n\t\t/* Assume we have a complete list of children */\r\n\t\tlet complete: boolean = true;\r\n\t\t/* Unloaded level? */\r\n\t\tif (childLevel.getBlockCount() == 0) {\r\n\t\t\t/* No need to continue, we need the level block list */\r\n\t\t\tif (levelsToLoad.contains(childLevel) == false) levelsToLoad.add(childLevel);\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\t/* Check the 8 possible child tiles */\r\n\t\tlet index: GridIndex = tile.gridIndex;\r\n\t\tlet childIndex: GridIndex = new GridIndex(0, 0, 0);\r\n\t\tfor (let z: number = 0; z < 2; z++) for (let y: number = 0; y < 2; y++) for (let x: number = 0; x < 2; x++) {\r\n\t\t\t/* Get the index of the child */\r\n\t\t\tchildIndex.x = (2 * index.x + x);\r\n\t\t\tchildIndex.y = (2 * index.y + y);\r\n\t\t\tchildIndex.z = (2 * index.z + z);\r\n\t\t\t/* Find the block */\r\n\t\t\tlet block: Block = childLevel.findBlockForTile(childIndex);\r\n\t\t\tif (block == null) {\r\n\t\t\t\t/* This should not happen */\r\n\t\t\t\tMessage.printWarning(ViewTree.MODULE, \"Unable to find tile block \" + childIndex + \" in child level \" + childLevel.getIndex() + \" (\" + childLevel.getBlockCount() + \" blocks)\");\r\n\t\t\t\tcomplete = false;\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\t\t\t/* No tile info in the block? */\r\n\t\t\tif (block.hasTiles() == false) {\r\n\t\t\t\t/* Load the block data */\r\n\t\t\t\tif (blocksToLoad.contains(block.getBlockIndex()) == false) blocksToLoad.add(block.getBlockIndex());\r\n\t\t\t\tcomplete = false;\r\n\t\t\t}\r\n\t\t\telse {\r\n\t\t\t\t/* Find the child */\r\n\t\t\t\tlet child: TileIndex = block.findTile(childIndex);\r\n\t\t\t\tif (child != null) children.add(child);\r\n\t\t\t}\r\n\t\t}\r\n\t\t/* Store the result if complete */\r\n\t\tif (complete) {\r\n\t\t\t/* Store */\r\n\t\t\tlet tileChildren: Array<TileIndex> = new Array<TileIndex>(children.size());\r\n\t\t\tfor (let i: number = 0; i < tileChildren.length; i++) tileChildren[i] = children.get(i);\r\n\t\t\ttile.children = tileChildren;\r\n\t\t}\r\n\t\t/* Do we have all children? */\r\n\t\treturn complete;\r\n\t}\r\n\r\n\t/**\r\n\t * Is all tile data available for rendering?\r\n\t * @param viewRequest the view request.\r\n\t * @param tiles a list of tiles to check.\r\n\t * @param missingTiles the list of tiles whose data is missing.\r\n\t */\r\n\tprivate checkDataAvailable(viewRequest: AViewRequest, tiles: AList<TileIndex>, missingTiles: AList<TileIndex>): void {\r\n\t\t/* Check all tiles */\r\n\t\tmissingTiles.clear();\r\n\t\tfor (let i: number = 0; i < tiles.size(); i++) {\r\n\t\t\t/* Get the next tile */\r\n\t\t\tlet tile: TileIndex = tiles.get(i);\r\n\t\t\t/* Not available? */\r\n\t\t\tif (this._dataManager.isTileLoaded(tile) == null) {\r\n\t\t\t\t/* Request to load the block */\r\n\t\t\t\tmissingTiles.add(tile);\r\n\t\t\t}\r\n\t\t\telse {\r\n\t\t\t\t/* Touch the block */\r\n\t\t\t\ttile.accessTime = viewRequest.getFrameTime();\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\t/**\r\n\t * Is all tile data available for rendering?\r\n\t * @param viewRequest the view request.\r\n\t * @param tiles a list of tiles to check.\r\n\t * @return true if the tile data is available.\r\n\t */\r\n\tprivate isDataAvailable(viewRequest: AViewRequest, tiles: Array<TileIndex>): boolean {\r\n\t\t/* Check all tiles */\r\n\t\tfor (let i: number = 0; i < tiles.length; i++) {\r\n\t\t\t/* Get the next tile */\r\n\t\t\tlet tile: TileIndex = tiles[i];\r\n\t\t\t/* Not available? */\r\n\t\t\tif (this._dataManager.isTileLoaded(tile) == null) return false;\r\n\t\t}\r\n\t\t/* Available */\r\n\t\treturn true;\r\n\t}\r\n\r\n\t/**\r\n\t * Add visible tiles to the view.\r\n\t * @param viewRequest the view request.\r\n\t * @param level the level of the tiles.\r\n\t * @param tiles the tiles to check.\r\n\t * @param visibleTiles the list of visible tiles to add to.\r\n\t */\r\n\tprivate addTilesToView(viewRequest: AViewRequest, level: Level, tiles: Array<TileIndex>, levelsToLoad: AList<Level>, blocksToLoad: AList<BlockIndex>, tilesToLoad: AList<TileIndex>, tilesToRender: AList<PointData>): void {\r\n\t\t/* No tiles? */\r\n\t\tif (tiles == null) return;\r\n\t\t/* Make the lists */\r\n\t\tlet childTiles: AList<TileIndex> = new AList<TileIndex>();\r\n\t\tlet missingChildTiles: AList<TileIndex> = new AList<TileIndex>();\r\n\t\t/* Check all tiles */\r\n\t\tfor (let i: number = 0; i < tiles.length; i++) {\r\n\t\t\t/* Get the next tile */\r\n\t\t\tlet tile: TileIndex = tiles[i];\r\n\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \"Checking tile L\" + tile.level + \" (\" + tile.gridIndex.x + \",\" + tile.gridIndex.y + \",\" + tile.gridIndex.z + \")\");\r\n\t\t\t/* Visible? */\r\n\t\t\tlet tileBounds: Bounds = level.getTileGrid().getCellBounds(tile.gridIndex).getIntersection(this._dataBounds);\r\n\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \"> level \" + tile.level);\r\n\t\t\tif (viewRequest.isVisibleBox(tileBounds)) {\r\n\t\t\t\t/* Has the tile been loaded? */\r\n\t\t\t\tlet tileData: PointData = this._dataManager.isTileLoaded(tile);\r\n\t\t\t\tlet tileAvailable: boolean = (tileData != null);\r\n\t\t\t\ttile.accessTime = viewRequest.getFrameTime();\r\n\t\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \" > available? \" + tileAvailable);\r\n\t\t\t\t/* We load all intermediate tiles to avoid holes in the coverage */\r\n\t\t\t\tif (tileAvailable == false) tilesToLoad.add(tile);\r\n\t\t\t\t/* Split the tile? */\r\n\t\t\t\tlet shouldSplit: boolean = (level.getIndex() > 0) && viewRequest.shouldSplit(level, tile);\r\n\t\t\t\tif (shouldSplit) {\r\n\t\t\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \" > visible, but needs splitting\");\r\n\t\t\t\t\t/* Find the children at the lower level */\r\n\t\t\t\t\tlet childLevel: Level = this._levels[level.getIndex() - 1];\r\n\t\t\t\t\tlet completeChildList: boolean = this.splitTile(level, tile, childLevel, childTiles, levelsToLoad, blocksToLoad);\r\n\t\t\t\t\tif (completeChildList == false) {\r\n\t\t\t\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \" > loading child indexes\");\r\n\t\t\t\t\t\t/* Display the tile while we wait for the block-tiles to load */\r\n\t\t\t\t\t\tif (tileAvailable) tilesToRender.add(tileData);\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse {\r\n\t\t\t\t\t\t/* Are all children available with their data? */\r\n\t\t\t\t\t\tthis.checkDataAvailable(viewRequest, childTiles, missingChildTiles);\r\n\t\t\t\t\t\tif (missingChildTiles.size() == 0) {\r\n\t\t\t\t\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \" > rendering children\");\r\n\t\t\t\t\t\t\t/* Add the children */\r\n\t\t\t\t\t\t\tlet childTiles2: Array<TileIndex> = new Array<TileIndex>(childTiles.size());\r\n\t\t\t\t\t\t\tfor (let j: number = 0; j < childTiles2.length; j++) childTiles2[j] = childTiles.get(j);\r\n\t\t\t\t\t\t\tthis.addTilesToView(viewRequest, childLevel, childTiles2, levelsToLoad, blocksToLoad, tilesToLoad, tilesToRender);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\telse {\r\n\t\t\t\t\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \" > loading children\");\r\n\t\t\t\t\t\t\t/* Request for the missing children to be loaded */\r\n\t\t\t\t\t\t\tfor (let j: number = 0; j < missingChildTiles.size(); j++) tilesToLoad.add(missingChildTiles.get(j));\r\n\t\t\t\t\t\t\t/* Display the tile while we wait for the child tiles to load */\r\n\t\t\t\t\t\t\tif (tileAvailable) tilesToRender.add(tileData);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\telse {\r\n\t\t\t\t\t/* Display the tile */\r\n\t\t\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \" > visible\");\r\n\t\t\t\t\tif (tileAvailable) tilesToRender.add(tileData);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\telse {\r\n\t\t\t\t/* Log */\r\n\t\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \" > not visible\");\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\t/**\r\n\t * Find tile indexes for a 3D view.\r\n\t * @param viewRequest the request parameters.\r\n\t * @param visibleTiles the list of visible tiles to add to.\r\n\t * @param availableTiles the set of available tiles.\r\n\t * @param visibleAvailableTiles the list if visible and available tiles to add to.\r\n\t */\r\n\tpublic renderView3D(viewRequest: AViewRequest, levelsToLoad: AList<Level>, blocksToLoad: AList<BlockIndex>, tilesToLoad: AList<TileIndex>, tilesToRender: AList<PointData>): void {\r\n\t\t/* Log? */\r\n\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \"Finding pointcloud tiles to render\");\r\n\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \" > dataBounds: \" + this._dataBounds);\r\n\t\t//if (DEBUG) Message.print(MODULE,\" > view: \"+viewRequest.getViewProjection());\r\n\t\t//if (DEBUG) Message.print(MODULE,\" > distance: \"+viewRequest.getDistanceRange());\r\n\t\t//if (DEBUG) Message.print(MODULE,\" > model-transform: \"+viewRequest.getModelTransform());\r\n\t\t/* Check all blocks */\r\n\t\ttilesToRender.clear();\r\n\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \"Checking \" + this._rootBlocks.size() + \" root blocks\");\r\n\t\tfor (let i: number = 0; i < this._rootBlocks.size(); i++) // start from the root tiles\r\n\t\t{\r\n\t\t\t/* Visible? */\r\n\t\t\tlet block: Block = this._rootBlocks.get(i);\r\n\t\t\tlet blockIndex: BlockIndex = block.getBlockIndex();\r\n\t\t\tlet level: Level = this._levels[blockIndex.level];\r\n\t\t\t/* Visible? */\r\n\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \"Checking top-level block L\" + blockIndex.level + \" (\" + blockIndex.gridIndex.x + \",\" + blockIndex.gridIndex.y + \",\" + blockIndex.gridIndex.z + \")\");\r\n\t\t\tlet blockBounds: Bounds = block.getBlockBounds(level).getIntersection(this._dataBounds);\r\n\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \" > blockBounds: \" + blockBounds);\r\n\t\t\tif (viewRequest.isVisibleBox(blockBounds)) {\r\n\t\t\t\t/* Add the tiles */\r\n\t\t\t\tif (ViewTree.DEBUG) Message.print(ViewTree.MODULE, \" > visible\");\r\n\t\t\t\tthis.addTilesToView(viewRequest, level, block.getTiles(blocksToLoad), levelsToLoad, blocksToLoad, tilesToLoad, tilesToRender);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}\r\n"]}

package/lib/cjs/spatial/crs/CRSEngine.d.ts

@@ -0,0 +1,56 @@
+/** @packageDocumentation
+ * @module OrbitGT
+ */
+import { Bounds } from "../geom/Bounds";
+import { Coordinate } from "../geom/Coordinate";
+/**
+ * Abstract class CRSEngine provides a model for CRS transformation engines to implement.
+ */
+/** @internal */
+export declare class CRSEngine {
+    /**
+     * Create a new engine.
+     */
+    constructor();
+    /**
+     * Prepare a CRS for making transforms in a certain area.
+     * @param crs the CRS to prepare.
+     * @param area the area to prepare for (can be invalid to prepare only for the crs).
+     */
+    prepareForArea(crs: string, area: Bounds): Promise<Bounds>;
+    /**
+     * Transform a coordinate from one CRS to another.
+     * @param point the point coordinate.
+     * @param sourceCRS the source CRS.
+     * @param targetCRS the target CRS.
+     * @return the transformed coordinate.
+     */
+    transformPoint(point: Coordinate, sourceCRS: string, targetCRS: string): Coordinate;
+    /**
+     * Check if a CRS is geocentric.
+     * @param crs the CRS to check.
+     * @return true if geocentric.
+     */
+    isGeocentricCRS(crs: string): boolean;
+    /**
+     * Check if a CRS is geographic.
+     * @param crs the CRS to check.
+     * @return true if geocentric.
+     */
+    isGeographicCRS(crs: string): boolean;
+    /**
+     * Check if a CRS is projected.
+     * @param crs the CRS to check.
+     * @return true if geocentric.
+     */
+    isProjectedCRS(crs: string): boolean;
+    /**
+     * Transform spatial bounds from one CRS to another.
+     * @param point the point coordinate.
+     * @param sourceCRS the source CRS.
+     * @param targetCRS the target CRS.
+     * @return the transformed bounds.
+     */
+    transformBounds(bounds: Bounds, sourceCRS: string, targetCRS: string): Bounds;
+}
+//# sourceMappingURL=CRSEngine.d.ts.map

package/lib/cjs/spatial/crs/CRSEngine.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"CRSEngine.d.ts","sourceRoot":"","sources":["../../../../src/spatial/crs/CRSEngine.ts"],"names":[],"mappings":"AAIA;;GAEG;AAUH,OAAO,EAAE,MAAM,EAAE,MAAM,gBAAgB,CAAC;AACxC,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAEhD;;GAEG;AACH,gBAAgB;AAChB,qBAAa,SAAS;IAClB;;OAEG;;IAIH;;;;OAIG;IACU,cAAc,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAKvE;;;;;;OAMG;IACI,cAAc,CAAC,KAAK,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,UAAU;IAK1F;;;;OAIG;IACI,eAAe,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAK5C;;;;OAIG;IACI,eAAe,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAK5C;;;;OAIG;IACI,cAAc,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAK3C;;;;;;OAMG;IACI,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM;CAevF"}