Computing the widest empty boomerang

Boaz Ben-Moshe, Binay Bhattacharya, Qiaosheng Shi

Research output: Contribution to conferencePaperpeer-review


In this paper we consider the following obnoxious facility location problem: Given a set S of n points in the plane, and two special points a and b, find the 1-corner polygonal chain (also known as boomerang) connecting a and b such that its minimum distance to S is maximized. In other words: Find the widest empty polygonal chain of two edges having extremes anchored at a and b. We present a new O(n log n) algorithm which improves the previous O(n2) result [3].

Original languageEnglish
Number of pages4
StatePublished - 2005
Externally publishedYes
Event17th Canadian Conference on Computational Geometry, CCCG 2005 - Windsor, Canada
Duration: 10 Aug 200512 Aug 2005


Conference17th Canadian Conference on Computational Geometry, CCCG 2005


Dive into the research topics of 'Computing the widest empty boomerang'. Together they form a unique fingerprint.

Cite this