Conflict management for calendar events
US-2016364698-A1 · Dec 15, 2016 · US
US11645628B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-11645628-B2 |
| Application number | US-202117321093-A |
| Country | US |
| Kind code | B2 |
| Filing date | May 14, 2021 |
| Priority date | May 16, 2019 |
| Publication date | May 9, 2023 |
| Grant date | May 9, 2023 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A computer-implemented method for translating time between calendar systems is described herein. The method includes accessing a first tree structure for a first calendar system, where data corresponding to the first tree structure include time intervals for the first calendar system that are arranged into layers of nodes, and where the layers of nodes are mapped to universal time. The method also includes scheduling a calendar content item corresponding to a time fragment relative to the universal time. The method further includes translating the calendar content item to a first human-readable time fragment for the first calendar system by traversing the first tree structure corresponding to the first calendar system to convert the time fragment to the first human-readable time fragment based on the mapping of the layers of nodes of the first tree structure to the universal time.
Opening claim text (preview).
What is claimed is: 1. A computer-implemented method for translating time between calendar systems, comprising: constructing a first tree structure for a first calendar system, wherein data corresponding to the first tree structure comprise time intervals for the first calendar system that are arranged into layers of nodes, wherein the layers of nodes are mapped to universal time, and wherein the first tree structure is constructed such that layers of the first tree structure below a root node comprise identical sibling nodes for layers above a threshold interval size that is a smallest repeatable unit of time according to the first calendar system; assigning node identifications to the nodes of the first tree structure such that the time interval for each node in the layers of the first tree structure above the threshold interval size for the first calendar system is a repeatable unit of time and the time interval for each node in the layers of the first tree structure below the threshold interval size for the first calendar system varies according to leap values; accessing, via digital map calendar application executing on a computing system, the first tree structure for three first calendar system; scheduling, via the digital map calendar application, a calendar content item corresponding to a time fragment relative to the universal time; translating, via the digital map calendar application, the calendar content item to a first human-readable time fragment for the first calendar system by traversing the first tree structure to convert the time fragment to the first human-readable time fragment based on the mapping of the layers of nodes of the first tree structure to the universal time; and causing display, via a digital map calendar user interface of the digital map calendar application, of a representation of the calendar content item relative to the first human-readable time fragment based on a map calendar, wherein the organized as units of time within a coordinate plane. 2. The computer-implemented method of claim 1 , comprising: accessing a second tree structure for a second calendar system, wherein data corresponding to the second tree structure comprise time intervals for the second calendar system that are arranged into layers of nodes, and wherein the layers of nodes are mapped to universal time; and translating the calendar content item to a second human-readable time fragment for the second calendar system by traversing the second tree structure to convert the time fragment to the second human-readable time fragment based on the mapping of the layers of nodes of the second tree structure to the universal time. 3. The computer-implemented method of claim 2 , comprising causing display of a second representation of the calendar content item relative to the second human-readable time fragment based on the map calendar. 4. The computer-implemented method of claim 1 , comprising: accessing a second tree structure for a second calendar system, wherein data corresponding to the second tree structure comprise time intervals for the second calendar system that are arranged into layers of nodes, and wherein the layers of nodes are mapped to universal time; scheduling a second calendar content item corresponding to a second time fragment relative to the second calendar system; and translating the second calendar content item to a second human-readable time fragment for the first calendar system by: traversing the second tree structure corresponding to the second calendar system to convert the second time fragment to a corresponding universal time based on the mapping of the layers of nodes of the second tree structure to the universal time; and traversing the first tree structure corresponding to the first calendar system to convert the universal time corresponding to the second time fragment to the second human-readable time fragment based on the mapping of the layers of nodes of the first tree structure to the universal time. 5. The computer-implemented method of claim 1 , further comprising: accessing a second tree structure for a second calendar system, wherein data corresponding to the second tree structure comprise time intervals for the second calendar system that are arranged into layers of nodes, and wherein the layers of nodes are mapped to universal time; scheduling the calendar content item corresponding to the time fragment relative to the universal time and a second calendar content item corresponding to a second time fragment relative to the universal time; translating the calendar content item to the first human-readable time fragment for the first calendar system by traversing the first tree structure corresponding to the first calendar system to convert the time fragment to the first human-readable time fragment based on the mapping of the layers of nodes of the first tree structure to the universal time; translating the second calendar content item to a second human-readable time fragment for a second calendar system by traversing the second tree structure corresponding to the second calendar system to convert the time fragment to the second human-readable time fragment based on the mapping of the layers of nodes of the second tree structure to the universal time; and simultaneously causing display of the representation of the calendar content item relative to the first human-readable time fragment and a second representation of the second calendar content item relative to the second human-readable time fragment. 6. The computer-implemented method of claim 1 , further comprising: causing display of a representation of time fragments that occur before and/or after the calendar content item, as measured based on the universal time, relative to at least one other calendar system. 7. A computing system, comprising a processor for executing computer-executable instructions that cause the processor to: construct a first tree structure for a first calendar system, wherein data corresponding to the first tree structure comprise time intervals for the first calendar system that are arranged into layers of nodes, wherein the layers of nodes are mapped to universal time, and wherein the first tree structure is constructed such that such that layers of the first tree structure below a root node comprise identical sibling nodes for lavers above a threshold interval size that is a smallest repeatable unit of time according to the first calendar system; assign node identifications to the nodes of the first tree structure such that the time interval for each node in the layers of the first tree structure above the threshold interval size for the first calendar system is a repeatable unit of time and the time interval for each node in the layers of the first tree structure below the threshold interval size for the first calendar system varies according to leap values; access, via digital map calendar application executing on the computing system, the first tree structure for the first calendar system; schedule, via the digital map calendar application, a calendar content item corresponding to a time fragment relative to the universal time; translate, via the digital map calendar application, the calendar content item to a first human-readable time fragment for the first calendar system by traversing the first tree structure to convert the time fragment to the first human-readable time fragment based on the mapping of the layers of nodes of the first tree structure to the universal time; and cause display, via a digital map calendar user interface of the digital map calendar application, of a representation of the calendar content item relative to the first human-readable time fragment based on a map calendar, wherein the map calendar comprises a conti
Filtering based on additional data, e.g. user or group profiles · CPC title
Trees, e.g. B+trees · CPC title
Calendar-based scheduling for persons or groups · CPC title
Presentation of query results · CPC title
Time management, e.g. calendars, reminders, meetings or time accounting · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.