Arranging graphic objects on a page

• US 8,291,314 B2
• Filed: 10/27/2009
• Issued: 10/16/2012
• Est. Priority Date: 04/23/2009
• Status: Expired due to Fees

• Current Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Original Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Inventors: Atkins, Clayton Brian
• Primary Examiner(s): Nguyen, Maikhanh
• Application Number:
  US12/606,922
• Publication Number:
  US 20100269037A1
• Time in Patent Office: 1,085 Days
• Field of Search: 715200-205, 715207-210, 715226-229, 715231-234, 715/237, 715/238, 715/243, 715/244, 715/248, 715/255, 715/256, 715/273, 715/760, 715/762, 715/763, 715/246, 715/700, 715/713, 715/781, 715/782, 715/848, 715/852, 715/853
• US Class Current: 715/244
• CPC Class Codes: G09G 2320/02 Improving the quality of display appearance
• CPC Class Codes: G09G 2340/12 Overlay of images, i.e. displayed pixel being the result of switching between the corresponding input pixels
• CPC Class Codes: G09G 5/14 Display of multiple viewports

Abstract

A method performed by a physical computing system for arranging a plurality of graphic objects on a page includes receiving the plurality of graphic objects in the physical computing system, the plurality of graphic objects including a number of variable graphic objects and a number of fixed graphic objects. The method further includes, for each of the fixed graphic objects, creating a number of discrete dimension sets, generating a number of binary trees, each of the binary trees representing a unique layout for the plurality of graphic objects in which each of the fixed graphic object exhibits one of the discrete dimension sets, assigning a score to each of the binary trees, and arranging the graphic objects according to the layout represented by a binary tree selected from the number of generated binary trees based on the score.

Claims

1. A method performed by a physical computing system for arranging a plurality of graphic objects on a page, the method comprising:

receiving said plurality of graphic objects in said physical computing system, said plurality of graphic objects comprising a number of variable graphic objects and a number of fixed graphic objects;

for each of said fixed graphic objects, creating a number of discrete dimension sets, said fixed graphic objects being treated as having variable dimensions during creation of said discrete dimension sets;

generating a number of binary trees, each of said binary trees representing a unique layout for said plurality of graphic objects in which each of said fixed graphic object exhibits one of said discrete dimension sets;

assigning a score to each of said binary trees; and

arranging said graphic objects according to said layout represented by a binary tree selected from said number of generated binary trees based on said score;

wherein the assigning a score to each said binary tree comprises;

assigning an initial height and an initial width to each graphic object in said binary tree, said fixed graphic objects being treated as having variable dimensions during said assignment of said initial height and said initial width;

adjusting the height and width of each graphic object such that the height and width of said fixed graphic objects match their specified dimensions; and

computing a numerical score for said binary tree based on the adjusted areas of the graphic objects.

2. The method of claim 1, in which assigning a score to each said binary tree comprises:

assigning an initial height and an initial width to each graphic object in said binary tree, said fixed graphic objects being treated as having variable dimensions during said assignment of said initial height and said initial width;

selecting a final dimension set for each fixed graphic object;

determining a principal bounding box for said graphic objects represented by said binary tree with said graphic layout system;

creating a first system of linear equations for determining a height for each variable graphic object represented by said binary tree, said system of linear equations taking into account said final heights for said fixed graphic objects;

creating a second system of linear equations for determining a width for each variable graphic object represented by said binary tree, said system of linear equations taking into account said final widths for said fixed graphic objects;

solving said first system of linear equations and said second system of linear equations to determine a final height and a final width for each of said variable graphic objects in said layout represented by said binary tree; and

computing said score based on said final height and said final width of said graphic objects in said layout represented by said binary tree.

3. The method of claim 2, in which said determining said principal bounding box comprises:

determining a first dimension set of a first box, said first box containing each of said graphic objects represented by said binary tree, each graphic object having said initial height and said initial width;

determining a second dimension set of a second box, said second box containing only said fixed graphic objects each having said initial height and said initial width;

