<p>There's something on the multiplicatively weighted farthest neighbor query problem (but not on the associated Voronoi diagram) in my paper</p>

<p>Approximate weighted farthest neighbors and minimum dilation stars.
J. Augustine, D. Eppstein, and K. Wortman.
<a href="http://arxiv.org/abs/cs.CG/0602029" rel="nofollow">arXiv:cs.CG/0602029</a>.
<em>Proc. 16th Annual International Computing and Combinatorics Conference</em> (COCOON 2010), Nha Trang, Vietnam.
<a href="http://dx.doi.org/10.1007/978-3-642-14031-0_12" rel="nofollow">Lecture Notes in Comp. Sci. 6196, Springer-Verlag, 2010, pp. 90-99</a>.
<a href="http://dx.doi.org/10.1142/S1793830910000887" rel="nofollow"><em>Discrete Mathematics, Algorithms and Applications</em> 2(4): 553-656, 2010</a>.</p>

CC BY-SA 3.0
2014-10-11T16:55:07.373Z
2014-10-11T16:55:07.373Z
David Eppstein
<p>I found that Weighted nearest neighbor voronoi diagrams are widely studied and there are optimal algorithms for that. </p>

<p>But I could not find anything on Weighted furthest point voronoi diagrams !! But it is very unlikely that this version of voronoi diagrams are not studied before.</p>

<p>So, any link / reference will be helpful. </p>

<reference-request><co.combinatorics><computational-geometry><voronoi>
Weighted furthest point voronoi diagrams
Dibyayan
# Weighted furthest point voronoi diagrams

(Asked by: username_0 on 2014-10-11)

I found that Weighted nearest neighbor voronoi diagrams are widely studied and there are optimal algorithms for that.

But I could not find anything on Weighted furthest point voronoi diagrams !! But it is very unlikely that this version of voronoi diagrams are not studied before.

So, any link / reference will be helpful.

**Tags:** reference-request, co.combinatorics, computational-geometry, voronoi

---

## 1 answers

### Answer by username_1 on 2014-10-11. Score: 2 | Accepted answer

There's something on the multiplicatively weighted farthest neighbor query problem (but not on the associated Voronoi diagram) in my paper

Approximate weighted farthest neighbors and minimum dilation stars.
J. Augustine, D. Eppstein, and K. Wortman.
[arXiv:cs.CG/0602029](http://arxiv.org/abs/cs.CG/0602029).
*Proc. 16th Annual International Computing and Combinatorics Conference* (COCOON 2010), Nha Trang, Vietnam.
[Lecture Notes in Comp. Sci. 6196, Springer-Verlag, 2010, pp. 90-99](http://dx.doi.org/10.1007/978-3-642-14031-0_12).
[*Discrete Mathematics, Algorithms and Applications* 2(4): 553-656, 2010](http://dx.doi.org/10.1142/S1793830910000887).


---

