An $O(E\log E + I)$ Expected Time Algorithm for the Planar Segment Intersection Problem (Q3685220)
From MaRDI portal
!
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 3907793
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An $O(E\log E + I)$ Expected Time Algorithm for the Planar Segment Intersection Problem |
scientific article; zbMATH DE number 3907793 |
Statements
An $O(E\log E + I)$ Expected Time Algorithm for the Planar Segment Intersection Problem (English)
0 references
1985
0 references
scan-line algorithm
0 references
computational geometry
0 references
work list bubble sort
0 references
distribution-based search
0 references
0.8941866
0 references
0.8725492
0 references
0 references
0.86347246
0 references
0.86187446
0 references
0.85949206
0 references
0.8575546
0 references
0.8575546
0 references
