An O(n log n) algorithm for computing the link center of a simple polygon

On the bit complexity of minimum link paths: superquadratic algorithms for problems solvable in linear time

Proceedings of the twelfth annual symposium on Computational geometry

The Smallest Pair of Noncrossing Paths in a Rectilinear Polygon

IEEE Transactions on Computers

Sweeping simple polygons with a chain of guards

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms

Optimally computing a shortest weakly visible line segment inside a simple polygon

Computational Geometry: Theory and Applications

Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs

Proceedings of the twenty-fourth annual symposium on Computational geometry

Settling the bound on the rectilinear link radius of a simple rectilinear polygon

Information Processing Letters

Diffuse reflection diameter and radius for convex-quadrilateralizable polygons

Discrete Applied Mathematics