Abstract
Let V be a set of n points in R^d, which we call voters, where d is a fixed constant. A point p in R^d is preferred over another point p' in R^d by a voter v in V if dist(v,p) < dist(v,p'). A point p is called a plurality point if it is preferred by at least as many voters as any other point p'.
We present an algorithm that decides in O(n log n) time whether V admits a plurality point in the L_2 norm and, if so, finds the (unique) plurality point.
| Original language | English |
|---|---|
| Title of host publication | 32nd European Workshop on Computational Geometry (EuroCG 2016), 30 March - 1 April, Lugano, Switzerland |
| Pages | 1-4 |
| Publication status | Published - 2016 |
| Event | 32nd European Workshop on Computational Geometry (EuroCG 2016) - Lugano, Switzerland Duration: 30 Mar 2016 → 1 Apr 2016 Conference number: 32 http://www.eurocg2016.usi.ch/ |
Workshop
| Workshop | 32nd European Workshop on Computational Geometry (EuroCG 2016) |
|---|---|
| Abbreviated title | EuroCG 2016 |
| Country/Territory | Switzerland |
| City | Lugano |
| Period | 30/03/16 → 1/04/16 |
| Internet address |