Abstract: A system that implements a data storage service may store data for database tables in multiple replicated partitions on respective storage nodes. In response to a request to restore a given table that was backed up in a remote storage system (e.g., key-value durable storage system), the service may create a new table, and may import a copy of each of the partitions of the given table from the remote storage system into the new table. The request to restore the table may specify a modified value for a configuration parameter for the table or for one of its partitions. The service may apply the new configuration parameter value to the table or its partitions during the restore operation. The new configuration parameter value may indicate an increase or decrease in storage capacity or throughput capacity, and its application may automatically trigger a partition split or move operation.

Abstract: A technology is described for operating a device shadowing service that manages commands associated with groups of device representations. An example method may include receiving a group command associated with a group of device representations managed by a device shadowing service. Device representations included in the group of device representations represent physical devices that connect to the device shadowing service over one or more computer networks. In response to the group command, the device representations included in the group of device representations may be identified and an instruction to perform an action indicated by the group command may be sent to the physical devices represented by the device representations. Thereafter, indications may be received that at least a portion of the physical devices performed the action.

Abstract: A system that implements a data storage service may store data for database tables in multiple replicated partitions on respective storage nodes. In response to a request to back up a table, the service may export individual partitions of the table from the database and package them to be independently uploaded (e.g., in parallel) to a remote storage system (e.g., a key-value durable storage system). Prior to uploading the exported and packaged partitions to the remote storage system, the service may verify that the exported and packaged partitions can be subsequently restored, which may include unpackaging and/or re-inflating the exported and packaged partitions to create additional unpackaged copies of the partitions, re-importing the additional unpackaged copies of the partitions into the database (e.g., as additional replicas), and/or comparing checksums generated for the exported partitions with checksums generated for the additional unpackaged copies of the partitions.

Abstract: A system that implements a data storage service may store data for a database table in multiple replicated partitions on respective storage nodes. In response to a request to back up a table, the service may back up individual partitions of the table to a remote storage system independently and (in some cases) in parallel, and may update (or create) and store metadata about the table and its partitions on storage nodes of the data storage service and/or in the remote storage system. Backing up each partition may include exporting it from the database in which the table is stored, packaging and compressing the exported partition for upload, and uploading the exported, packaged, and compressed partition to the remote storage system. The remote storage system may be a key-value durable storage system in which each backed-up partition is accessible using its partition identifier as the key.

Abstract: A system that implements a data storage service may store data for database tables in multiple replicated partitions on respective storage nodes. In response to a request to back up a table, the service may export individual partitions of the table from the database and package them to be independently uploaded (e.g., in parallel) to a remote storage system (e.g., a key-value durable storage system). Prior to uploading the exported and packaged partitions to the remote storage system, the service may verify that the exported and packaged partitions can be subsequently restored, which may include unpackaging and/or re-inflating the exported and packaged partitions to create additional unpackaged copies of the partitions, re-importing the additional unpackaged copies of the partitions into the database (e.g., as additional replicas), and/or comparing checksums generated for the exported partitions with checksums generated for the additional unpackaged copies of the partitions.

Abstract: A system that implements a data storage service may store data for a database table in multiple replicated partitions on respective storage nodes. In response to a request to back up a table, the service may back up individual partitions of the table to a remote storage system independently and (in some cases) in parallel, and may update (or create) and store metadata about the table and its partitions on storage nodes of the data storage service and/or in the remote storage system. Backing up each partition may include exporting it from the database in which the table is stored, packaging and compressing the exported partition for upload, and uploading the exported, packaged, and compressed partition to the remote storage system. The remote storage system may be a key-value durable storage system in which each backed-up partition is accessible using its partition identifier as the key.

Abstract: A website (“Teratrees”) is described where a person can upload pictures of trees or shrubs which they have recently planted and have them displayed in their personal profile. Validation of the tree is obtained by a voucher code that is entered into the website. Once the tree has been uploaded to the website it appears in the ‘Planted Trees’ section and can be offered to the Market at a price set by the planter. Another user can then purchase (using a virtual currency with real financial value) this tree from the Market and own it—whereupon it appears in their profile under ‘Owned Trees’. This is virtual ownership within the context of the website. The user who owns this tree can offer the tree again on the Market if desired, while further transactions are also possible. Users who plant and own trees are rewarded with points and ranking.

Abstract: Methods and computer-readable media for displaying two-dimensional objects on a display device are disclosed. Rendering requests are received from an application to render two-dimensionally modeled graphics to a display device. Primitive geometries of drawing calls of the rendering requests are tessellated into sequences of triangles. The vertices of the triangles are mapped to a vertex buffer along with an index to identify associated constant data. Batching operations store and communicate calls and mapped data to a graphics processing unit by way of a three-dimensional rendering application program interface. Constant data associated with the mapped data are indexed and appended together in a constant buffer, thereby allowing drawing calls to be coalesced. A staging buffer and a staging texture are provided for batching text anti-aliasing operations. Shader fragments are precompiled and organized by way of a predetermined lookup table.

Abstract: Methods and computer-readable media for displaying two-dimensional objects on a display device are disclosed. Rendering requests are received from an application to render two-dimensionally modeled graphics to a display device. Primitive geometries of drawing calls of the rendering requests are tessellated into sequences of triangles. The vertices of the triangles are mapped to a vertex buffer along with an index to identify associated constant data. Batching operations store and communicate calls and mapped data to a graphics processing unit by way of a three-dimensional rendering application program interface. Constant data associated with the mapped data are indexed and appended together in a constant buffer, thereby allowing drawing calls to be coalesced. A staging buffer and a staging texture are provided for batching text anti-aliasing operations. Shader fragments are precompiled and organized by way of a predetermined lookup table.

