论文信息 - Computing the Shortest Diagonal of a Monotone Polygon in Linear Time - 字舞流文

Computing the Shortest Diagonal of a Monotone Polygon in Linear Time

[1] Alain Fournier,et al. Triangulating Simple Polygons and Equivalent Problems , 1984, TOGS.

[2] Alok Aggarwal,et al. Computing the Minimum Visible Vertex Distance between Two Polygons (Preliminary Version) , 1989, WADS.

[3] Alok Aggarwal,et al. Geometric applications of a matrix-searching algorithm , 1987, SCG '86.

[4] Leonidas J. Guibas,et al. A linear-time algorithm for computing the voronoi diagram of a convex polygon , 1989, Discret. Comput. Geom..

[5] Joseph O'Rourke. Computational geometry column , 1988, SIGA.

[6] Joseph O'Rourke. Computational geometry column 8 , 1989, SIGA.