Cesium Gs, Inc.

Analytical Graphics Inc.

International Business Machines Corporation

Patrick Cozzi

Sean Lilley

Joshua Lawrence

Daniel Bagnell

Omar Shehata

Ian Lilley

Kaladhar Voruganti

Prasenjit Sarkar

Lawrence Yiumchee Chiu

Krishnakumar Rao Surugucchi

Kangning Li

James Tucholski

Frank Todd Stoner

Michael Bartholomew

Eli Bogomolny

Francesco Linsalata

Nicholas Lloyd Armstrong-Crews

Peter Gagliardi

Patrick Randolph Eaton

Srinivas Kaza

Zakiuddin Shehzan Ayub Mohammed

Zakiuddin Mohammed

Austin Eng

Systems, methods, devices, and non-transitory media of the various embodiments enable generating at least one hierarchical-level-of-detail (LOD) data structure in order to visualize and traverse measurement data associated with a three-dimensional (3D) model. In various embodiments, generating at least one hierarchical LOD data structure may include establishing a background grid comprising a mathematical grid structure defined in a common coordinate system, building a layout comprising an intermediary data structure, computing measurement data for each tile based at least in part on the height data samples, and storing at least a portion of the computed measurement data for each tile in a metadata file.

System and method for generating hierarchical level-of-detail measurements for runtime calculation and visualization

Systems, methods, devices, and non-transitory media of various embodiments enable rendering of a time-dynamic (4D) volume dataset. Various embodiments may provide a method for responsive and high quality rendering of time-dynamic hierarchical level-of-detail voxel datasets. Various embodiments may provide a prioritization system that balances visual quality and temporal responsiveness even with slow network or filesystem speeds. Various embodiments may provide a compact and efficient storage format for time-dynamic and mixed-resolution voxel rendering on a graphics processing unit (GPU).

Systems and methods for adaptive visual and temporal quality of time-dynamic (4D) volume rendering

Systems, methods, devices, and non-transitory media of various embodiments enable prioritization of requests for hierarchical level of detail (HLOD) content over a communications network. Various embodiment methods may reduce load time of nodes in the HLOD data structure, such as nodes in the HLOD that may be deemed important, compared to the load time achieved in current methods. Various embodiments may provide methods for prioritizing requests for nodes.

Systems and methods for prioritizing requests for hierarchical level of detail content over a communications network

Systems, methods, devices, and non-transitory media of various embodiments enable culling requests for hierarchical level of detail (HLOD) content over a communications network. Various embodiment methods may reduce a number of requests associated with dynamic camera movement, compared to number of requests generated in current methods.

Systems and methods for culling requests for hierarchical level of detail content over a communications network

A system and method of real-time surface reconstruction upon unstructured point clouds via a series of screen space operations are provided herein. A point occlusion operator, performed in a deferred pass upon a simple point splat, is used to determine point visibility and an ambient occlusion factor to estimate a solid angle of a visibility cone produced by each point in the splat by splitting the screen space local neighborhood of the point into sectors and accumulating the maximum viable sector angle. Points are valid or invalid. A density estimation pass is then used. Maps are used to determine the required number of region growing iterations to cover every invalid pixel. The density is then pruned by edge creep reduction to minimize the error around edges. A median filter is used to fill invalid pixels, while edge-preserving blur is applied to the valid pixels.

Systems and methods for real-time large-scale point cloud surface reconstruction

Methods and systems for converting a point cloud dataset into a hierarchical data structure for a lossless representation of an input file are provided herein. In various embodiments the method comprises recursing subtrees using a preordered traversal for a plurality of nodes, the preordered traversal being checking a parent node and then checking children nodes and stopping the recursing of the subtrees using the preordered traversal of the plurality of nodes when a node of the plurality of nodes is a below threshold node. The below threshold node being less than a configuration specified maximum number of data points, the below threshold node being a leaf of a tileset. Further comprising, aggregating the leaf of the tileset into a lossless representation of the collection of input files.

Systems and methods for converting massive point cloud datasets to a hierarchical storage format

Systems and methods for three dimensional modeling using skipping heuristics and fusing are disclosed herein. An example method includes obtaining a plurality of three dimensional models of a target, each of the models having a unique resolution level, assembling an aggregate three dimensional model using a hierarchical tree representation of the plurality of three dimensional models by skipping levels of detail in the hierarchical tree and rendering the levels of the hierarchical tree that were not skipped. Fusing overlapping sections of the aggregate model can be accomplished using bivariate visibility testing.

Systems and methods for 3D modeling using skipping heuristics and fusing

Methods, systems, and devices for the visualization of the region of a 3-dimensional space obstructed from a viewing location by an ellipsoid are disclosed. In an embodiment, the obstructed region may be defined from primitive elements which are combined using Boolean operations. The primitive elements chosen may be represented using both implicit functions and/or parametric surfaces. In an embodiment, the implicit function representation may be used to quickly determine points on candidate surfaces which may be obstructed from view. In an embodiment, the parametric representation may be used to provide ray-surface intersection solutions enabling visualization of the boundary surface of the obstruction region.

Visualization of field of view obstruction by an ellipsoid

A device and method for displaying data simultaneously in two-dimensional and three-dimensional formats. A user selects data to be represented in multiple formats simultaneously. A data rendition server retrieves the data and determines the three-dimensional representations that are possible. The user then selects the three-dimensional representation desired, and the server renders the data to the user in both two-dimensional and three-dimensional formats. The data may be rendered together with static data such as digital terrain data and other static data types. Data representations may be rotated and morphed as desired by the user.

System and method for data rendering and transformation images in 2- and 3- dimensional images

A system, program storage device, and method of optimizing data placement on a storage device, the method comprising establishing a specified time constraint for which the storage device is to delete data stored thereon; dividing a data object into a plurality of data bits; programming a block of data and the data bits with a logic operand if the storage device is incapable of deleting the data within the specified time constraint; creating an encoded block of data from the programmed block of data and the data bits; organizing the encoded block of data and the data bits in the storage device according to data deletion requirements; and removing the data bits from the storage device if the data bits are organized within a specified data deletion requirement, wherein the data bits are removed using a data shredding process, and wherein the logic operand comprises an exclusive-or (XOR) operator.

Growing community of inventors

Drexel Hill, PA, United States of America

Patrick Cozzi