Kinetic sorting and kinetic convex hulls (Q871059)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 5134246
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Kinetic sorting and kinetic convex hulls |
scientific article; zbMATH DE number 5134246 |
Statements
Kinetic sorting and kinetic convex hulls (English)
0 references
15 March 2007
0 references
The main result of the paper is determining tight lower bounds for the problem of kinetic sorting (which means: to maintain a data structure on the real set \(S\) of \(n\) points moving on the real line so to be able to quickly generate a sorted list of the points in \(S\) at any given time). Some other results concerning kinetic data structure are also given.
0 references
Computational geometry
0 references
Kinetic data structures
0 references
Kinetic sorting
0 references
Lower bounds
0 references
Kinetic convex hulls
0 references
0 references
0.9333645701408386
0 references
0.8295690417289734
0 references
0.8271152377128601
0 references
0.8004644513130188
0 references
0.7961500287055969
0 references
