Optimal in-place planar convex hull algorithms (2002)

by Hervé Brönnimann , John Iacono , Jyrki Katajainen , Pat Morin , Godfried Toussaint
Venue:Proceedings of Latin American Theoretical Informatics (LATIN 2002), volume 2286 of Lecture Notes in Computer Science
Citations:5 - 2 self

Documents Related by Co-Citation

16 Stable Minimum Space Partitioning in Linear Time – Jyrki Katajainen, Tomi Pasanen - 1992
4 A space-efficient algorithm for line segment intersection – E Y Chen, T M-Y Chan
15 Space-Efficient Algorithms for Computing the Convex Hull of a Simple Polygonal Line in Linear Time – Hervé Brönnimann, Timothy M. Chan
26 Divide-and-conquer in multidimensional space – J Bentley, M Shamos - 1976
9 Sorting multisets stably in minimum space – Jyrki Katajainen, Tomi Pasanen - 1994
8557 R.: Introduction to Algorithms – T Cormen, C Leiserson, Rivest - 1990
13 Towards In-Place Geometric Algorithms and Data Structures – Hervé Brönnimann, Timothy M. Chan, Eric Y. Chen - 2003
238 An E~cient Algorithm .for Determining the Convex Hull of a Finite Planar Set – R L Graham - 1972
98 The ultimate planar convex hull algorithm – D G Kirkpatrick, R Seidel - 1986
20 Space-efficient planar convex hull algorithms – Herve Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried Toussaint - 2002
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
4 Robert Endre Tarjan. Time bounds for selection – Manuel Blum, Robert W Floyd, Vaughan Ronald Pratt, Ronald Linn Rivest
22 Algorithm 63 (PARTITION) and algorithm 65 (FIND – C A R Hoare - 1961