liu.seSök publikationer i DiVA
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Minimum-link paths revisited
Stony Brook University, USA.
Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska högskolan. University of Helsinki, Finland.
University of Helsinki, Finland .
2014 (Engelska)Ingår i: Computational geometry, ISSN 0925-7721, E-ISSN 1879-081X, Vol. 47, nr 6, s. 651-667Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

A path or a polygonal domain is C-oriented if the orientations of its edges belong to a set of C given orientations; this is a generalization of the notable rectilinear case (C = 2). We study exact and approximation algorithms for minimum-link C-oriented paths and paths with unrestricted orientations, both in C-oriented and in general domains. Our two main algorithms are as follows: A subquadratic-time algorithm with a non-trivial approximation guarantee for general (unrestricted-orientation) minimum-link paths in general domains. An algorithm to find a minimum-link C-oriented path in a C-oriented domain. Our algorithm is simpler and more time-space efficient than the prior algorithm. We also obtain several related results: 3SUM-hardness of determining the link distance with unrestricted orientations (even in a rectilinear domain). An optimal algorithm for finding a minimum-link rectilinear path in a rectilinear domain. The algorithm and its analysis are simpler than the existing ones. An extension of our methods to find a C-oriented minimum-link path in a general (not necessarily C-oriented) domain. A more efficient algorithm to compute a 2-approximate C-oriented minimum-link path. A notion of "robust" paths. We show how minimum-link C-oriented paths approximate the robust paths with unrestricted orientations to within an additive error of 1.

Ort, förlag, år, upplaga, sidor
Elsevier, 2014. Vol. 47, nr 6, s. 651-667
Nyckelord [en]
Path planning; Link distance; Approximations; 3SUM-hardness
Nationell ämneskategori
Teknik och teknologier
Identifikatorer
URN: urn:nbn:se:liu:diva-106274DOI: 10.1016/j.comgeo.2013.12.005ISI: 000333728300003OAI: oai:DiVA.org:liu-106274DiVA, id: diva2:715765
Tillgänglig från: 2014-05-06 Skapad: 2014-05-05 Senast uppdaterad: 2017-12-05Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltext

Personposter BETA

Polishchuk, Valentin

Sök vidare i DiVA

Av författaren/redaktören
Polishchuk, Valentin
Av organisationen
Kommunikations- och transportsystemTekniska högskolan
I samma tidskrift
Computational geometry
Teknik och teknologier

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 30 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf