Computing farthest neighbors on a convex polytope

Let N be a set of n points in convex position in R-3. The farthest point Voronoi diagram of N partitions R-3 into n convex cells. We consider the intersection G(N) of the diagram with the boundary of the convex hull of N. We give an algorithm that computes an implicit representation of G(N) in expected O(n log(2) n) time. More precisely, we compute the combinatorial structure of G(N), the coordinates of its vertices, and the equation of the plane defining each edge of G(N). The algorithm allows us to solve the all-pairs farthest neighbor problem for N in expected time O(n log(2) n), and to perform farthest-neighbor queries on N in O(log(2) n) time with high probability. (C) 2002 Elsevier Science B.V. All rights reserved.
Publisher
ELSEVIER SCIENCE BV
Issue Date
2003-03
Language
ENG
Keywords

ALGORITHM

Citation

THEORETICAL COMPUTER SCIENCE, v.296, pp.47 - 58

ISSN
0304-3975
DOI
10.1016/S0304-3975(02)00431-0
URI
http://hdl.handle.net/10203/309
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
2002-013.pdf(210.11 kB)Download
  • Hit : 473
  • Download : 223
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 8 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0