Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference26 articles.
1. M. Bern, D. Eppstein, and J. Gilbert. Provably good mesh generation.Proc. 31st IEEE Symp. on Foundations of Computer Science, 1990, pp. 231–241. Some cited results appear only in the full version,J. Comput. System. Sci., to appear.
2. K. Clarkson. Approximation algorithms for planar traveling salesman tours and minimum-length triangulations.Proc. 2nd ACM-SIAM Symp. on Discrete Algorithms, 1991, pp. 17–23.
3. E. F. D'Azevedo and R. B. Simpson. On optimal interpolation triangle incidences.SIAM J. Sci. Statist. Comput. 10 (1989), 1063–1075.
4. D. Z. Du and F. K. Hwang. An approach to proving lower bounds: solution of Gilbert-Pollack's conjecture on Steiner ratio.Proc. 31st IEEE Symp. Foundations of Computer Science, 1990, pp. 76–85.
5. H. Edelsbrunner and T. S. Tan. A quadratic time algorithm for the minmax length triangulation.Proc. 32nd IEEE Symp. on Foundations of Computer Science, 1991, pp. 414–423.
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献