Finding the upper envelope of n line segments in O(n log n) time (Q582095)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding the upper envelope of n line segments in O(n log n) time |
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
