Graham scan

Known as: Graham's scan, Graham, Graham's algorithm 
Graham's scan is a method of finding the convex hull of a finite set of points in the plane with time complexity O(n log n). It is named after Ronald… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1946-2017
010203019462016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
In this paper, we propose a triangulation method for a set of points in the plane. The method is based on the idea of… (More)
  • figure 1
  • figure 2
  • figure 5
  • figure 3
  • figure 6
Is this relevant?
Highly Cited
2010
Highly Cited
2010
In 1926 van der Waerden [13] proved the following startling theorem : If the set of integers is arbitrarily partitioned into two… (More)
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Spearman's footrule and Kendall's tau are two well established distances between rankings. They, however, fail to take into… (More)
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We construct a simple fully homomorphic encryption scheme, using only elementary modular arithmetic. We use Gentry’s technique to… (More)
Is this relevant?
2005
2005
The estimate of the Phase Change Rate of the local clock makes more efficient a clock synchronization protocol, like IEEE1588… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
At Eurocrypt ’96, Coppersmith proposed an algorithm for finding small roots of bivariate integer polynomial equations, based on… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We study the problems of makespan minimization (load balancing), knapsack, and bin packing when the jobs have stochastic… (More)
Is this relevant?
1995
1995
Results in the spectral theory of differential operators, and recent results on conformally covariant differential operators and… (More)
  • table 6.1
  • table 6.2
  • table 6.4
Is this relevant?
1994
1994
We show the equivalence of several diierent axiomatizations of the notion of (abstract) probabilistic domain in the category of… (More)
Is this relevant?
1981
1981
A graph satisfies Axiom n if, for any sequence of 2n of its points, there is another point adjacent to the first n and not to any… (More)
Is this relevant?