Data Structures and Algorithms

   

Timetree: A New Way for Representing Time

Authors: Hui Wang

We always use timeline to describe time, but timeline unable to describe dynamic time. Because dynamic time is on changing, so timeline must be changing too, but it is impossible. Timeline includes layers, relationships existed between layers. If we changed a layer, the others need to be fixed too. Timeline can not make it up automatically, human being must take the work, therefore real-time-changing becomes impossible. It is no matter for film making, but internet needs instant responding, timeline can not cover it. Here we show a new structure called timetree, it is an auto-balanced hierarch structure. Its structure always be complete during changing without help from human being. It is a challenge for making dynamic interactive contents on internet, timetree is born for it. We have tried timeline before now it is the turn of timetree.

Comments: 12 Pages.

Download: PDF

Submission history

[v1] 2024-01-24 12:42:56

Unique-IP document downloads: 237 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus