Optimal Computation of Finitely Oriented Convex Hulls
暂无分享,去创建一个
[1] Ray A. Jarvis,et al. On the Identification of the Convex Hull of a Finite Set of Points in the Plane , 1973, Inf. Process. Lett..
[2] Hossam A. ElGindy,et al. A new linear convex hull algorithm for simple polygons , 1984, IEEE Trans. Inf. Theory.
[3] Derick Wood,et al. An Isothetic View of Computational Geometry† †Work carried out under a Natural Sciences and Engineering Research Council of Canada Grant No. A-5692. , 1985 .
[4] Ralf Hartmut Güting,et al. Stabbing C-Oriented Polygons , 1983, Inf. Process. Lett..
[5] Ralf Hartmut Güting,et al. Dynamic C-Oriented Polygonal Intersections Searching , 1986, Inf. Control..
[6] M. Shamos. Problems in computational geometry , 1975 .
[7] Jorg-Rudiger Wolfgang Sack,et al. Rectilinear computational geometry , 1984 .
[8] Chak-Kuen Wong,et al. On the X-Y convex hull of a set of X-Y polygons , 1983, BIT Comput. Sci. Sect..
[9] Derick Wood,et al. On the Definition and Computation of Rectlinear Convex Hulls , 1984, Inf. Sci..
[10] David Avis,et al. A Linear Algorithm for Finding the Convex Hull of a Simple Polygon , 1979, Inf. Process. Lett..
[11] David Gans,et al. Transformations and geometries , 1969 .
[12] F. Frances Yao,et al. Finding the Convex Hull of a Simple Polygon , 1983, J. Algorithms.