Shortest paths for line segments
暂无分享,去创建一个
Günter Rote | Chee-Keng Yap | Emo Welzl | Christian Icking | E. Welzl | C. Yap | G. Rote | C. Icking
[1] H. G. Eggleston. Convexity by H. G. Eggleston , 1958 .
[2] Philip D. Plowright,et al. Convexity , 2019, Optimization for Chemical and Biochemical Engineering.
[3] J. T. Shwartz,et al. On the Piano Movers' Problem : III , 1983 .
[4] Joseph O'Rourke. Finding A Shortest Ladder Path: A Special Case , 1987 .
[5] Christian Blatter. Über Kurven konstanter Breite. , 1981 .
[6] Edward D. Kim,et al. Jahresbericht der deutschen Mathematiker-Vereinigung , 1902 .
[7] Christos H. Papadimitriou,et al. Optimal piecewise linear motion of an object among obstacles , 1987, Algorithmica.
[8] Micha Sharir,et al. A Note on the Papadimitriou-Silverberg Algorithm for Planning Optimal Piecewise-Linear Motion of a Ladder , 2019, Inf. Process. Lett..
[9] Chee Yap,et al. Algorithmic motion planning , 1987 .
[10] Leonidas J. Guibas,et al. Visibility-polygon search and euclidean shortest paths , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[11] Harry W. Nelson. Elemente der Mathematik , 1911 .
[12] D. Hilbert,et al. Über das Dirichlet'sche Princip. , 1900 .
[13] S. Ulam. Problems in modern mathematics , 1964 .
[14] Michael Goldberg. The Minimum Path and the Minimum Motion of a Moved Line Segment , 1973 .
[15] A. Besicovitch. On Kakeya's problem and a similar one , 1928 .
[16] J. Schwartz,et al. On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers , 1983 .
[17] Willi Rinow,et al. Die innere Geometrie der metrischen Räume , 1961 .