Author:
Hertel Stefan,Mehlhorn Kurt
Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. A.V.Aho/J.E.Hopcroft/J.D.Ullman: The Design and Analysis of Computer Algorithms, Addison-Wesley Publ. Comp., Reading, Mass., 1974.
2. J.L. Bentley/T.A. Ottmann: Algorithms for Reporting and Counting Geometric Intersections, IEEE Trans. on Comp., Vol. C-28, No. 9 (1975), pp. 643–647.
3. B.Chazelle: A Theorem on Polygon Cutting with Applications, Proc. 23rd IEEE FOCS Symp. (1982), pp. 339–349.
4. M.R. Garey/D.S. Johnson/F.P. Preparata/R.E. Tarjan: Triangulating a Simple Polygon, Info. Proc. Letters, Vol. 7(4), June 1978, pp. 175–179.
5. D.T. Lee/F.P. Preparata: Location of a Point in a Planar Subdivision and its Applications, SIAM J. Comp., Vol. 6(1977), pp. 594–606.
Cited by
46 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献