On Local Transformation of Polygons with Visibility Properties
暂无分享,去创建一个
[1] John Hershberger,et al. Finding the visibility graph of a simple polygon in time proportional to its size , 1987, SCG '87.
[2] Marc Noy,et al. Flipping Edges in Triangulations , 1999, Discret. Comput. Geom..
[3] Marc Noy,et al. Graph of triangulations of a convex polygon and tree of triangulations , 1999, Comput. Geom..
[4] Marc Noy,et al. Geometric Tree Graphs of Points in Convex Position , 1999, Discret. Appl. Math..
[5] Godfried T. Toussaint,et al. An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge , 1981, IEEE Transactions on Computers.
[6] J. O'Rourke. Art gallery theorems and algorithms , 1987 .
[7] David Avis,et al. Reverse Search for Enumeration , 1996, Discret. Appl. Math..
[8] Joseph S. B. Mitchell,et al. Generating Random Polygons with Given Vertices , 1996, Comput. Geom..
[9] Michel Pocchiola,et al. Computing the visibility graph via pseudo-triangulations , 1995, SCG '95.
[10] Charles L. Lawson,et al. Transforming triangulations , 1972, Discret. Math..
[11] Barry Joe,et al. Construction of three-dimensional Delaunay triangulations using local transformations , 1991, Comput. Aided Geom. Des..