1. The Design and Analysis of Computer Algorithms;Aho,1974
2. A theorem on polygon cutting with applications;Chazelle;Proc. 23rd Annual IEEE Symp. on Foundations of Computer Science,1982
3. Triangulating a simple polygon in linear time;Chazelle;Proc. 31st Annual IEEE Symp. on Foundations of Computer Science,1990
4. Rectilinear shortest paths through polygonal obstacles in O(n(log n)2) time;Clarkson;Proc. 3rd Annual ACM Symp. on Computational Geometry,1987
5. An O(n log n) Algorithm for computing the link centre in a simple polygon;Djidjev;Proc. 6th Annual ACM Symp. on Theoretical Aspects of Computer Science (STACS '89),1989