電機資訊學院: 資訊工程學研究所指導教授: 趙坤茂林蔚茵Lin, Wei-YinWei-YinLin2017-03-032018-07-052017-03-032018-07-052015http://ntur.lib.ntu.edu.tw//handle/246246/275367The purpose of this dissertation is to study the properties of plurality points and design an efficient algorithm to find them. Given a multiset of $n$ points equipped with the $ell_2$-norm, a emph{plurality point} is a location which is closer to at least as many given points as any other location. This spatial equilibrium formed by voting has been studied for decades in both the field of economy and location theory. For any $d$-dimensional space where $d$ is fixed, we present an $O(n^{d-1} log n)$-time algorithm to compute the point. However, the plurality point may not exist if the given points are not collinear. In order to find an alternative solution, some related problem extensions are also investigated in this dissertation.815601 bytesapplication/pdf論文公開時間: 2015/8/16論文使用權限: 同意有償授權(權利金給回饋學校)演算法歐式空間多數決策點algorithmEuclidean spaceplurality pointthesishttp://ntur.lib.ntu.edu.tw/bitstream/246246/275367/1/ntu-104-F97922079-1.pdf