Computing a Shortest Weakly Externally Visible Line Segment for a Simple Polygon
暂无分享,去创建一个
[1] Kyung-Yong Chwa,et al. An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment , 1993, J. Algorithms.
[2] Danny Ziyi Chen. Determining Weak External Visibility of Polygons in Parallel , 1994, CCCG.
[3] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[4] Ivan Stojmenovic,et al. Computing shortest transversals of sets , 1992, Int. J. Comput. Geom. Appl..
[5] M. Keil,et al. A Simple Algorithm for Determining the Envelope of a Set of Lines , 1991, Inf. Process. Lett..
[6] Asish Mukhopadhyay,et al. Computing in Linear Time a Chord from Which a Simple Polygon is Weakly Internally Visible , 1995, ISAAC.
[7] Asish Mukhopadhyay,et al. A Linear Time Algorithm for Computing the Shortest Line Segment from Which a Polygon is Weakly Externally Visible , 1991, WADS.
[8] Ivan Stojmenovic,et al. Computing shortest transversals of sets (extended abstract) , 1991, SCG '91.
[9] Godfried T. Toussaint,et al. An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge , 1981, IEEE Transactions on Computers.
[10] Mikhail J. Atallah,et al. Efficient Algorithms for Common Transversals , 1987, Inf. Process. Lett..
[11] Kyung Yong Chwa. An Algorithm for Determining the Internal Line Visibility of a Simple Polygon , 1993 .
[12] Giri Narasimhan,et al. Optimal linear-time algorithm for the shortest illuminating line segment in a polygon , 1994, SCG '94.
[13] David Avis,et al. Algorithms for line transversals in space , 1987, SCG '87.
[14] Herbert Edelsbrunner. Finding Transversals for Sets of Simple Geometric Figures , 1985, Theor. Comput. Sci..
[15] Leonidas J. Guibas,et al. An efficient algorithm for finding the CSG representation of a simple polygon , 1988, Algorithmica.
[16] T. Lewis. Two counterexamples concerning transversals for convex subsets of the plane , 1980 .
[17] David G. Kirkpatrick,et al. Determining sector visibility of a polygon , 1989, SCG '89.