Method, system, and computer-readable medium for creating and laying out a graphic within an application program

• US 9,747,710 B2
• Filed: 06/18/2014
• Issued: 08/29/2017
• Est. Priority Date: 09/30/2004
• Status: Active Grant

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Inventors: Schorr, Janet L., Wells, Stephen T., Kotler, Matthew, Underhill, Thomas C., Sherman, Scott A., Berker, Ilan
• Primary Examiner(s): Sams, Michelle L
• Application Number:
  US14/307,668
• Publication Number:
  US 20140292767A1
• Time in Patent Office: 1,168 Days
• CPC Class Codes: G06F 40/10 Text processing natural language analysis G06F40/20; semantic analysis G06F40/30; processing or translation of natural language G06F40/40
• CPC Class Codes: G06F 40/106 Display of layout of documents; Previewing
• CPC Class Codes: G06F 40/174 Form filling; Merging
• CPC Class Codes: G06T 11/206 Drawing of charts or graphs
• CPC Class Codes: G06T 11/60 Editing figures and text; Combining figures or text

Abstract

A method, apparatus, and computer-readable medium are provided for creating and laying out a graphic within a drawing application program. The method includes receiving a data model defining a set of data and data relationships to be represented in the graphic, receiving a graphic definition describing the mapping of the data from the data model to a set of algorithms, algorithm parameters, constraints, constraint rules, and shape properties, determining a shape size and position for the layout nodes utilizing the set of algorithms, constraints, and constraint rules from the graphic definition, and creating a list of shapes and shape properties for the graphic, including size and position. The method further includes determining if the graphic fits a given layout into a specific area based on the set of constraint values and if the graphic does not fit the specific area, then modifying the set of constraint values using the constraint rules.

Claims

1. A method for creating and laying out a graphic within an application program, comprising:

receiving a data model for constructing the graphic, the data model defining a set of data and data relationships to be represented in the graphic;

receiving a graphic definition, the graphic definition describing the mapping of the data from the data model to layout nodes in a layout tree, wherein each layout node represents one or more shapes in the graphic;

determining shape properties for each shape in the graphic based at least in part on the graphic definition by utilizing one or more algorithms, wherein the one or more algorithms are based at least in part on an ordered set of two or more constraint rules, and wherein the shape properties comprise at least a shape size and a shape position for each shape in the graphic;

automatically modifying the graphic to fit in a layout space of a display by evaluating each constraint rule in succession and modifying a corresponding constraint value of at least one shape property until it is determined that the graphic fits in the layout space;

creating a shape list comprising the one or more shapes and the shape properties based on the one or more algorithms; and

providing the shape list to the application program for rendering the graphic.

2. The method of claim 1, further comprising:

specifying a plurality of external graphic definitions, wherein each of the plurality of external graphic definitions specify information required to generate a specific graphic.

3. The method of claim 1, further comprising:

specifying a plurality of external algorithms, wherein each of the plurality of external algorithms specifies a layout for the one or more shapes to achieve a specific graphic structure, and wherein each of the external algorithms is referenced by an external graphic definition.

4. The method of claim 1, wherein the shape size and the shape position for each shape in the graphic are defined by the one or more algorithms utilizing constraints and constraint rules.

5. The method of claim 4, wherein the constraints comprise one or more numeric constraints for use by the one or more algorithms, and wherein a numeric constraint represents a numeric value.

6. The method of claim 5, wherein at least one numeric constraint is derived by a reference to another constraint.

7. The method of claim 6, wherein a constraint is modified according to a set of constraint rules to size and position a layout node.

8. The method of claim 5, wherein the constraints comprise one or more Boolean constraints, wherein a Boolean constraint represents one of an equality and inequality of values across the one or more shapes, and wherein a numeric value of a numeric constraint is propagated to a shape specified by a Boolean constraint.

9. The method of claim 4, wherein a first layout node communicates constraints to a second layout node to enforce equality between a first shape and a second shape in the graphic.

10. The method of claim 1, wherein the graphic definition is provided in a markup language.

11. The method of claim 10, wherein the markup language is an extensible markup language (XML).

12. A computer system, comprising:

at least one processing unit; and

