Untangled Euler diagrams
First Claim
1. A graph illustrating a plurality of sets and a plurality of members of said sets, each of said members being a member of at least one of said sets, and at least one of said members being a member of at least two of said sets, said graph comprising:
- a plurality of elements, said elements representing said members and said sets;
a first element being displayed by multiple convex shapes connected by at least one concave connector; and
said members having a label.
1 Assignment
0 Petitions
Accused Products
Abstract
A modified Euler diagram may use multiple convex shapes to display sets or members of sets. In one embodiment, a compact Euler diagram may represent members once, with the sets split into separate regions that may form a containment hierarchy over the members. The split set regions may be drawn with simple convex shapes and joined with connecting lines, which may be concave shapes. In another embodiment, each set may be illustrated with a single convex shape and the members of more than one set may be duplicated. In such an embodiment, the members may be drawn with convex shapes and joined with connectors, which may be concave shapes. The modified Euler diagrams may be deterministically created by grouping the elements into sets, organizing the sets by size, placing elements in the sets, and creating connections between the elements using a set of constraints.
15 Citations
20 Claims
-
1. A graph illustrating a plurality of sets and a plurality of members of said sets, each of said members being a member of at least one of said sets, and at least one of said members being a member of at least two of said sets, said graph comprising:
-
a plurality of elements, said elements representing said members and said sets; a first element being displayed by multiple convex shapes connected by at least one concave connector; and said members having a label. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A method performed on a computer processor, said method comprising:
-
receiving a plurality of members, each of said members being a member of at least one set, at least one of said members being a member of at least two sets; creating a hierarchy of elements by a grouping method comprising; sorting said sets by a number of members in each set, said sets being sorted from largest to smallest; determining a membership list for each of said members, said membership list identifying sets for which said member is a member; organizing said members according to said membership list to create a list of members, said organizing comprising grouping said members; creating a graph by laying out said elements according to said hierarchy by a layout method comprising; processing each member from said list of members by identifying a group associated with said set and if said group is not created, creating said group, and adding said member to a last group in said membership list; and for each set, drawing a boundary around all groups associated with a set; and displaying said graph on a display device. - View Dependent Claims (11, 12, 13, 14, 15)
-
-
16. A method performed on a computer processor, said method comprising:
-
receiving a plurality of members, each of said members being a member of at least one set, at least one of said members being a member of at least two sets; creating a graph by laying out said elements according to said hierarchy by a layout method comprising; for each of said sets, laying out said members within each set, at least two of said sets comprising a first member; applying a constraint driven force directed algorithm to optimize placement of said members within said sets; and create paths between each of said members being located in at least two of said sets; and presenting said graph on an output device. - View Dependent Claims (17, 18, 19, 20)
-
Specification