Under the promise that the convex hull vertices form a subsequence of the input, the hull can be computed in O(n sqrt(log n)) deterministic time or O(n log^ε n) expected time, and the promise is tight because even one out-of-order hull point forces an Omega(n log n) lower bound.
4 Sarita de Berg, Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann, and Sampson Wong
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.CG 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Instance-optimal retrieval algorithms for Pareto fronts of overlapping imprecise rectangles, plus universally optimal time bounds for unit squares.
citing papers explorer
-
Computing Planar Convex Hulls with a Promise
Under the promise that the convex hull vertices form a subsequence of the input, the hull can be computed in O(n sqrt(log n)) deterministic time or O(n log^ε n) expected time, and the promise is tight because even one out-of-order hull point forces an Omega(n log n) lower bound.
-
Instance and Universally Optimal Bounds for Imprecise Pareto Fronts
Instance-optimal retrieval algorithms for Pareto fronts of overlapping imprecise rectangles, plus universally optimal time bounds for unit squares.