Pages that link to "Item:Q1940703"
From MaRDI portal
The following pages link to Convex hull of points lying on lines in \(O(n\log n)\) time after preprocessing (Q1940703):
Displaying 6 items.
- Minimizing the diameter of a spanning tree for imprecise points (Q1709600) (← links)
- Constructing the convex hull of a partially sorted set of points (Q1803271) (← links)
- A fully polynomial time approximation scheme for the smallest diameter of imprecise points (Q2304571) (← links)
- Complexity analysis and performance of double hashing sort algorithm (Q2338136) (← links)
- Preprocessing Ambiguous Imprecise Points (Q5088972) (← links)
- LATIN 2004: Theoretical Informatics (Q5901636) (← links)