Sorting jordan sequences in linear time using level-linked search trees (Q4721658): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0019-9958(86)80033-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2085041675 / rank | |||
Normal rank | |||
Latest revision as of 10:24, 30 July 2024
scientific article; zbMATH DE number 3995069
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sorting jordan sequences in linear time using level-linked search trees |
scientific article; zbMATH DE number 3995069 |
Statements
Sorting jordan sequences in linear time using level-linked search trees (English)
0 references
1986
0 references
linear time
0 references
Jordan curve
0 references
Jordan sequence
0 references
sorting
0 references
computational geometry
0 references
computational geography
0 references
list-splitting problem
0 references
level-linked search trees
0 references
