暂无分享,去创建一个
Michiel H. M. Smid | Jean-Lou De Carufel | Anil Maheshwari | Megan Owen | Carsten Grimm | M. Smid | A. Maheshwari | Megan Owen | J. Carufel | Carsten Grimm
[1] Chandrajit L. Bajaj,et al. The algebraic degree of geometric optimization problems , 1988, Discret. Comput. Geom..
[2] Jörg-Rüdiger Sack,et al. Similarity of polygonal curves in the presence of outliers , 2012, Comput. Geom..
[3] Bernd Sturmfels,et al. The algebraic degree of semidefinite programming , 2010, Math. Program..
[4] Jürgen Klüners,et al. Galois Group Computation for Rational Polynomials , 2000, J. Symb. Comput..
[5] Jörg-Rüdiger Sack,et al. Determining approximate shortest paths on weighted polyhedral surfaces , 2005, JACM.
[6] Prosenjit Bose,et al. A survey of geodesic paths on 3D surfaces , 2011, Comput. Geom..
[7] Jean-Lou De Carufel,et al. Unsolvability of the Weighted Region Shortest Path Problem I , 2012 .
[8] Joseph S. B. Mitchell,et al. Geometric Shortest Paths and Network Optimization , 2000, Handbook of Computational Geometry.
[9] H. O. Foulkes. Abstract Algebra , 1967, Nature.
[10] Seth Sullivant,et al. Geodesics in CAT(0) Cubical Complexes , 2011, Adv. Appl. Math..
[11] Henri Cohen,et al. A course in computational algebraic number theory , 1993, Graduate texts in mathematics.
[12] C. Bajaj. The Algebraic Complexity of Shortest Paths in Polyhedral Spaces , 1985 .
[13] Joseph S. B. Mitchell,et al. The weighted region problem: finding shortest paths through a weighted planar subdivision , 1991, JACM.