Optimal Nearly-Similar Polygon Stabbers of Convex Polygons
暂无分享,去创建一个
[1] Rephael Wenger,et al. Stabbing pairwise disjoint translates in linear time , 1989, SCG '89.
[2] Mikhail J. Atallah,et al. Efficient Algorithms for Common Transversals , 1987, Inf. Process. Lett..
[3] Herbert Edelsbrunner. Finding Transversals for Sets of Simple Geometric Figures , 1985, Theor. Comput. Sci..
[4] David Rappaport. Minimum polygon transversals of line segments , 1995, Int. J. Comput. Geom. Appl..
[5] Asish Mukhopadhyay,et al. Computing an Area-optimal Convex Polygonal Stabber of a Set of Parallel Line Segments , 1993, CCCG.
[6] Ivan Stojmenovic,et al. Computing shortest transversals of sets , 1992, Int. J. Comput. Geom. Appl..
[7] David Avis,et al. Polyhedral line transversals in space , 1988, Discret. Comput. Geom..
[8] Herbert Edelsbrunner,et al. Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.
[9] David Avis,et al. Algorithms for high dimensional stabbing problems , 1990, Discret. Appl. Math..
[10] Arnold L. Rosenberg,et al. Stabbing line segments , 1982, BIT.
[11] Joseph O'Rourke,et al. An on-line algorithm for fitting straight lines between data ranges , 1981, CACM.