All farthest neighbors in the presence of highways and obstacles

Sang Won Bae, Matias Korman, Takeshi Tokuyama

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

Abstract

We consider the problem of computing all farthest neighbors (and the diameter) of a given set of n points in the presence of highways and obstacles in the plane. When traveling on the plane, travelers may use highways for faster movement and must avoid all obstacles. We present an efficient solution to this problem based on knowledge from earlier research on shortest path computation. Our algorithms run in O(nm(logm + log2 n)) time using O(m + n) space, where the m is the combinatorial complexity of the environment consisting of highways and obstacles.

Original languageEnglish
Title of host publicationWALCOM
Subtitle of host publicationAlgorithms and Computation - Third International Workshop, WALCOM 2009, Proceedings
Pages71-82
Number of pages12
DOIs
Publication statusPublished - 2009
Event3rd International Workshop on Algorithms and Computation, WALCOM 2009 - Kolkata, India
Duration: 2009 Feb 182009 Feb 20

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5431 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other3rd International Workshop on Algorithms and Computation, WALCOM 2009
CountryIndia
CityKolkata
Period09/2/1809/2/20

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'All farthest neighbors in the presence of highways and obstacles'. Together they form a unique fingerprint.

Cite this