Microsoft Technology Licensing, LLC

Intentional Software Corporation

Paul J Kwiatkowski

Charles Simonyi

Shawn A Van Ness

Taylor S Williams

Jeremy M Price

Paul Alexander Gusmorino, Iii

Nicolas J Brun

Michael Nelte

Andras Nagy

Arpit S Shah

Jan-Kristian Markiewicz

Orry Wijanarko Soegiono

Gerrit H Hofmeester

Martyn S Lovell

Ross Nathaniel Luengen

Robert Disano

Rebecca J Deutsch

Holger Kuehnle

Nicholas Randall Waggoner

Theresa B Pittappilly

Travis Paul Dorschel

Nicholas J Wilson

William D Carr

Joshua M Smithrud

Craig A Macomber

Simon J Schaffer

Daniel Ryan Lehenbauer

David Richter

David S Waggoner

Christine M Johnson

Michael Tang

Nikhil Dang

Melanie A Jensenworth

Alexander K Horton

Robert J Jarrett

Benjamin C Constable

Muthukrishnan Paramasivam

William Emeric Aitken

Gary Scot Henderson

Sankhyayan Debnath

Billie Sue Chafins

Paul Stephen Gildea

Steve Eisner

Jay Turney

Brian Dickens

Ioannis Samaragdakis

M Paramasivam

Noah David Encke

Marcel Lugosan

Yann Achard

Pontus E Andersson

James Robert Olyha

Shane J Clifford

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

Semantic zoom techniques are described. In one or more implementations, techniques are described that may be utilized by a user to navigate to content of interest. These techniques may also include a variety of different features, such as to support semantic swaps and zooming 'in' and “out.” These techniques may also include a variety of different input features, such as to support gestures, cursor-control device, and keyboard inputs. A variety of other features are also supported as further described in the detailed description and figures.

Semantic zoom animations

Semantic zoom techniques are described. In one or more implementations, techniques are described that may be utilized by a user to navigate to content of interest. These techniques may also include a variety of different features, such as to support semantic swaps and zooming 'in' and 'out.' These techniques may also include a variety of different input features, such as to support gestures, cursor-control device, and keyboard inputs. A variety of other features are also supported as further described in the detailed description and figures.

Techniques are presented for enhanced erasing of digital ink. The ink erasing feature of a content creation application can preserve the complex shapes that can result from partial erasure of ink strokes. The ink erasing feature can receive ink stroke data from an ink stroke and display the ink stroke. The ink erasing feature can then receive and display an eraser stroke that contacts the ink stroke. Once the eraser stroke is received, the ink erasing feature can determine whether any eraser segment of the eraser stroke contacts the ink stroke. If an eraser segment does not contact the ink stroke, the ink erasing feature discards the eraser segment. If an eraser segment does contact the ink stroke, the ink erasing feature can update the ink stroke data based on amount of overlap and location of contact between the eraser stroke and the ink stroke.

Enhanced digital ink erasing

A system and method for combining text editing and tree encoding for computer programs and related software. Source code for programs and the like are stored using a maintaining a structured tree representation comprising a plurality of nodes, including nodes associated with respective identifiers, operands, operators, variables, and flow control elements in the source code, and nodes associated with formatting aspects of a text-based representation of the source code. During program editing, a continuous loop of operations is performed to support interactive editing of the source code, including unparsing the structured tree representation to derive tokens, processing the tokens to generate an editable text-based representation of the source code, detecting edits to the source code via the text-based representation, and in response thereto generating one or more new tokens and/or deleting one or more existing tokens, parsing the tokens, and processing the parsed tokens to update the structure tree representation of the source code to reflect the edited source code.

System and method for combining text editing and tree encoding for computer programs

A layout engine generates a visual layout tree for a visual description tree of a document whose content is to be rendered in one or more display areas. A visual description tree describes the content of a document along with formatting and logical arrangement the content. Visual description nodes of a visual description tree represent the organization of the constituent elements a document hierarchically. A visual layout tree defines the layout of a document within one or more display areas. Visual layout nodes of a visual layout tree represent the layout of the content of a document hierarchically. The layout engine receives as input a visual description tree and generates the corresponding visual layout tree. A rendering engine then inputs the visual layout tree and generates a graphics buffer containing the pixels representing the layout of the document as defined by the visual layout tree.

Detecting and animating a change in position of a visual layout node of a visual layout tree

Linking visual layout nodes of a visual layout tree using positioning pointers

Generating a visual layout tree using caching techniques

Layout engine for creating a visual layout tree for a document

Generating a visual description tree based on a layout interruption record

Techniques and systems for applying an ink effect to the drawing of an ink stroke can include absolute age for a digital ink stroke. A digital ink system can identify a reference time from which to represent a current time. The system can generate an absolute age of each ink point of the ink stroke based on the reference time. Then the ink effect can be applied to the ink stroke with a rhythm derived from when the ink stroke was originally drawn by using the absolute age of each ink point. In some cases, the rhythm can be the same rhythm as when the ink stroke was originally drawn. In other cases, the rhythm can be modified based on the rhythm the ink stroke was originally drawn. For example, the original rhythm may be accelerating, decelerating, skewed, compressed, affine, or non-affine.

Absolute age for a digital ink stroke

Techniques and systems for managing visual layouts of ink strokes are described. In particular, an ink space coordinate system for a digital ink stroke is provided. A digital ink system can receive ink stroke data of an ink stroke. The system can define an ink space coordinate system along the ink stroke. Defining the ink space coordinate system can include assigning a reference line of the ink stroke and an origin point on the reference line, as well as creating ink space coordinates. Creating the ink space coordinates can include defining ink space x-coordinate values representing a distance along the reference line relative to the origin point and defining ink space y-coordinate values representing a distance along an axis perpendicular to the reference line of the ink stroke. Then the system can perform a warping to create curvature in the ink space coordinate system.

Ink space coordinate system for a digital ink stroke

Growing community of inventors

Redmond, WA, United States of America

Paul J Kwiatkowski