Kinetic sorting and kinetic convex hulls (Q871059): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:26, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Kinetic sorting and kinetic convex hulls |
scientific article |
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
