Computing the link center of a simple polygon

Optimal link path queries in a simple polygon

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms

Efficient piecewise-linear function approximation using the uniform metric: (preliminary version)

SCG '94 Proceedings of the tenth annual symposium on Computational geometry

Visibility with reflection

Proceedings of the eleventh annual symposium on Computational geometry

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

On Bends and Distances of Paths Among Obstacles in Two-Layer Interconnection Model

IEEE Transactions on Computers

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

On the polygonal diameter (= link diameter) of the interior, resp. exterior, of a simple closed polygon in the plane

Discrete Applied Mathematics