Algorithm for determining whether m given demand points are on a hemisphere or not

Wen Hsien Tsai, Maw Sheng Chern, Tsong Ming Lin

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Abstract

Location problems on a sphere can be solved easily by mathematical programming or geometrical methods if it is known that all the demand points are located on a hemisphere. This paper presents an algorithm for determining whether m given demand points are on a hemisphere or not. In this algorithm, the great circle is rotated successively until the hemisphere which contains the m given demand points is found or it becomes known using our criteria that the m given demand points are not on a hemisphere. The convergence of this algorithm is proved, and two illustrative examples are presented.

Original languageEnglish
Pages (from-to)91-97
Number of pages7
JournalTransportation Science
Volume25
Issue number1
DOIs
StatePublished - 1991

Fingerprint

Dive into the research topics of 'Algorithm for determining whether m given demand points are on a hemisphere or not'. Together they form a unique fingerprint.

Cite this