Kirkpatrick–Seidel algorithm

Known as: Kirkpatrick-Seidel algorithm, Ultimate convex hull algorithm, Ultimate planar convex hull algorithm 
The Kirkpatrick–Seidel algorithm, called by its authors "the ultimate planar convex hull algorithm" is an algorithm for computing the convex hull of… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1968-2018
024619682018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
We investigate the dynamics of a boson gas with three-body interactions in dimensions d = 1, 2. We prove that in the limit where… (More)
Is this relevant?
2008
2008
We develop a very simple method to study the high temperature, or equivalently high external field, behavior of the Sherrington… (More)
Is this relevant?
2007
2007
The Sherrington-Kirkpatrick spin glass model has been studied as a source of insight into the statistical mechanics of systems… (More)
Is this relevant?
2005
2005
An x-ray beam with energy of 20.5 keV has been efficiently focused down to a spot size as small as 90 nm390 nm by a Kirkpatrick… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 7
Is this relevant?
2004
2004
We prove that in the high temperature regime (T/J > 1) the deviation of the total free energy of the Sherrington-Kirkpatrick (S-K… (More)
Is this relevant?
2004
2004
We study a finite-range spin-glass model in arbitrary dimension, where the intensity of the coupling between spins decays to zero… (More)
Is this relevant?
1995
1995
We consider the Hoppeld model with M(N) = N patterns, where N is the number of neurons. We show that if is suuciently small and… (More)
Is this relevant?
1992
1992
We consider several cases of the point matching problem in which we are to nd a transformation of a set of n points such that… (More)
  • figure 3
Is this relevant?
1989
1989
An inverse problem in fractal set const ruc t ion is introduced in th is paper, according to the theory of iterated function… (More)
Is this relevant?
Highly Cited
1986
Highly Cited
1986
We present a new planar convex hull algorithm with worst case time complexity O(n log H) where n is the size of the input set and… (More)
  • figure 3.1
  • figure 3.2
  • figure 5.1
  • figure 5.2
Is this relevant?