1. Cairns SS (1951) An elementary proof of the Jordan-Schoenflies theorem. Proc Am Math Soc 2:860–867
2. Chazelle B (1982) A theorem on polygon cutting with applications. Proc IEEE Symposium, on Foundations of Computer Science, Chicago. 23:339–349
3. Chazelle B (1990) Triangulating a simple polygon in linear time. Technical Report, CS-TR-264-90, Department of Computer Science, Princeton University
4. Chazelle B, Incerpi J (1984) Triangulation and shape complexity. ACM Trans Graph 3:135–152
5. ElGindy HA (1985) A linear algorithm for triangulating weakly externally visible polygons. Technical Report MS-CIS-86-75, University of Pennsylvania