|
15
|
Stable Minimum Space Partitioning in Linear Time
– Jyrki Katajainen, Tomi Pasanen
- 1992
|
|
12
|
Space-Efficient Algorithms for Computing the Convex Hull of a Simple Polygonal Line in Linear Time
– Hervé Brönnimann, Timothy M. Chan
|
|
4
|
A space-efficient algorithm for line segment intersection
– E Y Chen, T M-Y Chan
|
|
23
|
Divide-and-conquer in multidimensional space
– J L Bentley, M I Shamos
- 1976
|
|
9
|
Sorting multisets stably in minimum space
– Jyrki Katajainen, Tomi Pasanen
- 1994
|
|
87
|
The ultimate planar convex hull algorithm
– D G Kirkpatrick, R Seidel
- 1986
|
|
17
|
Space-efficient planar convex hull algorithms
– Herve Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried Toussaint
- 2002
|
|
9
|
Towards In-Place Geometric Algorithms and Data Structures
– Hervé Brönnimann, Timothy M. Chan, Eric Y. Chen
- 2003
|
|
198
|
An Efficient Algorithm for Determining the Convex Hull of a Finite Planar
– R L Graham
- 1972
|
|
7320
|
Introduction to Algorithms
– T CORMEN, C LEISERSON, R RIVEST
- 1985
|
|
6
|
T.: Asymptotically efficient in-place merging. Theoretical Computer Science 237
– V Geffert, J Katajainen, Pasanen
- 2000
|
|
3
|
A one-way, stackless quicksort algorithm
– B-C Huang, D E Knuth
- 1986
|
|
1
|
Asymptotically e#cient in-place merging
– V Geert, J Katajainen, T Pasanen
- 2000
|
|
1
|
External-memory computational geometry. FOCS
– M T Goodrich, J-J Tsay, D E Vengro, J S Vitter
- 1993
|
|
1
|
A generalized, stackless quicksort algorithm
– L M Wegner
- 1987
|
|
2
|
Jyh-Jong Tsay, Darren Erik Vengroff, and Jeffrey Scott Vitter. External-memory computational geometry
– Michael T Goodrich
- 1993
|
|
1
|
Towards inplace geometric algorithms and data structures
– Hervé Brönnimann, Timothy Moon-Yew Chan, Eric Chen
- 2004
|
|
2
|
Fast Randomized Parallel Methods for Planar Convex Hull Construction
– Mujtaba Ghouse, Michael T. Goodrich
- 1991
|
|
14
|
Randomized geometric algorithms
– K L Clarkson
- 1992
|
