Efficient algorithms for automatic viewer orientation
暂无分享,去创建一个
[1] Bruce W. Weide,et al. Optimal Expected-Time Algorithms for Closest Point Problems , 1980, TOMS.
[2] C. L. Lawson. The Smallest Covering Cone or Sphere (C. Groenewod and L. Eusanio) , 1965 .
[3] Michael Ian Shamos,et al. Divide and Conquer for Linear Expected Time , 1978, Inf. Process. Lett..
[4] D. T. Lee,et al. Generalization of Voronoi Diagrams in the Plane , 1981, SIAM J. Comput..
[5] David P. Anderson. An orientation method for central projection programs , 1982, Comput. Graph..
[6] Ronald L. Graham,et al. An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..
[7] Michael Ian Shamos,et al. Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).
[8] F. P. Preparata,et al. Convex hulls of finite sets of points in two and three dimensions , 1977, CACM.
[9] C. Groenewoud,et al. The Smallest Covering Cone or Sphere , 1963 .
[10] B. Efron. The convex hull of a random set of points , 1965 .
[11] D. Hearn,et al. Geometrical Solutions for Some Minimax Location Problems , 1972 .
[12] Francis Y. L. Chin,et al. Minimum Vertex Distance Between Separable Convex Polygons , 1984, Inf. Process. Lett..