Output-size sensitive algorithms for finding maximal vectors
作者： David G. Kirkpatrick , Raimund Seidel
关键词: Convex hull 、 Convex polytope 、 Real projective plane 、 Projective plane 、 Plane curve 、 Combinatorics 、 Mathematics
摘要:
acm.org
sci-hub.se 参考文章(7)
Aho AV, JE Hopcroft, JD Ullman, The Design and Analysis of Computer Algorithms ,(1974)
David G. Kirkpatrick, Raimund Seidel, The ultimate planar convex hull algorithm SIAM Journal on Computing. ,vol. 15, pp. 287- 299 ,(1986) , 10.1137/0215021
Harold N. Gabow, Jon Louis Bentley, Robert E. Tarjan, Scaling and related techniques for geometry problems symposium on the theory of computing. pp. 135- 143 ,(1984) , 10.1145/800057.808675
Jon Louis Bentley, Hsiang-Tsung Kung, Mario Schkolnick, Clark D Thompson, On the Average Number of Maxima in a Set of Vectors and Applications Journal of the ACM. ,vol. 25, pp. 536- 543 ,(1978) , 10.1145/322092.322095
Jon Louis Bentley, Michael Ian Shamos, Divide and conquer for linear expected time Information Processing Letters. ,vol. 7, pp. 87- 91 ,(1978) , 10.1016/0020-0190(78)90051-0
H. T. Kung, F. Luccio, F. P. Preparata, On Finding the Maxima of a Set of Vectors Journal of the ACM. ,vol. 22, pp. 469- 476 ,(1975) , 10.1145/321906.321910
Michael Ben-Or, Lower bounds for algebraic computation trees symposium on the theory of computing. pp. 80- 86 ,(1983) , 10.1145/800061.808735