Computational geometry: an introduction
Computational geometry: an introduction
A linear time algorithm for finding all farthest neighbors in a convex polygon
Information Processing Letters
A linear-time algorithm for computing the Voronoi diagram of a convex polygon
Discrete & Computational Geometry
Computational geometry in C (2nd ed.)
Computational geometry in C (2nd ed.)
Computing the optimal bridge between two convex polygons
Information Processing Letters
Building bridges between convex regions
Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
Finding optimal weighted bridges with applications
Proceedings of the 44th annual Southeast regional conference
| Hi-index | 0.89 |
Given two convex polygons P and Q we want to find a line segment (a bridge) that connects P and Q so that the maximum distance from a point inside P across the bridge to a point inside Q is minimized. We propose a linear-time algorithm to solve this problem, improving the O(n2log(n)) algorithm described by Cai, Xu and Zhu [Inform. Process. Lett. 69 (1999) 127-130].