L geodesic farthest neighbors in a simple polygon and related problems

HIGHLIGHTS

• who: Polygon et al. from the Department of Computer Science, Kyonggi University, Suwon, South Korea have published the article: L Geodesic Farthest Neighbors in a Simple Polygon and Related Problems, in the Journal: (JOURNAL)
• what: The authors investigate the L1 geodesic farthest neighbors in a simple P and address several fundamental to farthest neighbors. The authors show that all these can be solved in linear or near-linear time based on the new observations on farthest neighbors and extreme points. In the following, the authors show that there are at most one more extreme point . . .
  

   

  

  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.