Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time

Aloupis Boissonnat, 1998 Brönnimann, 2004, Towards in-place geometric algorithms and data structures, 239 Brönnimann, 2004, Space-efficient planar convex hull algorithms, Theoret. Comput. Sci., 321, 25, 10.1016/j.tcs.2003.05.004 Cormen, 2001 Chen, 2003, A space-efficient algorithm for segment intersection, 68 Geffert, 2000, Asymptotically efficient in-place merging, Theoret. Comput. Sci., 237, 159, 10.1016/S0304-3975(98)00162-5 Katajainen, 1982, Stable minimum space partitioning in linear time, BIT, 32, 580, 10.1007/BF01994842 Katajainen, 1994, Sorting multiset stably in minimum space, Acta Informatica, 31, 410, 10.1007/BF01178508 Katajainen, 1996, Practical in-place mergesort, Nordic J. Comput., 3, 27 Lee, 1983, On finding the convex hull of a simple polygon, Int. J. Computing Info. Sci., 12, 87, 10.1007/BF00993195 Melkman, 1987, On-line construction of the convex hull of a simple polygon, Inform. Process. Lett., 25, 11, 10.1016/0020-0190(87)90086-X Munro, 1990, Stable in situ sorting and minimum data movement, BIT, 30, 220, 10.1007/BF02017344