Finding the upper envelope of n line segments in O(n log n) time (Q582095): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q1384195 |
||
| Property / author | |||
| Property / author: J. E. Hershberger / rank | |||
Revision as of 13:54, 27 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the upper envelope of n line segments in O(n log n) time |
scientific article |
Statements
Finding the upper envelope of n line segments in O(n log n) time (English)
0 references
1989
0 references
computational geometry
0 references
upper envelope
0 references
Davenport-Schinzel sequence
0 references
