Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Out-of-time-order correlation functions provide a proxy for diagnosing chaos in quantum systems. We propose and analyze an… 
Highly Cited
2013
Highly Cited
2013
The authors of [Ann. Henri Poincar\'{e} 16 (2015) 691-708] introduced a multi-species version of the Sherrington-Kirkpatrick… 
Review
2010
Review
2010
In this paper, we review theoretical and experimental research on rare region effects at quantum phase transitions in disordered… 
Review
2008
Review
2008
The primary goal of intensivist bedside ultrasonography (INBU) is the assessment of patient hemodynamic and volume status… 
Highly Cited
2005
Highly Cited
2005
The International Court of Justice (ICJ) has jurisdiction over disputes between nations and has decided dozens of cases since it… 
1998
1998
A soft x-ray microscope (E≲3 keV) with high spatial resolution (∼3 μm) has been characterized at the University of Rochester’s… 
Review
1994
Review
1994
A black bear (Ursus americanus) food value index (FVI) was developed and calculated for forest cover type classifications on… 
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…