No deterministic output-sensitive algorithm for planar maxima or convex hull can simultaneously achieve optimal time and I/O complexity.
8 Alok Aggarwal and S
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Impossibility of Simultaneous Time and I/O Optimality for The Planar Maxima and Convex Hull Problems
No deterministic output-sensitive algorithm for planar maxima or convex hull can simultaneously achieve optimal time and I/O complexity.