Space-E.cient Algorithms for Computing the Convex Hull of a Simple Polygonal Line in Linear Time
暂无分享,去创建一个
[1] Timothy M. Chan,et al. Towards in-place geometric algorithms and data structures , 2004, SCG '04.
[2] Jyrki Katajainen,et al. Stable minimum space partitioning in linear time , 1992, BIT.
[3] Venkatesh Raman,et al. Stable in situ sorting and minimum data movement , 1990, BIT.
[4] Pat Morin,et al. Space-efficient planar convex hull algorithms , 2004, Theor. Comput. Sci..
[5] D. T. Lee,et al. On finding the convex hull of a simple polygon , 1983, International Journal of Computer & Information Sciences.
[6] Clifford Stein,et al. Introduction to Algorithms, 2nd edition. , 2001 .
[7] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .
[8] Jyrki Katajainen,et al. Asymptotically efficient in-place merging , 2000, Theor. Comput. Sci..
[9] Jukka Teuhola,et al. Practical In-Place Mergesort , 1996, Nord. J. Comput..
[10] Jyrki Katajainen,et al. Sorting multisets stably in minimum space , 1992, Acta Informatica.
[11] Mariette Yvinec,et al. Algorithmic geometry , 1998 .
[12] Timothy M. Chan,et al. A Space-Efficient Algorithm for Segment Intersection , 2003, CCCG.
[13] Avraham A. Melkman,et al. On-Line Construction of the Convex Hull of a Simple Polyline , 1987, Inf. Process. Lett..