Abstract
Given a simple polygon P on n vertices, nr of which are reflex, and a set D of m pairwise intersecting geodesic disks in P, we show that at most 14 points in P suffice to pierce all the disks in D and these points can be computed in O(n+mlognr) time.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have