Author:
Gajentaan Anka,Overmars Mark H.
Subject
Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications
Reference23 articles.
1. How hard are n2-hard problems?;Bloch;SIGACT News,1994
2. Filling polyhedral molds;Bose,1993
3. M. de Berg, Generalized hidden surface removal, in: Proc. 9th ACM Symp. on Computational Geometry, 1993, pp. 1–10.
4. M. de Berg, M. de Groot, M. Overmars, Perfect binary space partition trees, in: Proc. 5th Canad. Conf. Comput. Geom., 1993, pp. 109–114.
5. Triangulating a simple polygon in linear time;Chazelle;Discrete Comput. Geom.,1991
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献