1. Finding minimal convex nested polygons;Aggarwal;Information and Computation,1989
2. Logarithmic-time link path queries in a simple polygon;Arkin;International Journal of Computational Geometry and Applications,1995
3. Shortest path to a segment and quickest visibility queries;Arkin;Journal of Computational Geometry,2016
4. Triangulating a simple polygon in linear time;Chazelle;Discrete and Computational Geometry,1991
5. Developing algorithms and software for geometric path planning problems;Chen;ACM Computing Surveys (CSUR),1996