Author:
Agarwal Pankaj K.,Sharir Micha
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference13 articles.
1. P. Agarwal, B. Aronov, M. Sharir, and S. Suri, Selecting distances in the plane,Algorithmic 9 (1993), 495?514.
2. P. Agarwal and M. Sharir, Off-line dynamic maintenance of the width of a planar point set,Comput. Geom. Theory Appl. 1 (1991), 65?78.
3. B. Chazelle, The polygon containment problem, inAdvances in Computer Science, Vol. 1 (F. P. Preparata, ed.), JAI Press, Greenwich, CT, 1983, pp. 1?33.
4. P. Chew and K. Kedem, Placing the largest similar copy of a convex polygon among polygonal obstacles,Comput. Geom. Theory Appl. 3 (1993), 59?89.
5. R. Cole, Slowing down sorting networks to obtain faster sorting algorithms,J. Assoc. Comput. Mach. 31 (1984), 200?208.
Cited by
46 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献