at least one memory, communicatively coupled to the at least one processing unit and containing computer-readable instructions that, when executed by the at least one processing unit, perform a method for creating and laying out a graphic, the method comprising;

receiving a data model for constructing the graphic, the data model defining a set of data and data relationships to be represented in the graphic;

receiving a graphic definition, the graphic definition describing the mapping of the data from the data model to layout nodes in a layout tree, wherein each layout node represents one or more shapes in the graphic;

determining shape properties for each shape in the graphic based at least in part on the graphic definition by utilizing one or more algorithms, wherein the one or more algorithms are based at least in part on an ordered set of two or more constraint rules, and wherein the shape properties comprise at least a shape size and a shape position for each shape in the graphic;

automatically modifying the graphic to fit in a layout space of a display by evaluating each constraint rule in succession and modifying a corresponding constraint value of at least one shape property until it is determined that the graphic fits in the layout space;

creating a shape list comprising the one or more shapes and the shape properties based on the one or more algorithms; and

providing the shape list to the application program for rendering the graphic.

13. The computer system of claim 12, further comprising:

specifying a plurality of external graphic definitions, wherein each of the plurality of external graphic definitions specify information required to generate a specific graphic.

14. The computer system of claim 12, further comprising:

specifying a plurality of external algorithms, wherein each of the plurality of external algorithms specifies a layout for the one or more shapes to achieve a specific graphic structure, and wherein each of the external algorithms is referenced by an external graphic definition.

15. The computer system of claim 12, wherein the shape size and the shape position for each shape in the graphic are defined by the one or more algorithms utilizing constraints and constraint rules.

16. The computer system of claim 15, wherein the constraints comprise one or more numeric constraints for use by the one or more algorithms, and wherein a numeric constraint represents a numeric value.

17. The computer system of claim 16, wherein at least one numeric constraint is derived by a reference to another constraint.

18. The computer system of claim 17, wherein a constraint is modified according to a set of constraint rules to size and position a layout node.

19. The computer system of claim 15, wherein the constraints comprise one or more Boolean constraints, wherein a Boolean constraint represents one of an equality and an inequality of values across the one or more shapes, and wherein a numeric value of a numeric constraint is propagated to a shape specified by a Boolean constraint.

20. The computer system of claim 15, wherein multiple layout nodes communicate constraint values to each other to enable sizing and positioning of the layout nodes using the constraints.

21. The computer system of claim 12, wherein the graphic definition is provided in a markup language.

22. The computer system of claim 21, wherein the markup language is an extensible markup language (XML).

23. A computer-readable medium having computer-executable instructions stored thereon which, when executed by a computer, will cause the computer to perform a method for creating and laying out a graphic within an application program, the method comprising:

receiving a data model for constructing the graphic, the data model defining a set of data and data relationships to be represented in the graphic;

receiving a graphic definition, the graphic definition describing the mapping of the data from the data model to layout nodes in a layout tree, wherein each layout node represents one or more shapes in the graphic;

determining shape properties for each shape in the graphic based at least in part on the graphic definition by utilizing one or more algorithms, wherein the one or more algorithms are based at least in part on an ordered set of two or more constraint rules, and wherein the shape properties comprise at least a shape size and a shape position for each shape in the graphic;

automatically modifying the graphic to fit in a layout space of a display by evaluating each constraint rule in succession and modifying a corresponding constraint value of at least one shape property until it is determined that the graphic fits in the layout space;

creating a shape list comprising the one or more shapes and the shape properties based on the one or more algorithms; and

providing the shape list to the application program for rendering the graphic.

24. The computer-readable medium of claim 23, further comprising:

specifying a plurality of external graphic definitions, wherein each of the plurality of external graphic definitions specify information required to generate a specific graphic.

25. The computer-readable medium of claim 23, further comprising:

specifying a plurality of external algorithms, wherein each of the plurality of external algorithms specifies a layout for the one or more shapes to achieve a specific graphic structure, and wherein each of the external algorithms is referenced by an external graphic definition.

26. The computer-readable medium of claim 23, wherein the shape size and the shape position for each shape in the graphic are defined by the one or more algorithms utilizing constraints and constraint rules.

27. The computer-readable medium of claim 26, wherein the constraints comprise one or more numeric constraints for use by the one or more algorithms, and wherein a numeric constraint represents a numeric value.