Minimum-Link C-Oriented Paths Visiting a Sequence of Regions in the Plane

Kerem Geva, Matthew J. Katz, Joseph S.B. Mitchell, Eli Packer

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

Abstract

Let be a set of C-oriented disjoint segments in R is a given finite set of orientations that spans the plane, and let s and t be two points. We seek a minimum-link C-oriented tour of E, that is, a polygonal path from s to t that visits the segments of E in order, such that, the orientations of its edges are in C and their number is minimum. We present an algorithm for computing such a tour in time. This problem already captures most of the difficulties occurring in the study of the more general problem, in which E is a set of not-necessarily-disjoint C-oriented polygons.

Original languageAmerican English
Title of host publicationAlgorithms and Complexity - 13th International Conference, CIAC 2023, Proceedings
EditorsMarios Mavronicolas
PublisherSpringer Science and Business Media Deutschland GmbH
Pages247-262
Number of pages16
ISBN (Print)9783031304477
DOIs
StatePublished - 1 Jan 2023
Event13th International Symposium on Algorithms and Complexity, CIAC 2023 - Larnaca, Cyprus
Duration: 13 Jun 202316 Jun 2023

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume13898 LNCS

Conference

Conference13th International Symposium on Algorithms and Complexity, CIAC 2023
Country/TerritoryCyprus
CityLarnaca
Period13/06/2316/06/23

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Minimum-Link C-Oriented Paths Visiting a Sequence of Regions in the Plane'. Together they form a unique fingerprint.

Cite this