Abstract: The present disclosure relates to navigating around geographic maps within a map viewport display. More specifically, the present disclosure relates to navigating around a surface of a 3D, geographic coordinate system, representation of a globe using a pan feature while North is locked. In response to a user activating a pan feature of a navigation interface, a spin angle and, or a swing angle is calculated and the globe is revolved around a spin-axis and, or a swing-axis while revolution around a rotate-axis is locked.

Abstract: The present disclosure relates to navigating around geographic maps within a map viewport display. More specifically, the present disclosure relates to navigating around a surface of a 3D, geographic coordinate system, representation of a globe using a pan feature while North is locked. In response to a user activating a pan feature of a navigation interface, a spin angle and, or a swing angle is calculated and the globe is revolved around a spin-axis and, or a swing-axis while revolution around a rotate-axis is locked.

Abstract: The present disclosure relates to navigating around geographic maps within a map viewport display. More specifically, the present disclosure relates to navigating around a surface of a 3D, geographic coordinate system representation of a body using a pan feature while North is locked. In response to a user activating a pan feature of a navigation interface, a spin angle and, or a swing angle is calculated and the globe is revolved around a spin-axis and/or a swing-axis while revolution around a rotate-axis is locked.

Abstract: The present disclosure relates to navigating around geographic maps within a map viewport display. More specifically, the present disclosure relates to navigating around a surface of a 3D, geographic coordinate system representation of a body using a pan feature while North is locked. In response to a user activating a pan feature of a navigation interface, a spin angle and, or a swing angle is calculated and the globe is revolved around a spin-axis and/or a swing-axis while revolution around a rotate-axis is locked.

Abstract: When rendering a three-dimensional (3D) image, a render list is generated. The render list is sorted according to proximity to a notional camera, where each element of the render list specifies geometry and texture of a portion of the 3D image, and where at least two elements of the render list correspond to different levels of detail (LODs). The render list is then traversed twice: in the first instance, the render list is traversed to render each element in the render list to a respective texture, which includes applying a depth management technique to account for occlusion; in the second instance, the render list is traversed in a back-to-front order to render each of the textures to a display buffer to generate the 3D image, which includes applying an image space manipulation technique to at least some of the textures.

Abstract: A computer-animated scene is shaded by a computing system having an in-core memory and coupled to one or more out-of-core storage devices. The scene is comprised of shading locations on a surface element of an object in the scene. A point cloud representation of the scene is generated. An octree data structure based on the point cloud representation of the scene is generated. To generate the octree data structure, the Morton code for each point in the point cloud representation of the scene is computed. The points are then sorted based on the Morton code, recursively subdivided to find at most a threshold number of nodes, and written to the one or more out-of-core storage devices. The shading locations are then shaded based on the nodes written to the out-of-core storage devices.

Abstract: A computer-animated scene is shaded by a computing system having an in-core memory and coupled to one or more out-of-core storage devices. The scene is comprised of shading locations on a surface element of an object in the scene. A point cloud representation of the scene is generated. An octree data structure based on the point cloud representation of the scene is generated. To generate the octree data structure, the Morton code for each point in the point cloud representation of the scene is computed. The points are then sorted based on the Morton code, recursively subdivided to find at most a threshold number of nodes, and written to the one or more out-of-core storage devices. The shading locations are then shaded based on the nodes written to the out-of-core storage devices.