Finding a shortest diagonal of a simple polygon in linear time

Aggarwal, 1992, Optimal time bounds for some proximity problems in the plane, Information Processing Letters, 42, 55, 10.1016/0020-0190(92)90133-G Chazelle, 1991, Triangulating a simple polygon in linear time, Discrete and Computational Geometry, 6, 485, 10.1007/BF02574703 Guibas, 1987, Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons, Algorithmica, 2, 209, 10.1007/BF01840360 Hershberger, 1993, Matrix searching with the shortest path metric, 485 Lingas, 1989, Voronoi diagrams with barriers and the shortest diagonal problem, Information Processing Letters, 32, 191, 10.1016/0020-0190(89)90043-4 O'Rourke, 1989, Computational geometry column 8, SIGACT News, 20, 30, 10.1145/74074.74081 Preparata, 1985 Suri, 1987, Minimum link paths in polygons and related problems Suri, 1990, On some link distance problems in a simple polygon, IEEE Transactions on Robotics and Automation, 6, 108, 10.1109/70.88124 Zhu, 1992, Computing the shortest diagonal of a monotone polygon in linear time, Information Processing Letters, 42, 303, 10.1016/0020-0190(92)90227-M