Author:
Erickson Jeff,Nayyeri Amir
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference81 articles.
1. Agol, I., Hass, J., Thurston, W.P.: The computational complexity of knot genus and spanning area. Trans. Am. Math. Soc. 358(9), 3821–3850 (2006)
2. Alexandrov, A.D.: Existence of a convex polyhedron and of a convex surface with a given metric. Rec. Math. [Mat. Sbornik] 11(53)(1–2), 15–65 (1942). In Russian, with English summary
3. Avis, D., Gum, T., Toussaint, G.T.: Visiblity between two edges of a simple polygon. Vis. Comput. 2, 342–357 (1986)
4. Bentley, J.L., Yao, A.C.C.: An almost optimal algorithm for unbounded searching. Inf. Proc. Lett. 5, 82–87 (1976)
5. Birman, J.S., Series, C.: Geodesics with bounded intersection number on surfaces are sparsely distributed. Topology 24(2), 217–225 (1985)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献