An optimal deterministic algorithm for geodesic farthest-point voronoi diagrams in simple polygons

HIGHLIGHTS

• who: Related Version Full Version et al. from the Department of Computer Science, Utah State University, Logan, UT, USA have published the article: An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons, in the Journal: (JOURNAL)
• what: The authors report α(s, t, r) as a Voronoi vertex and report Note that the result was not explicitly given but can be obtained from their O(n log log n+m log m)time algorithm for computing FVD(S). For completeness, the authors provide a binary search scheme on the geodesic path π(p . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or E-mail:

  If you don't have an account, you can create one here.