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. Generalized hidden surface removal;de Berg,1993
4. Perfect binary space partition trees;de Berg,1993
5. Triangulating a simple polygon in linear time;Chazelle;Discrete Comput. Geom.,1991
Cited by
184 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献