On translating a set of objects in 2- and 3-dimensional space
暂无分享,去创建一个
[1] Thomas Ottmann,et al. On translating a set of line segments , 1983, Comput. Vis. Graph. Image Process..
[2] Leonidas J. Guibas,et al. On translating a set of rectangles , 1980, STOC '80.
[3] Bernard Chazelle,et al. The Complexity and Decidability of Separation , 1984, ICALP.
[4] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..
[5] Thomas Ottmann,et al. Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.
[6] Otto Nurmi. A fast line-sweep algorithm for hidden line elimination , 1985, BIT Comput. Sci. Sect..
[7] Thomas Ottmann,et al. Solving Visibility Problems by Using Skeleton Structures , 1984, MFCS.
[8] Derick Wood,et al. An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles , 1980, IEEE Transactions on Computers.
[9] Martin E. Newell,et al. A new approach to the shaded picture problem , 1972 .