M.H. Alsuwaiyel (Saudi Arabia)
Computational geometry, Diameter, Maximum of diameters, Shape decomposition, Pattern recognition.
We consider the problem of bipartitioning a convex poly gon P at its vertices into two convex polygons P1 and P2 such that the maximum of diameters of P1 and P2 is mini mum among all bipartitions. We present a simple algorithm to solve this problem in time Θ(n).
Important Links:
Go Back
