Finding the upper envelope of n line segments in O(n log n) time (Q582095)
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 4130010
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding the upper envelope of n line segments in O(n log n) time |
scientific article; zbMATH DE number 4130010 |
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
0 references
0.8640847206115723
0 references
0.8504348993301392
0 references
0.8501701354980469
0 references
0.832261323928833
0 references
0.8247315883636475
0 references
