US2018276862A1PendingUtilityA1
Computer-Implemented System And Method For Cluster Spine Group Arrangement
Est. expiryFeb 13, 2024(expired)· nominal 20-yr term from priority
Inventors:Lynne Marie Evans
G06F 16/355G06T 11/26G06T 11/206G06F 17/3071G06F 17/3053G06K 9/00469G06F 17/30598H05K 999/99G06K 9/62G06F 17/30713G06F 17/30867G06F 17/30705G06K 9/6218G06F 17/30011G06T 2200/32G06F 17/30601G06F 17/30675G06T 11/60G06T 11/20Y10S707/99935G06F 16/24578G06F 16/35G06F 16/287G06F 16/9535G06F 16/334G06F 16/285G06F 16/358G06F 16/93G06V 30/416G06F 18/23
71
PatentIndex Score
0
Cited by
0
References
0
Claims
Abstract
A computer-implemented system and method for arranging cluster spine groups is provided. A plurality of spine groups is obtained. Each spine group includes two or more cluster spines with clusters. A center of the display is divided into sections and a spine group is placed into each of the sections as placed spine groups. One or more of the remaining spine groups are placed into the section with the placed spine group most similar to that remaining spine group.
Claims
exact text as granted — not AI-modifiedWhat is claimed is:
1 . A computer-implemented system for arranging cluster spine groups, comprising:
a plurality of spine groups, each spine group comprising two or more cluster spines with clusters; and a server comprising a central processing unit, memory, an input port to receive the spine groups, and an output port, wherein the central processing unit is configured to:
divide a center of a display into sections;
place a spine group into each of the sections as placed spine groups; and
place one or more of the remaining spine groups into the section with the placed spine group most similar to that remaining spine group.
2 . A system according to claim 1 , wherein the central processing unit identifies an overlap between the placed spine group and the most similar remaining spine group in at least one section and moves the most similar remaining spine group away from the placed spine group.
3 . A system according to claim 1 , wherein the central processing unit identifies an overlap between the placed spine group and the most similar remaining spine group in at least one section and moves the most similar remaining spine group and the placed spine group away from the center of the display.
4 . A system according to claim 1 , wherein one or more of the spine groups each comprise at least one cluster placed adjacent to one of the clusters on one of the cluster spines in that spine group.
5 . A system according to claim 1 , wherein the placed spine groups are placed in the sections around a shape defined in the center of the display.
6 . A system according to claim 5 , wherein a radius r of the shape is calculated according to the following equation:
r
=
Seeds
×
MaxY
2
·
π
(
1
)
where Seeds is a number of the placed spine groups and MaxY is a maximum extent along a y-axis of the placed spine groups.
7 . A system according to claim 1 , wherein the central processing unit translates the placed group in one section along an x-axis and moves the most similar remaining spine group along the x-axis when overlap exists between the placed spine group and the most similar remaining spine group.
8 . A system according to claim 7 , wherein the placed spine group is translated to a position at x=0.5×r and y=0.0 and r represents a radius of a shape defined in the center of the display around which the placed spine group is located.
9 . A system according to claim 1 , wherein each of the placed spine groups is sufficiently dissimilar from the other placed spine groups.
10 . A system according to claim 9 , wherein a similarity of the placed spine groups are determined based on a cosine value of at least 0.2.
11 . A computer-implemented method for arranging cluster spine groups, comprising:
obtaining a plurality of spine groups, each spine group comprising two or more cluster spines with clusters; dividing a center of the display into sections; placing a spine group into each of the sections as placed spine groups; and placing one or more of the remaining spine groups into the section with the placed spine group most similar to that remaining spine group.
12 . A method according to claim 11 , further comprising:
identifying an overlap between the placed spine group and the most similar remaining spine group in at least one section; and moving the most similar remaining spine group away from the placed spine group.
13 . A method according to claim 11 , further comprising:
identifying an overlap between the placed spine group and the most similar remaining spine group in at least one section; and moving the most similar remaining spine group and the placed spine group away from the center of the display.
14 . A method according to claim 11 , wherein one or more of the spine groups each comprise at least one cluster placed adjacent to one of the clusters on one of the cluster spines in that group.
15 . A method according to claim 11 , wherein the placed spine groups are placed in the sections around a shape defined in the center of the display.
16 . A method according to claim 15 , wherein a radius r of the shape is calculated according to the following equation:
r
=
Seeds
×
MaxY
2
·
π
(
1
)
where Seeds is a number of the placed spine groups and MaxY is a maximum extent along a y-axis of the placed spine groups.
17 . A method according to claim 11 , further comprising:
translating the placed group in one section along an x-axis; and moving the most similar remaining spine group along the x-axis when overlap exists between the placed spine group and the most similar remaining spine group.
18 . A method according to claim 17 , wherein the placed spine group is translated to a position at x=0.5×r and y=0.0 and r represents a radius of a shape defined in the center of the display around which the placed spine group is located.
19 . A method according to claim 11 , wherein each of the placed spine groups is sufficiently dissimilar from the other placed spine groups.
20 . A method according to claim 19 , wherein a similarity of the placed spine groups are determined based on a cosine value of at least 0.2.Join the waitlist — get patent alerts
Track US2018276862A1 — get alerts on status changes and closely related new filings.
We store only your email — no account needed. See our privacy policy.