Author:
Ahn Hee-Kap,Okamoto Yoshio
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Baran, I., Demaine, E.D.: Optimal adaptive algorithms for finding the nearest and farthest point on a parametric black-box curve. Internat. J. Comput. Geom. Appl. 15, 327–350 (2005)
2. Barbay, J., Chen, E.Y.: Convex hull of the union of convex objects in the plane: an adaptive analysis. In: Proc. 20th CCCG, pp. 47–51 (2008)
3. Barbay, J., Golynski, A., Munro, J.I., Rao, S.S.: Adaptive searching in succinctly encoded binary relations and tree-structured documents. Theor. Comput. Sci. 387, 284–297 (2007)
4. Barbay, J., Kenyon: Adaptive intersection and t-threshold problems. In: Proc. 13th SODA, pp. 390–399 (2002)
5. Bentley, J.L.: Multidimensional binary search trees used for associative searching. Comm. ACM 18, 509–517 (1975)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Based on region division setup planning for sheet metal assembly in aviation industry;Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture;2012-11-09