Abstract: A lighting model specified in light space may be transformed to a 3D scene, which may include numerous lights. When the lighting model is transformed to the 3D scene and is uniformly scaled or near-uniformly scaled, intensity or brightness of light at sample points, corresponding to points in the 3D scene, may be adjusted proportionately for a light source using a value based, at least partly, on a transform matrix. When the lighting model in the light space is scaled to non-uniformly stretch a lit area, the sample points may be transformed to the light space, using an inverse of a transform matrix. Distances from the light source to the transformed sample points in the light space may be used to determine attenuation and range with respect to the light source.

Abstract: Methods and computer-readable media for displaying two-dimensional objects on a display device are disclosed. Rendering requests are received from an application to render two-dimensionally modeled graphics to a display device. Primitive geometries of drawing calls of the rendering requests are tessellated into sequences of triangles. The vertices of the triangles are mapped to a vertex buffer along with an index to identify associated constant data. Batching operations store and communicate calls and mapped data to a graphics processing unit by way of a three-dimensional rendering application program interface. Constant data associated with the mapped data are indexed and appended together in a constant buffer, thereby allowing drawing calls to be coalesced. A staging buffer and a staging texture are provided for batching text anti-aliasing operations. Shader fragments are precompiled and organized by way of a predetermined lookup table.

Abstract: An anti-aliasing mechanism. In one aspect, one or more opacities are determined to apply to layers used to render an image. An order in which to render the layers is also determined. This order may correspond to an order in which points within the image are sampled. The first layer to render is set to an opacity that applies to it and rendered. The second layer to render is set at an opacity that applies to it and rendered on top of the first layer. In rendering the second layer, the opacities of the first and second layers are blended.

Abstract: Various technologies and techniques are disclosed that improve the automatic generation of near and far clipping planes for a 3D scene. The viewing frustum is intersected with the scene to determine the range of depth that a particular scene occupies in the viewing frustum. The ratio of the near clipping plane to far clipping plane is adjusted as appropriate to ensure a desired minimum level of Z-buffer precision is achieved. The clipping planes are set sufficiently far outside of the object bounds to prevent triangles which are parallel to the clip planes from being accidentally clipped. An API is provided to allow other programs to retrieve the near and far clipping plane values with the desired minimum Z-buffer precision for a particular scene without having to interact with the Z-buffer.

Abstract: A lighting model specified in light space may be transformed to a 3D scene, which may include numerous lights. When the lighting model is transformed to the 3D scene and is uniformly scaled or near-uniformly scaled, intensity or brightness of light at sample points, corresponding to points in the 3D scene, may be adjusted proportionately for a light source using a value based, at least partly, on a transform matrix. When the lighting model in the light space is scaled to non-uniformly stretch a lit area, the sample points may be transformed to the light space, using an inverse of a transform matrix. Distances from the light source to the transformed sample points in the light space may be used to determine attenuation and range with respect to the light source.

Abstract: Various technologies and techniques are disclosed that improve the automatic generation of near and far clipping planes for a 3D scene. The viewing frustum is intersected with the scene to determine the range of depth that a particular scene occupies in the viewing frustum. The ratio of the near clipping plane to far clipping plane is adjusted as appropriate to ensure a desired minimum level of Z-buffer precision is achieved. The clipping planes are set sufficiently far outside of the object bounds to prevent triangles which are parallel to the clip planes from being accidentally clipped. An API is provided to allow other programs to retrieve the near and far clipping plane values with the desired minimum Z-buffer precision for a particular scene without having to interact with the Z-buffer.

Abstract: Various technologies and techniques are disclosed that improve the process of working with 3D rotations. Rotations are treated as a separate abstract entity from general transforms. By having rotations separate from general transforms, the user can perform the various operations on any “rotation” regardless of its encoding. An abstract 3D transform class is provided that represents a transform that can be applied to 3D a mesh or scene node, and an abstract 3D rotation class is provided which is exposed separately from other general transforms. A concrete implementation of the 3D transform class uses a 3D rotation class to apply a rotation to a 3D mesh or scene node. One or more concrete implementations of the 3D rotation class are provided which represent a separate rotation encoding.

Abstract: An anti-aliasing mechanism. In one aspect, one or more opacities are determined to apply to layers used to render an image. An order in which to render the layers is also determined. This order may correspond to an order in which points within the image are sampled. The first layer to render is set to an opacity that applies to it and rendered. The second layer to render is set at an opacity that applies to it and rendered on top of the first layer. In rendering the second layer, the opacities of the first and second layers are blended.

Abstract: A method and system for anti-aliased rasterization of objects. From a particular viewpoint of an object represented by shapes, a shape is selected having an edge on a silhouette of the object. An edge geometry is created at the edge of the shape that is on the silhouette of the object. The edge geometry is rendered. Either the shape is rendered after the edge geometry is rendered with the depth test set so as to not allow portions of the shape to overlap the edge geometry, or the shape itself is modified to remove any portion that overlaps the edge geometry. This may be repeated for each edge of each shape that lies on the silhouette of the object.

Abstract: A method and system measuring the correctness of rendered images. A reference renderer generates a reference image from data describing the image. A tolerance buffer is generated that includes a tolerance for a pixel representing a portion of the reference image. If a renderer renders the pixel outside the tolerance for the pixel, the renderer is deemed to have rendered the pixel incorrectly. If the renderer renders the pixel within the tolerance, the renderer is deemed to have rendered the pixel correctly.