Computing the widest empty boomerang

Boaz Ben-Moshe; Binay Bhattacharya; Qiaosheng Shi

Computing the widest empty boomerang

Boaz Ben-Moshe
, Binay Bhattacharya
, Qiaosheng Shi

Research output: Contribution to conference › Paper › peer-review

Abstract

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 language	English
Pages	80-83
Number of pages	4
State	Published - 1 Jan 2005
Externally published	Yes
Event	17th Canadian Conference on Computational Geometry, CCCG 2005 - Windsor, Canada Duration: 10 Aug 2005 → 12 Aug 2005

Conference

Conference	17th Canadian Conference on Computational Geometry, CCCG 2005
Country/Territory	Canada
City	Windsor
Period	10/08/05 → 12/08/05

ASJC Scopus subject areas

Geometry and Topology
Computational Mathematics

Cite this

@conference{e9a0cd7a152e4247b9a0330583edbb1c,

title = "Computing the widest empty boomerang",

abstract = "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].",

author = "Boaz Ben-Moshe and Binay Bhattacharya and Qiaosheng Shi",

note = "Publisher Copyright: {\textcopyright} 2005 Canadian Conference on Computational Geometry. All rights reserved.; 17th Canadian Conference on Computational Geometry, CCCG 2005 ; Conference date: 10-08-2005 Through 12-08-2005",

year = "2005",

month = jan,

day = "1",

language = "English",

pages = "80--83",

}

TY - CONF

T1 - Computing the widest empty boomerang

AU - Ben-Moshe, Boaz

AU - Bhattacharya, Binay

AU - Shi, Qiaosheng

PY - 2005/1/1

Y1 - 2005/1/1

N2 - 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].

AB - 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].

UR - https://www.scopus.com/pages/publications/85065572301

M3 - Paper

AN - SCOPUS:85065572301

SP - 80

EP - 83

T2 - 17th Canadian Conference on Computational Geometry, CCCG 2005

Y2 - 10 August 2005 through 12 August 2005

ER -

Computing the widest empty boomerang

Abstract

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this