determining a third dimension set of a third box, said third box containing said fixed graphic objects each having said final height and said final width; and

computing a target dimension by adding a difference of said third dimension set and said second dimension set to said first dimension set.

4. The method of claim 2, in which each of said final height and said final width falls within a predefined range.

5. The method of claim 2, in which assigning said initial height and said initial width comprises accounting in said initial height and said initial width for at least one of:

a border around one of said graphic objects and a minimum spacing between said graphic objects.

6. The method of claim 2, further comprising:

creating a table of fixed distances, variable distances, and spacing distances for each terminal node of each said binary tree;

determining a total length for fixed distances, variable distances, and spacing distances for each interior node of each said binary tree, said total length representing a path traversing said page through said interior node;

in which each said total length and data from each said table are used to formulate at least one of said systems of linear equations; and

in which each said path is selected such that said one of said systems of linear equations will be solvable.

7. The method of claim 1, in which said score assigned to each said binary tree is based on a comparison between graphic object areas in said layout represented by said binary tree and at least one criterion selected from the group of:

a user preference, an amount of unused space in said layout represented by said binary tree, and a photo area balance in said layout represented by said binary tree.

8. A computing system comprising:

a processor; and

a computer memory having graphic layout software stored thereon;

in which, said graphic layout software is configured to cause said processor to, upon execution of said graphic layout software;

receive said plurality of graphic objects, said plurality of graphic objects comprising a number of variable graphic objects and a number of fixed graphic objects;

for each of said fixed graphic objects, create a number of discrete dimension sets, said fixed graphic objects being treated as having variable dimensions during creation of said discrete dimension sets;

generate a number of binary trees, each of said binary trees representing a unique layout for said plurality of graphic objects in which each of said fixed graphic object exhibits one of said discrete dimension sets;

assign a score to each of said binary trees; and

arrange said graphic objects according to said layout represented by a binary tree selected from said number of generated binary trees based on said score;

wherein assigning a score to each said binary tree comprises;

assigning an initial height and an initial width to each graphic object in said binary tree, said fixed graphic objects being treated as having variable dimensions during said assignment of said initial height and said initial width;

adjusting the height and width of each graphic object such that the height and width of said fixed graphic objects match their specified dimensions; and

computing a numerical score for said binary tree based on the adjusted areas of the graphic objects.

9. The computing system of claim 8, in which to assign said score to each said binary tree, said processor is further configured to:

assign an initial height and an initial width to each graphic object in said binary tree, said fixed graphic objects being treated as having variable dimensions during said assignment of said initial height and said initial width;

select a final dimension set for each fixed graphic object;

determine a principal bounding box for said graphic objects represented by said binary tree with said graphic layout system;

create a first system of linear equations for determining a height for each variable graphic object represented by said binary tree in which said final height for each said fixed graphic object is used;

create a second system of linear equations for determining a width of each variable graphic object represented by said binary tree in which said final width for each said fixed graphic object is used;

solve said first system of linear equations and said second system of linear equations to determine a final height and a final width for each of said graphic objects in said layout represented by said binary tree; and

compute said score based on said final height and said final width of said graphic objects in said layout represented by said binary tree.

10. The computing system of claim 9, in which to determine said principal bounding box, said processor is further configured to:

determine a first dimension set of a first box, said first box containing each of said graphic objects represented by said binary tree, each graphic object having said initial height and said initial width;

determine a second dimension set of a second box, said second box containing only said fixed graphic objects each having said initial height and said initial width;

determine a third dimension set of a third box, said third box containing said fixed graphic objects each having said final height and said final width; and

compute a target dimension by adding a difference of said third dimension set and said second dimension set to said first dimension set.

11. The computing system of claim 9, in which each of said final height and said final width falls within a predefined range.

12. The computing system of claim 9, in which said processor is further configured to account in said initial height and said initial width for at least one of:

a border around one of said graphic objects and a minimum spacing between said graphic objects.

