skip to main content
Idioma:
Primo Search
Clear Search Box
Search in: Busca Geral
Busca Avançada
Busca por Índices

Euclidean shortest paths in the presence of rectilinear barriers

Lee, D. T. ; Preparata, F. P.

Networks, 1984-09, Vol.14 (3), p.393-410 [Periódico revisado por pares]

New York: Wiley Subscription Services, Inc., A Wiley Company

Sem texto completo

Citações Citado por
  • Título:
    Euclidean shortest paths in the presence of rectilinear barriers
  • Autor: Lee, D. T. ; Preparata, F. P.
  • Assuntos: Algorithmics. Computability. Computer arithmetics ; Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Theoretical computing
  • É parte de: Networks, 1984-09, Vol.14 (3), p.393-410
  • Notas: National Science Foundation - No. MCS 78-13642; No. MCS 79-16847; No. ECS 81-06939
    ArticleID:NET3230140304
    istex:38DCC64673A212A28ACEF10E42621FEB47813ECD
    Joint Services Electronics Program - No. NOOO14-79-C-0424
    ark:/67375/WNG-JS6WPG1P-N
  • Descrição: In this paper we address the problem of constructing a Euclidean shortest path between two specified points (source, destination) in the plane, which avoids a given set of barriers. This problem had been solved earlier for polygonal obstacles with the aid of the visibility graph. This approach however, has an Ω(n2) time lower bound, if n is the total number of vertices of the obstacles. Our goal is to find interesting cases for which the solution can be obtained without the explicit construction of the entire visibility graph. The two cases are (i) the path must lie within an n‐vertex simple polygon; (ii) the obstacles are n disjoint and parallel line segments. In both instances greedy O(n log n) time algorithms can be developed which solve the problems by constructing the shortest‐path tree from the source to all the vertices of the obstacles and to the destination.
  • Editor: New York: Wiley Subscription Services, Inc., A Wiley Company
  • Idioma: Inglês
Links
Voltar para lista de resultados

  • Realização: ABCD-USP USP   Logos de Redes Sociais: Freepik

Buscando em bases de dados remotas. Favor aguardar.