Finding the upper envelope of n line segments in O(n log n) time (Q582095): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68U99 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 4130010 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
computational geometry | |||
| Property / zbMATH Keywords: computational geometry / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
upper envelope | |||
| Property / zbMATH Keywords: upper envelope / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Davenport-Schinzel sequence | |||
| Property / zbMATH Keywords: Davenport-Schinzel sequence / rank | |||
Normal rank | |||
Revision as of 18:03, 1 July 2023
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