13. The computing system of claim 9, in which said processor is further configured to:

create a table of fixed distances, variable distances, and spacing distances for each terminal node of each said binary tree; and

determine a total length for fixed distances, variable distances, and spacing distances for each interior node of each said binary tree, said total length representing a path traversing said page through said interior node;

in which each said total length and data from each said table are used to formulate at least one of said systems of linear equations; and

in which each said path is selected such that said at least one of said systems of linear equations will be solvable.

14. The computing system of claim 8, in which said score assigned to each said binary tree is based on a comparison between object areas in said layout represented by said binary tree and at least one criterion selected from the group of:

a user preference, an amount of unused space in said layout represented by said binary tree, and photo area balance.

15. A method performed by a physical computing system for arranging a plurality of graphic objects on a page, the method comprising:

receiving said plurality of graphic objects as a selection made by a user of said physical computing system, said plurality of graphic objects comprising a number of variable graphic objects and a number of fixed graphic objects;

for each of said fixed graphic objects, creating a number of discrete dimension sets, said fixed graphic objects being treated as having variable dimensions during creation of said discrete dimension sets;

generating a number of binary trees, each of said binary trees representing a unique layout for said plurality of graphic objects in which each of said fixed graphic object exhibits one of said discrete dimension sets;

assigning a score to each of said binary trees;

arranging said graphic objects according to said layout represented by a binary tree selected from said number of generated binary trees based on said score; and

displaying an arrangement of said graphic objects based on said selected binary tree to at least said user;

wherein the assigning a score to each said binary tree comprises;

assigning an initial height and an initial width to each graphic object in said binary tree, said fixed graphic objects being treated as having variable dimensions during said assignment of said initial height and said initial width;

adjusting the height and width of each graphic object such that the height and width of said fixed graphic objects match their specified dimensions; and

computing a numerical score for said binary tree based on the adjusted areas of the graphic objects.

16. The method of claim 15, in which assigning a score to each said binary tree comprises:

assigning an initial height and an initial width to each graphic object in said binary tree using said discrete dimension sets for said fixed graphic objects;

selecting a final dimension set for each fixed graphic object;

determining a principal bounding box for said graphic objects represented by said binary tree with said graphic layout system;

creating a first system of linear equations for determining a height for each variable graphic object represented by said binary tree, said system of linear equations taking into account said final heights for said fixed graphic objects;

creating a second system of linear equations for determining a width for each variable graphic object represented by said binary tree, said system of linear equations taking into account said final widths for said fixed graphic objects;

solving said first system of linear equations and said second system of linear equations to determine a final height and a final width for each of said variable graphic objects in said layout represented by said binary tree; and

computing said score based on said final height and said final width of said graphic objects in said layout represented by said binary tree.

17. The method of claim 16, in which said determining said principal bounding box comprises:

determining a first dimension set of a first box, said first box containing each of said graphic objects represented by said binary tree, each graphic object having said initial height and said initial width;

determining a second dimension set of a second box, said second box containing only said fixed graphic objects each having said initial height and said initial width;

determining a third dimension set of a third box, said third box containing said fixed graphic objects each having said final height and said final width; and

computing a target dimension by adding a difference of said third dimension set and said second dimension set to said first dimension set.

18. The method of claim 16, in which each of said final height and said final width falls within a predefined range.

19. The method of claim 16, in which assigning said initial height and said initial width comprises accounting in said initial height and said initial width for at least one of:

a border around one of said graphic objects and a minimum spacing between said graphic objects.

20. The method of claim 16, further comprising:

creating a table of fixed distances, variable distances, and spacing distances for each terminal node of each said binary tree;

determining a total length for fixed distances, variable distances, and spacing distances for each interior node of each said binary tree, said total length representing a path traversing said page through said interior node;

in which each said total length and data from each said table are used to formulate at least one of said systems of linear equations; and

in which each said path is selected such that said one of said systems of linear equations will be solvable.