Microsoft Technology Licensing, LLC

Daniel Ryan Lehenbauer

Greg D Schechter

Adam M Smith

Shanku Shivabrata Niyogi

Daniel Wood

Alexander Stevenson

Jian Yuan

Paul J Kwiatkowski

David J Kurlander

Matthew E Gibbs

Taylor S Williams

Jeffrey Thomas Chrisope

Jessica Lynn Fosler

Regis L F Brid

J Jordan C Parker

Noah David Encke

Yann Achard

Systems and methods for automatically resolving incompatible changes made by different users to collaborative content by capturing changes in the form of command records, where the command records store user changes as context associated with a user command and related content such as a recursive record of the commands called by each command, anchors, creation descriptors, invariant parameters, observations, and constraints. Using the stored command records, systems and methods described herein are able to 'rebase' the changes to create a resolved content state even in situations where one user may delete content and another user may later add/edit that otherwise deleted content. The system provides efficient and automatic resolution of incompatible edits based on the context from the command records underlying the user's intent when creating the command. Ultimately, the system increases user productivity by coordinating content creation within the collaborative content automatically.

Capturing edit semantics to improve merge outcomes

Systems and methods are directed to a compression scheme for stable universally unique identities in a collaborative editing environment. A client receives edits to a document and immediately creates a local short identity for an element of each edit, whereby the local short identity represents an offset from a base unique identity associated with the client from which a unique identifier assigned to the element is derivable. The local short identity information including the local short identity for each element is transmitted to a server. Subsequently, global short identity information is received from the server from which one or more global short identities that each map to a local short identity of a client of a plurality of clients collaborating on the document can be determined by the client. Each global short identity is a compact identity that is universally unique to the plurality of clients including the client.

Compression scheme for stable universal unique identities

A computing system translates two-dimensional (2D) graphical input by a user who is selecting one or more 2D images in a three-dimensional (3D) scene of 3D models created by model 3D objects. The computing system comprises a viewport module, a retrieve module, set ray module and, a hit detection module. The viewport module defines 2D boundaries of the 3D scene and a view point location in 3D space for viewing the 3D scene. The retrieve module retrievies a selection point location in 2D space for the 2D graphical input. The set ray module sets a pick ray in 3D space based on the view point location and the selection point location. The hit detection module detects a hit by the pick ray on a 3D model in the 3D scene. In this computing system there is a method of processing a hierarchy of computer program visual objects for detecting a hit by 2D input on 2D and 3D images displayed by a computing system. The method begins by traversing branches of a first tree hierarchy of visual objects to leaf objects. Next the method detects whether the next unprocessed leaf object is a visual 2D object with 2D geometry or a model 3D object with 3D geometry. Lastly the method calls a 2D process to detect a hit on the 2D geometry of a visual object if a visual 2D object is detected and calls the 3D process to detect a hit on the 3D geometry of a visual object if a model 3D object is detected.

Translating two-dimensional user input on three-dimensional scene

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.

Realistic transformation of 3D lighting models

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.

Automatically generating appropriate near and far clipping planes for a 3D scene while guaranteeing minimum of Z-buffer precision

Space is allocated within a table layout for a plurality of items to be placed therein by application of a first rule in which each item is ordered according to increasing column span for the item. Thereafter, a second rule is applied for each ordered item. The second rule recognizes that space need not necessarily be added to the right-most column for an item at issue, and that space needed for the right-most column for an item at issue should be 'borrowed' from the next column to the right, presuming such space is available and would not impinge on any other item. Finally, the second rule recognizes that despite everything, situations can arise where there is no elegant way to allocate space for all items within a table layout. In such a circumstance, space is added to the right-most column for the item at issue.

Method for optimizing space allocation in table layout

An API is provided for positioning items in a table. The API allows a number of columns or a number of rows, or both, to be specified for a table. Any items to be placed in the table may be identified for the API. Items may be 'moveable,' or not associated with fixed positions in the table. The moveable items may be placed adjacently in the table to fill a first row. New rows or columns may be generated to accommodate additional items. Items may also be 'fixed,' or associated with fixed positions in the table. Moveable items may fill in around the fixed items. A novel algorithm is provided to efficiently place both moveable and fixed items in a table. An on-demand reservation grid may be used in conjunction with the algorithm, thereby accommodating items that span multiple columns and/or rows.

Systems and methods for efficiently generating table layouts using moveable items

A server-based application includes at least one page file that identifies one or more server objects. The page file describes the particular layout and interaction of the server objects, such as controls, in such a way that a page of information may be transmitted to a target device. When designing the page file a developer may use declarative statement, so that certain properties of the specified controls may be altered based on the particular type of target device.

Inserting devices specific content

The present invention is directed towards providing a system and method for optimizing HTML output in a just-in-time compiling environment for devices such as mobile devices. A method is provided for optimizing the output in a single pass as device content is rendered. The method delays writing a closing tag until it is determined that a formatting or layout of the next control conflicts. Tags are emitted in a predefined order to minimize the number of tags that will need to be closed to accommodate a following control whose style differs. Object hierarchy is leveraged to predict the order in which tags should be written without looking ahead of the current control in the hierarchy.

Growing community of inventors

Redmond, WA, United States of America

Daniel Ryan Lehenbauer