Author:
Borgelt Magdalene G.,van Kreveld Marc,Luo Jun
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Agarwal, P.K.: Range searching. In: Goodman, J.E., O’Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, ch. 36, 2nd edn., pp. 809–838. Chapman & Hall/CRC, Boca Raton (2004)
2. Agarwal, P.K., Erickson, J.: Geometric range searching and its relatives. In: Chazelle, B., Goodman, J.E., Pollack, R. (eds.) Advances in Discrete and Computational Geometry, AMS, Providence, RI. Contemporary Mathematics, vol. 223, pp. 1–56 (1999)
3. Aronov, B.: On the Geodesic Voronoi Diagram of Point Sites in a Simple Polygon. Algorithmica 4, 109–140 (1989)
4. Asano, T., Toussaint, G.: Computing the Geodesic Center of a Simple Polygon. In: Johnson, D.S., Nozaki, A., Nishizeki, T., Willis, H. (eds.) Perspectives in Computing: Discrete Algorithms and Complexity, pp. 65–79 (1987)
5. Aurenhammer, F.: Voronoi diagrams: A survey of a fundamental geometric data structure. ACM Comput. Surveys 23, 345–405 (1991)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献