Finding the upper envelope of n line segments in O(n log n) time (Q582095): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q29302733, #quickstatements; #temporary_batch_1719332822301 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q29302733 / rank | |||
Normal rank | |||
Latest revision as of 17:28, 25 June 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
0 references
