Skip to main navigation Skip to search Skip to main content

An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains

  • Linköping University
  • Alphabet Inc.
  • Utah State University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

We present a new algorithm for finding minimum-link rectilinear paths among h rectilinear obstacles with a total of n vertices in the plane. After the plane is triangulated, for any point s, our algorithm builds an O(n)-size data structure in O(n+h log h) time, such that given any query point t, we can compute a minimum-link rectilinear path from s to t in O(log n + k) time, where k is the number of edges of the path, and the query time is O(log n) if we only want to know the value k. The previously best algorithm solves the problem in O(n log n) time.

Original languageEnglish
Title of host publicationAutomata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Proceedings
EditorsMagnus M. Halldorsson, Naoki Kobayashi, Bettina Speckmann, Kazuo Iwama
PublisherSpringer Verlag
Pages947-959
Number of pages13
ISBN (Print)9783662476710
DOIs
StatePublished - 2015
Event42nd International Colloquium on Automata, Languages and Programming, ICALP 2015 - Kyoto, Japan
Duration: Jul 6 2015Jul 10 2015

Publication series

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

Conference

Conference42nd International Colloquium on Automata, Languages and Programming, ICALP 2015
Country/TerritoryJapan
CityKyoto
Period07/6/1507/10/15

Fingerprint

Dive into the research topics of 'An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains'. Together they form a unique fingerprint.

Cite this